Postdoc Positions in Theoretical Computer Science
The Department of Computer Science (DIKU) at the University of Copenhagen invites applications for postdoc positions in theoretical computer science.
The postdoctoral researchers will be working in the research group of Jakob Nordström, which is currently in transition from KTH to a combined location at the University of Copenhagen and Lund University on either side of the Oresund bridge.
Much of the research in the group revolves about gaining a better theoretical understanding of powerful algorithmic paradigms such as, e.g., SAT solving, Gröbner basis computations, integer linear programming, and/or semidefinite programming. This leads to classic questions in computational complexity theory — though often with new, interesting twists — but can also involve work on designing new algorithms that can exploit the power of such paradigms in practice. Our research has revealed deep, and sometimes surprising, connections to other topics such as, e.g., circuit complexity, communication complexity, and hardness of approximation, and therefore researchers in these or other related areas are more than welcome to apply.
Within the overall framework sketched above, the postdocs will be expected and encouraged to contribute to and influence the research agenda. Taking part in teaching graduate seminar courses is encouraged but not required. Travel funding is included, and the group also receives visitors on a regular basis.
These postdoc positions are full-time employed positions for one year with a possible (and expected) one-year extension. The expected starting date is September 2020, although this is to some extent negotiable.
Applicants should have or be about to receive a PhD degree in a subject relevant for the research area, and should have a passionate interest in research. The successful candidate is expected to have a solid background in theoretical computer science and mathematics, and should have a strong research record as witnessed by publications in conferences such as STOC, FOCS, SODA, CCC, or similar, or in journals of a comparable quality.
The working language of the group is English, and knowledge of English is also fully sufficient to navigate life in Denmark and Sweden in general. It might also be worth mentioning that Scandinavian countries routinely score at the absolute top in rankings of quality of life such as, e.g., the OECD Better Life Index.
The University of Copenhagen is the oldest and largest university in Denmark, and is often ranked as the best university in Scandinavia (and consistently as one of the top places in Europe).
The Algorithms and Complexity Section at the Department of Computer Science (DIKU) is part of an exciting environment including the Basic Algorithms Research Copenhagen (BARC) centre, joint with the IT University of Copenhagen, and extensive collaborations with the Technical University of Denmark (DTU) and Lund University on the Swedish side of the Oresund bridge. We aim to attract top talent from around the world to an ambitious, creative, collaborative, and fun environment. Using the power of mathematics, we strive to create fundamental breakthroughs in algorithms and complexity theory.
The application deadline is February 10, 2020 at midnight local time. Early applications are welcome, since this will help speed up the recruitment procedure, but all applications submitted before the deadline will be considered.
Applications must be submitted via the UCPH recruitment system. Please see the official advertisement at employment.ku.dk/faculty/?show=150961 for more details including a link to the application form.
The application should include the following documents:
The university wishes for our staff to reflect the diversity of society and thus welcomes applications from all qualified candidates regardless of personal background.
Further Information and Contact Details
Further information about the Department of Computer Science (DIKU) can be found at di.ku.dk.
Inquiries about the position can be made to Jakob Nordström at firstname.lastname@example.org or email@example.com.