The School of Computer Science at the University of Bristol is looking to appoint an outstanding candidate for a lectureship (roughly equivalent to the level of Assistant Professor in the North American system) in Algorithms and Complexity. Our aim is to hire an ambitious theorist with a proven track record of high-quality publications whose ambition is to develop and pursue their independent research agenda. We will consider applicants from all subfields within Algorithms and Complexity research.
You will join our steadily growing Algorithms and Complexity research group, which is internationally recognized for their work on algorithms and lower bounds in the fields of sublinear algorithms, randomized algorithms, graph and string algorithms, and parameterized and fine-grained complexity. We offer a vibrant research environment with opportunities for collaborations with the members of the Algorithms and Complexity group as well as with the world-leading academics in the school of Mathematics.
Application Deadline: July 15th
For more information and for submitting your application, please visit:
https://www.bristol.ac.uk/jobs/find/details/?jobId=350015&jobTitle=Lecturer%20in%20Algorithms%20and%20Complexity%20
For informal queries please contact:
- Dr Christian Konrad for enquiries regarding the Algorithms and Complexity group.
[email protected]
- Professor Mike Fraser for enquiries regarding the School of Computer Science.
[email protected]