Copyright © 2016-2021 | Designed by I. Tzameret (based on Chocotemplates.com)
Imperial College London, Department of Computing
South Kensington Campus
Duration: one year, with a possibility for up to one-year extension
Start date: (flexible)
The post of Research Associate (postdoc) is to conduct leading basic research in computational complexity theory with an emphasis on fundamental lower bound questions in complexity. The successful candidate will join the complexity group at Imperial College led by Professor Iddo Tzameret in the context of the ERC (European Research Commission) EPRICOT project.
The post is based in the Department of Computing at Imperial College London at the South Kensington Campus. Imperial College London, Department of Computing is a world-leading department of computer science, one of the largest in the UK, and is consistently ranked among the best computer science departments in international league tables.
Apart from generous funding for equipment and travel covered by the flagship ERC grant scheme, the position offers an exciting opportunity to conduct internationally leading and impactful basic research in a major computer science department at the heart of London, with many leading research groups and other institutions nearby. We have specific close ties, including joint seminars, etc. with the complexity groups at Oxford and Warwick universities as part of the Complexity Network. The postdoc will carry out a research programme in the area of computational complexity and the theory of computing, and may help supervise or collaborate with other group members and students (there are no teaching duties).
To apply for this position, you should have a proven strong publication track-record in computational complexity. For instance, this may be manifested by publications in leading theoretical computer science conferences such as STOC, FOCS, CCC, ICALP, ITCS, LICS or in appropriate leading journals.
For further information on the project, see my homepage for my research interests and papers: www.doc.ic.ac.uk/~itzamere, or email: iddo.tzameret@gmail.com (candidates will have freedom to pursue their own research agenda assuming it aligns with that of the group).
Imperial's Computing is seeking mathematical oriented and motivated PhD students with a background in Theoretical Computer Science or Mathematics, interested in computational complexity. The positions are based at the South Kensington campus at the heart of London, and include a generous stipend, as well as funding for equipment and travel. The topic revolves around fundamental lower bound questions in computational complexity. The successful candidate will join the complexity group at Imperial College led by Professor Iddo Tzameret.
Imperial College London Department of Computing is a world-leading department of computer science which is consistently ranked among the best computer science departments in major international league tables.
The PhD will be carried out in the context of a flagship ERC (European Research Council) funded project EPRICOT (Efficient Proofs and Computation) which has the goal to push forward the frontiers of the fundamental questions in computational complexity theory, such as new lower bounds on concrete computational models, structure (reductions between different computational problems) and meta-mathematics of complexity. However, students will have the freedom to pursue their own ideas within complexity if they choose so. Apart from generous funding for equipment and travel covered, the position offers an exciting opportunity to conduct internationally leading and impactful basic research in a major computer science department at the heart of London, with many leading research groups and other institutions nearby. We have specific close ties, including joint seminars, etc. with the complexity groups at Oxford and Warwick universities.
Candidates with a firm (undergraduate) background in the following areas are good fit:
- The theory of computing and computational complexity;
- Knowledge of basic algebra, combinatorics, and possibly logic; with more advanced experience or knowledge in these areas being an advantage.
The successful applicant will normally have an MSc (or equivalent) in an area pertinent to the subject area, ideally computer science or mathematics (with some background in the theory of computing). Imperial requires distinction in bachelor's degree or master's degree (scaled to the academic system at hand; this is a formal requirement that can only be waived in special cases such as prior publication record in the relevant area).
For further information on the project, see my homepage for my research interests and papers: www.doc.ic.ac.uk/~itzamere, and https://www.doc.ic.ac.uk/~itzamere/siglog.pdf for a survey that exemplifies some problems I am interested in, the group website here: complexity group, or email: iddo.tzameret@gmail.com (though candidates will have freedom to pursue their own research agenda assuming it aligns with that of the group).
To be considered, candidates should send their full CV to iddo.tzameret@gmail.com
You may also want to apply online on Imperial's portal:
https://www.imperial.ac.uk/computing/prospective-students/courses/phd/phd-application-guidelines/
but please make sure to write in the application form, "computational complexity" in "Proposed Research Topic" field, and Prof Iddo Tzameret in the "Proposed Research Supervisor" field.
Informal enquiries related to the position are strongly encouraged and should be directed to Iddo Tzameret at the above email.
For any inquiries please contact Iddo Tzameret at Iddo.Tzameret@gmail.com