member at the Lecturer/Senior Lecturer level (comparable to
tenure-track Assistant/Associate Professorships).
Candidates are sought with expertise and research interests in
algorithms and complexity. The department has existing expertise in
streaming algorithms, distributed algorithms, combinatorial pattern
matching, lower bounds and related areas and will welcome applications
from strong candidates from all parts of "A"-track theory (e.g.
STOC/FOCS/SODA/SoCG/PODC). The successful candidate will be expected
to take a major role in strengthening and growing research and
teaching in computer science at Bristol.
For informal discussion about the post you are welcome to contact:
Raphaël Clifford (Head of the Theory and Algorithms group,
raphael.clifford@bristol.ac.uk)
Deadline: 13-Jan-2019. Interviews are expected to take place in early February.
Details: https://goo.gl/ngvAw9
**********************************************************
*
* 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/
*
**********************************************************