Research Associate

Full-time: 35 hours per week

Fixed-term: 30^th June 2026

Applications are invited for research associate positions in Algorithms and Complexity, funded by the European Research Council (ERC) starting grant “New Approaches to Counting and Sampling” (NACS), led by Dr. Heng Guo in the School of Informatics, University of Edinburgh.

The Opportunity:

The project NACS aims to explore new frontiers in computational counting and sampling, including developing new algorithms and analysis techniques. Typical tools and topics are Markov chains Monte Carlo, Lovasz local lemma, high dimensional expanders, geometry of polynomials, etc. The successful applicant will be generously supported by the project and will have the opportunity to collaborate with project partners.

Your skills and attributes for success:

Essential:

• PhD (or near completion) in Computer Science, Mathematics, or related fields
• Evidence of the ability to conduct high-quality research and produce publications in top-tier venues
• Confidence in understanding and handling of complex mathematical ideas. Firm knowledge of randomised algorithms and discrete probability

Desirable:

• Experience of research in computational counting and sampling
• Outstanding publication record
• Excellence in written and oral communication, planning and time management skills

Contact details for enquiries: Heng Guo (hguo@inf.ed.ac.uk)

Advert information