PRR Project

Summary

This position targets one Early Career Researcher (ECR) in Theory of Computing. Preference is given to researchers in Computational Complexity, but applicants in related areas will also be considered, such as: Approximation Algorithms, Theory of Convex Optimization, Theory of Combinatorial Optimization, Combinatorics in Computer Science, Theoretical Cryptography, Data Structures, Design and Analysis of Algorithms, Distributed and Parallel Algorithms, Foundations of Machine Learning, Parameterized Complexity, Quantum Computing, Randomness in Computation, etc.Candidates should have a strong publication record in top-tier journals and conferences. Experience in writing grant proposals to secure funding for future research initiatives will be much valued. They should be able to present research findings effectively in oral and written form and actively participate in international fora in the field, such as renowned conferences, high-tier workshops or thematic schools.The successful candidate will be expected to mentor and supervise MSc and PhD students, and they will be responsible for teaching advanced courses in Algorithms, Theory of Computing, Computational Complexity, etc. Previous teaching experience at the university level will be valued.Hiring in this area will strengthen LASIGE and the Department of Informatics offer in the Theory of Computing. The rationale behind such a hiring is two-fold. Firstly, it is an area of fundamental research: one could say that Theory of Computing is to Computer Science as nuclear physics is to nuclear power and magnetic resonance imaging, or biochemistry is to pharmacy, and thus it is important for informatics departments to invest in it. And second: training in Theory of Computing strengthens the quality of the Informatics curriculum, by teaching students how to think rigorously about computers and software.