Tel Aviv University invites applications for postdoctoral scholar positions for the 2026–27 academic year (with an extension option to 2027–28).

Postdoctoral scholars will work with faculty members Tomer Ezra, Michal Feldman, Amos Fiat, and Inbal Talgam-Cohen, alongside a strong group of outstanding students and postdoctoral researchers.

Website: https://tomer-ezra.github.io/Tau-AGT-Postdoc/
Email: michalgl@tauex.tau.ac.il

The Department of Computer & Information Sciences at the University of Delaware is hiring a tenure-track assistant professor in computer science theory. Theory is broadly construed to include the theory of computation, algorithms, logic, verification, formal methods, programming languages, or any area of computer science with a strong theoretical component. Position is open until filled.

Website: https://careers.udel.edu/en-us/job/502682
Email: siegel@udel.edu

Applications are invited for up to two postdoctoral positions in the Complexity Group at Imperial College London (South Kensington, central London), led by Iddo Tzameret. Start date is flexible.

To apply, please email your CV.
Informal inquiries are welcome. Application deadline: reviewed on a rolling basis (earlier is better).

Website: https://www.doc.ic.ac.uk/~itzamere/
Email: iddo.tzameret@gmail.com

The Department of Computer Science invites applications for one or more tenure-track or tenured faculty positions beginning Fall 2026.

Website: https://listings.jobs.gmu.edu/jobs/open-rank-tenured-tenure-track-computer-science-faculty-fairfax-va-virginia-united-states-other-1cc38d2d-b743-416c-b3fb-9e42b957a24a
Email: gordon@gmu.edu

Saarland University is offering a professorship (W2 tenure track W3) in quantum algorithms, quantum complexity and quantum information theory.

Website: https://www.uni-saarland.de/fileadmin/upload/verwaltung/stellen/Wissenschaftler/W2745_W2TTW3_Quantum_Algorithms__Complexity_and_Quantum_Information_Theory.pdf
Email: mblaeser@cs.uni-saarland.de

We are pleased to announce the start of the search for Tenure Track position at HSE Faculty of Computer Science.
Requirements: Candidates must hold a recent PhD in Computer Science or a related field from a recognized university. Preferred qualifications include teaching experience at top foreign universities. Proficiency in English is essential; knowledge of Russian is not required.

Website: https://iri.hse.ru/ru/TT_CompSci_2025
Email: iri@hse.ru

A Ph.d. position is available in the TCS group of the University of Sheffield, under the supervision of Or Meir and Swagato Sanyal. Generally, our research interests are Boolean function analysis, query complexity, communication complexity, and circuit complexity.

Website: https://www.findaphd.com/phds/project/computational-complexity-theory/?p193336
Email: o.meir@sheffield.ac.uk

This is a position within the OpenDP open-source software project. Candidates should have familiarity with differential privacy and an interest in advancing its applications. Candidates whose profile does not exactly fit the posting (e.g. being more junior or more senior) should still reach out to us and apply; we may be able to tailor the position to fit.

Website: https://opendp.org/job-opportunities/
Email: info@opendp.org

The Algorithms & Complexity group at the University of Waterloo is offering postdoctoral positions starting in the Fall of 2026. We seek candidates from all areas of theoretical computer science.

Interested applicants should have their materials sent as in the link below, and questions can be sent to the email below.
Applications are due **January 31st, 2026**.

Website: https://algcomp.uwaterloo.ca/positions/
Email: theory.waterloo@gmail.com

Two post-doctoral (researcher) positions in Algorithms associated with the ERC Advanced Grant project New Horizons of Parameterized Complexity (NewPC).

Website: https://www.jobbnorge.no/en/available-jobs/job/291007/researcher-1109-two-temporary-positions-in-algorithms
Email: fedor.fomin@uib.no