[Proof Complexity] Tenure-track assistant professorship in complexity theory in Copenhagen

thapen thapen at math.cas.cz
Wed Dec 15 08:17:02 CET 2021

(forwarded from Jakob Nordstrom - sorry if you get this twice - the 
mailing list is having some problems with spam filters)

-------- Original Message --------
Subject: [Proof Complexity] Tenure-track assistant professorship in 
complexity theory in Copenhagen
Date: 2021-12-15 00:35
 From: Jakob Nordström <jakob.nordstrom at cs.lth.se>
To: proof-complexity_math.cas.cz <proof-complexity at math.cas.cz>

Dear colleagues,

I would be most grateful for any assistance in spreading the information 
below regarding a tenure-track assistant professorship at the University 
of Copenhagen in complexity theory (very much including proof 

Best regards
Jakob Nordstrom


The Department of Computer Science (DIKU) at the University of 
Copenhagen invites applications for a tenure-track assistant 
professorship in computational complexity theory.

We are looking for an outstanding junior researcher with an innovative 
mind-set and intellectual curiosity to strengthen and complement the 
research profile of the Algorithms and Complexity Section at DIKU. This 
is a world-leading research environment (currently ranked 6th worldwide 
in algorithms and complexity by CSrankings.org), with a strong presence 
at top-tier conferences like STOC, FOCS, CCC, and SODA, and also with 
publications in premier AI conferences like AAAI, IJCAI, and NeurIPS. We 
are home to the Basic Algorithms Research Copenhagen (BARC) centre, 
joint with the IT University of Copenhagen, and have extensive 
collaborations with the Technical University of Denmark (DTU) and with 
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. While the focus in on 
foundational research, we do have a track record of 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 ranked 2nd in the European Union 
(post-Brexit) by ShanghaiRanking.

The application deadline is January 30, 2022. See 
http://www.jakobnordstrom.se/openings/AsstProf-UCPH-220130.html for more 
information and instructions for how to apply. Informal enquiries are 
welcome and may be sent to jn at di.ku.dk.

Jakob Nordström, Professor
University of Copenhagen and Lund University
Phone: +46 70 742 21 98

Proof-Complexity mailing list
Proof-Complexity at math.cas.cz

More information about the Proof-Complexity mailing list