Application deadline June 6, 2016. Start date negotiable but
ideally by September 2016.
This is a fixed term appointment terminating end of December 2017.
The Algorithms team in the Department of Computer Science at Bristol
University is looking to hire a postdoctoral researcher in the areas
of algorithms research and/or lower bounds. The post will require a
high level of expertise in areas which may include but not be limited
to data structures/algorithms, discrete probability, discrete
mathematics and combinatorics.
Our current work focuses on pattern matching in dynamically changing
data however we also have a broader interest in other aspects of
algorithms/theory research.
The ideal candidate will have a Ph.D. in theoretical computer science
("Track A") or closely related mathematical area together with a
strong track record of international publications in algorithms or
theoretical computer science ("Track A") venues. This may include for
example, ICALP/SODA/STOC/FOCS. We welcome applications from talented
computer scientists whose main interest has been in mainstream "Track
A" theory rather than specifically pattern matching.
Please see http://bit.ly/1Zn3r0z for full details both of the post and
the application process.
**********************************************************
*
* 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/
*
**********************************************************
Posts
