[DMANET] Post-Doctoral Positions in Algorithms and Lower Bounds (Bristol University, UK)

Two postdoctoral positions available in Algorithms and Lower bounds at
the University of Bristol, UK.

Based in the Department of Computer Science at the University of
Bristol you will carry out research within a project concerned with
the development of new algorithms as well as provable time and space
lower bounds for pattern matching in dynamically changing as well as
streaming data.

This will require a high level of expertise in areas which may include
but not be limited to data structures, algorithms, probability,
discrete mathematics and combinatorics.

Post 1
The emphasis will be new pattern matching algorithms with provable
performance bounds such as appear in the conferences
ICALP/SODA/STOC/FOCS. You will also at times implement and test
algorithms related to the proposal.

Post 2
This role will have as its main focus the development of time and
space lower bounds for pattern matching problems. You will ideally
already be familiar with lower bound techniques such as the chronogram
method and Mihai Patrascu's information transfer method.

For both posts you will have Ph.D. in theoretical computer science or
closely related area together with a very strong track record of
international publications in algorithms/theoretical computer science
venues.

In addition you will have excellent written and spoken communication
skills including the ability to explain and share deep concepts. You
should have a strong mathematical background and ideally excellent
programming skills.

Appointments will be made at Research Assistant or Research Associate
depending on skills and experience.

Both posts are funded for three years. If successful, you may be
appointed either on a fixed-term or an open-ended contract depending
on the extent of your previous relevant research experience. Three
years' appropriate and relevant experience at another higher education
institution would normally lead to an appointment on an open-ended
contract. Further information can be found at
www.bristol.ac.uk/hr/ftc/

More details are available by following the link in thew News section
of http://www.cs.bris.ac.uk/Research/Algorithms/ .

Informal enquires can be made to Dr Raphael Clifford +44 117 331 5147,
email Raphael.Clifford@bristol.ac.uk
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************