Postdoc in sublinear and randomized algorithms

by , under Positions

We are looking for excellent candidates for a postdoctoral position in the area of the design and analysis of randomized and sublinear algorithms and their applications.
The main objective is to pursue cutting edge research in the area of design and mathematical analysis of randomized and sublinear algorithms, including research in property testing, complexity of algorithms, and the study of efficient and/or sublinear-time and/or streaming approximation algorithms for combinatorial and optimization problems.

The position is for 24 months, starting from January 2016 or shortly after (the start date is flexible and can be negotiated).

The applicants are expected to have a strong background in the mathematical analysis of algorithms or discrete mathematics, with a specialization in randomized algorithms, approximation algorithms, streaming algorithms, graph algorithms, combinatorics, or probability theory.

The applicants are expected to have (or expect to obtain shortly) a PhD in the relevant area.

The postdoc will join a team of internationally renowned researchers at the Centre for Discrete Mathematics and its Applications (DIMAP) and the Foundations of Computer Science Research Group in the Department of Computer Science at the University of Warwick. The Department of Computer Science at the University of Warwick is one of the leading Computer Science departments in the UK, was ranked 2nd in UK in the most recent research assessment exercise, and is a founding partner in the Alan Turing Institute, the UK’s national data science institute.

Informal inquiries should be addressed to Artur Czumaj at

Formal applications, which include CV with a list of publications,, a research statement, and a short statement highlighting your suitability for this post, should be made following the link at