[Proof Complexity] Postdoctoral position in combinatorial optimization (including SAT solving) at University of Copenhagen

Jakob Nordström jakob.nordstrom at cs.lth.se
Fri Dec 11 11:27:21 CET 2020

Dear colleagues,

I would be most grateful for any assistance in spreading the information below regarding a postdoc opening at the University of Copenhagen in combinatorial optimization (including using proof complexity to construct more efficient algorithms and/or to achieve verifiably correct results).

Best regards
Jakob Nordstrom


The Department of Computer Science (DIKU) at the University of Copenhagen invites applications for postdoctoral positions in combinatorial optimization.

The postdoc will be working in the Mathematical Insights into Algorithms for Optimization (MIAO) group headed by Jakob Nordstrom, which is doing research on theoretical analysis of and applied algorithm development for combinatorial optimization paradigms such as SAT solving, pseudo-Boolean optimization, constraint programming, and integer linear programming. MIAO belongs to the Algorithms and Complexity Section at DIKU, one of the leading groups in theoretical computer science in Europe, which is 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 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.

The University of Copenhagen was founded in 1479 and is the oldest and largest university in Denmark. It is often ranked as the best university in Scandinavia and consistently as one of the top places in Europe. Within computer science, it is currently number 1 in the European Union (post-Brexit) according to the Shanghai Ranking.

This is a full-time employed position. The intended starting date is September 2021 but is negotiable, and the intended duration is 2 years. The University of Copenhagen is currently expanding strongly in computer science. We expect to keep having tenure-track openings in computer science in the coming years, and welcome postdoctoral researchers interested in exploring such opportunities.

The application deadline is January 24, 2021. See https://employment.ku.dk/faculty/?show=153126 for the full announcement with more information and instructions for how to apply. Informal enquiries are welcome and may be sent to Jakob Nordstrom (jn 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