[Proof Complexity] PhD positions in theoretical computer science and/or combinatorial optimization at University of Copenhagen

Jakob Nordström jakob.nordstrom at cs.lth.se
Mon Dec 14 21:31:45 CET 2020

Dear colleagues,

I would be most grateful for any assistance in spreading the information below regarding PhD openings at the University of Copenhagen in TCS and combinatorial optimization.

Best regards
Jakob Nordstrom


The Department of Computer Science (DIKU) at the University of Copenhagen invites applications for PhD positions in theoretical computer science and/or combinatorial optimization.

The PhD students will be working in the Algorithms and Complexity Section at DIKU. This is one of the leading research groups in theoretical computer science in Europe, with a strong presence at top-tier conferences like STOC, FOCS, and SODA, and also with publications in premier AI conferences like AAAI, IJCAI, and NeurIPS. We are part of an exciting environment including the Basic Algorithms Research Copenhagen (BARC) centre (https://barc.ku.dk/), joint with the IT University of Copenhagen, and have extensive collaborations with the Technical University of Denmark (DTU) and Lund University on the Swedish side of the Oresund Bridge, as well as with our many visitors. 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, but we also have a track record of start-ups and surprising algorithmic discoveries leading to major industrial applications.

These PhD positions are full-time employed positions for a period of 3-5 years, depending on the education level of the candidate, and include an extended stay at some research institution abroad. The tentative starting date is September 2021, but this is negotiable.

The application deadline is January 24, 2021. See https://employment.ku.dk/phd/?show=153104 for the full announcement with more information and instructions for how to apply. Informal enquiries are welcome and may be sent to Jakob Nordström (jn at di.ku.dk), Rasmus Pagh (pagh at di.ku.dk), or Mikkel Thorup (mthorup at di.ku.dk).

Jakob Nordström, Professor
University of Copenhagen and Lund University
Phone: +46 70 742 21 98
http://www.csc.kth.se/~jakobn/ (webpages still in transit)

More information about the Proof-Complexity mailing list