PhD Positions in Theoretical Computer Science
The Department of Computer Science (DIKU) at the University of Copenhagen invites applications for PhD positions in theoretical computer science.
The PhD students 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 so the project may also involve research in these areas.
These PhD positions are full-time employed positions for a period of 3 years, including an extended stay at some research institution abroad. The expected starting date is September 2020, although this is to some extent negotiable.
To be eligible to apply for these positions, applicants need to have or be close to obtaining a MSc degree in computer science, mathematics, or a related field.
The successful candidates are expected to have a strong background and passionate interest in mathematics and theoretical computer science. Problem solving skills and creativity are a must. Applicants need to be strongly motivated for doctoral studies; should possess the ability to work independently and perform critical analysis, and also have good levels of cooperative and communicative abilities and good English language skills.
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.
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.
General information about PhD studies at the Faculty of Science is available at www.science.ku.dk/phd.