Multiple Assistant Professor positions in CS are available at the University of Warsaw (UW), including two with reduced teaching and increased salary. UW has one of the leading CS institutes in Europe with excellent students (highly successful in ACM ICPC) and strong research teams, especially in algorithms, logic and automata, and algorithmic economy (7 ERC grants in CS running at the moment).

Website: https://jobs.uw.edu.pl/en-gb/offer/WMIM_2026/field/ADIUNKT/
Email: Filip Murlak ; Oskar Skibski

CENIA (Chilean National Center for Artificial Intelligence) invites applications for a Postdoc positions in AI and related areas. We are looking for candidates to conduct research in areas such as deep learning, neuro-symbolic AI, brain-inspired AI, physics-based machine learning, human-centered AI, or similar.

Website: https://cenia.cl/2026/01/27/call-for-application-postdoctoral-position-in-ai/
Email: alexander.kozachinskyi@cenia.cl

PhD Position – Crypto4AI Lab (AI4I & Bocconi).
Research in cryptography for AI: private inference, model integrity, watermarking, cryptanalysis, ML experimentation. Req: MSc in CS/math or related, strong background in TCS/crypto/ML.
Apply via AI4I form + Bocconi PhD admissions (deadline Feb 5, 2026).

Website: https://app.ncoreplat.com/jobsharingredirect/777335/phd-in-cryptography-for-machine-learning-it/research-and-development?type=1&platform=19&sharing=4968616
Email: https://ai4i.it/phd-in-cryptography-for-machine-learning-january-2026/

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