Postdoctoral Positions in Algorithms and Complexity
Posted Sep 25, 2026
Waterloo, Canada
Research Assistant/Associate in Theoretical Computer Science (Fixed Term)
Computer Science, Machine Learning, Cryptography and fixed-term position at University of Cambridge
Apply by Tuesday, Dec 1
Closing time not stated; check the source.
Cambridge, United Kingdom
About
Join Tom Gur’s group to study classical and quantum complexity. Research directions include sublinear algorithms, property testing, cryptography, proof systems, locally testable codes, learning theory, harmonic analysis and additive combinatorics. The one-year project connects theoretical computer science with mathematical and quantum methods.
Topics
- quantum complexity
- sublinear algorithms
- property testing
- Cryptography
- proof systems
- locally testable codes
- learning theory
- harmonic analysis
- additive combinatorics
Requirements
PhD or equivalent research experience in computer science or a related field; candidates awaiting their PhD may initially join at Research Assistant level.
Related jobs
Postdoctoral Research Associate - HPC Confidential Computing and Secure Multi-tenancy
Posted Oct 13, 2026Oak Ridge, United StatesSeeking a Research Scientist or a Postdoctoral Researcher (26-1239)
Posted Oct 2, 2026Tokyo, Japan
Open jobs in Computer Science
All jobsProfessor of Digital and Computational Studies
Bates College · Lewiston, United StatesPostdoctoral Research Associate - HPC System Architecture and Intelligent Storage Design
Oak Ridge National Laboratory · Oak Ridge, United StatesResearch Scientist, Asta
Allen Institute for Artificial Intelligence (Ai2) · Seattle, United StatesPostdoctoral Research Positions in Condensed Matter and Quantum Information Theory at TU Munich
Closes Nov 22Technical University of Munich · Garching, Germany
Source: hrsystems.admin.cam.ac.uk