We are seeking applications from individuals whose research focuses on the formal analysis of AI systems, with the aim of proving that these systems are responsible, unbiased, trustworthy, secure and robust against adversarial behaviour.

Website: https://www.jobs.gla.ac.uk/job/lecturer-slash-senior-lecturer-slash-reader-in-foundational-ai
Email: david.manlove@glasgow.ac.uk

Tom Gur and Prakash Murali are seeking to jointly recruit a postdoctoral researcher–Dowling fellow–at Cambridge, to conduct research focused on quantum algorithms, complexity, error correction, and architecture. The position has funding for up to 5 years.

Website: http://www.jobs.cam.ac.uk/job/50485/
Email: tom.gur@cl.cam.ac.uk

The students will work in the group of assistant professor Ioana-Oriana Bercea. The research team has a focus on randomized algorithms and probabilistic data structures such as data sketches, Bloom filters, and hash functions. We are also interested in implementing and developing efficient data structures for subroutines that appear in data science algorithms.

Website: https://www.kth.se/lediga-jobb/803006?l=en
Email: bercea@kth.se

The LIP laboratory is opening a one-year post-doctoral fellowship in Computer Science at the ENS Lyon, France. All research themes of the laboratory are eligible.

Website: https://www.ens-lyon.fr/LIP/index.php/useful-informations/open-positions/688-post-doc-lip-2025
Email: isabelle.guerin-lassous@ens-lyon.fr, russell.harmer@ens-lyon.fr

An NSF-funded summer research position is available for a graduate student under the supervision of Guy Moshkovitz (CUNY). Can be in NYC or remote.
The position is well-suited for students with research experience and interest in topics at the intersection between TCS (esp. arithmetic circuits or coding theory) and math (additive combinatorics, algebraic geometry, number theory, graph theory).

Website: https://sites.google.com/view/guy-moshkovitz/summer-position
Email: guymoshkov@gmail.com

We are a bit late in the cycle but we have up to two positions at all levels in Theoretical Computer Science (broadly defined): we encourage applicants in both algorithms and complexity theory. (The March 10 is a soft deadline.)

Website: https://www.ubjobs.buffalo.edu/postings/55930
Email: cse-theory-search@buffalo.edu

Depending on the interests of the applicant, research topics include fine-grained and bounded space cryptography, realization of idealized models, relationship between cryptographic notions, and similar topics in foundational cryptography. Exploring connections to statistical security notions and formal methods is possible.

Website: https://www.chalmers.se/en/about-chalmers/work-with-us/vacancies/?rmpage=job&rmjob=p13670
Email: christoph.egger@chalmers.se

The Simons Institute for the Theory of Computing invites applications for Simons-Berkeley Research Fellowships for the Spring 2026 semester. Simons-Berkeley Research Fellowships are intended for exceptional scientists to participate in at least one of the semester-long programs at the institute. The Institute will host one program in Spring 2026: Federated and Collaborative Learning.

Website: https://simons.berkeley.edu/research-fellowship-call-applications
Email: simonsassociatedirector@berkeley.edu

We are looking for a postdoctoral researcher with a strong background in computational complexity, with emphasis on complexity of arithmetic circuits, propositional proofs, or communication complexity to work with the members of the department of Mathematical Logic and Theoretical Computer Science.

Website: https://application.math.cas.cz/Positions.html#page=CALL_LIST
Email: hrubes@math.cas.cz

The Department of Computer Science at Aalto University (Finland) is hiring five Assistant Professors. One of the positions is in “Programming Languages”.

Website: https://www.aalto.fi/en/department-of-computer-science/assistant-professor-positions
Email: laura.kuusisto-noponen@aalto.fi