Go to content

Jobs in Algorithms & Complexity at University of Regensburg

With over 20,000 students, the University of Regensburg is an innovative and interdisciplinary campus university with diverse and highly renowned research activities and attractive study programs for young people from Germany and abroad.Logo des European Research Councils

The Chair for Algorithms and Complexity Theory investigates the complexity of fundamental computational problems, with a focus on combinatorial counting problems and related questions in algebraic complexity theory, also using methods of parameterized complexity theory. Our research is supported by the ERC Starting Grant COUNTHOM.

We are looking for PhD students and post-docs for a full-time employment (40.1 hours per week). The initial contract term is one year, with the possibility for extension. The temporary employment, in accordance with §2 WissZeitVG, is to further your scientific qualifications, i.e., for research within the ERC project COUNTHOM. The remuneration is by TV-L EG 13. A part-time employment is also possible.

Your tasks:

  • Independent research on combinatorial counting problems, algebraic complexity theory, and parameterized aspects thereof
  • Writing publications in international conferences and journals
  • If desired, participation in teaching is also possible.

Our requirements:

  • Strong scientific curiosity
  • Excellent knowledge of discrete mathematics, algorithms and complexity theory
  • Scientific independence and relevant publications
  • Completed higher education (master, diploma or equivalent degree) in computer science or mathematics. For post-docs also a doctorate in the relevant subject.

We offer you:

  • Research projects at STOC/FOCS/SODA level within the ERC project COUNTHOM
  • A collaborative research environment in a newly founded group
  • Generous budget for travel to conferences, workshops and international cooperation partners (e.g., in Copenhagen)
  • Flexible working hours

The University of Regensburg aims to increase the proportion of women. Therefore, qualified women are strongly encouraged to apply. The University of Regensburg is particularly committed to the compatibility of family and work (for more information see here). Given equivalent qualifications, disabled applicants will be preferred. Please indicate in the application whether you have a severe disability. An overview over the data protection measures implemented at the University of Regensburg can be found here.

To apply, please submit a CV, a link to your publication list (DBLP or Google Scholar + list of unpublished papers) and a short description of your two most important publications, outlining your specific contributions in case of multi-author works. If not evident from your publications, please briefly explain your connection to counting complexity and algebraic complexity.

Please contact Radu Curticapean in case of questions. We are looking forward to receiving your application as a PDF file to sekretariat.curticapean@uni-regensburg.de by December 12, 2024.



  1. Faculty of Informatics and Data Science

Chair of Algorithms and Complexity Theory


Secretary

+49 941 943-68525

sekretariat.curticapean@ur.de

Mo-Fr: 8.30-12.30 Uhr