[Proof Complexity] Imperial Research Fellowships (IRF) 2026 – Theory of Computing

Iddo Tzameret iddo.tzameret at gmail.com
Fri May 22 09:00:00 CEST 2026


Dear all,

Imperial College London has opened the 2026 Imperial Research Fellowships
(IRF): a 4-year fellowship for outstanding early-career researchers to
establish research independence. The scheme provides a competitive salary,
and additional up to £45,000 for research and travel, with no obligatory
teaching. The fellowship is a prestigious route to research independence,
with strong potential to lead to a permanent lectureship. Applicants can be
UK-based or international, and should normally be at most PhD + 5 years,
counted from the PhD award date to the proposed start date. The call is
open across research areas in participating departments.

I am particularly keen to encourage strong applications in theoretical
computer science, especially in complexity and algorithms. Applicants in
Theory of Computing will need a departmental sponsor at Imperial. If you
are considering applying for an IRF in this area and would like to discuss
possible sponsorship, please email me and we can discuss fit and timing.
Please note that each academic can sponsor only one applicant.

Please contact me (iddo.tzameret at gmail.com) by *1 June 2026 *to be
considered for sponsorship. Earlier is better.

Computing internal deadline to confirm a sponsor and submit an outline: 22
June 2026.
Imperial closing date: 23 July 2026.

Details: Imperial Research Fellowships (IRF):
https://www.imperial.ac.uk/research-and-innovation/research-office/funder-information/research-fellowships/irf/

Computing contacts page: Departments and key contacts:
https://www.imperial.ac.uk/research-and-innovation/support-for-staff/research-office/funder-information/research-fellowships/irf/information-for-applicants/departments-and-key-contacts/

Best regards,
Iddo Tzameret
--
Professor Iddo Tzameret
Chair in Computational Complexity
Department of Computing
Imperial College London
iddo.tzameret at gmail.com


More information about the Proof-Complexity mailing list