[Proof Complexity] Tenure-track assistant professorship in algorithms and complexity theory in Lund

Jakob Nordström jakob.nordstrom at cs.lth.se
Thu May 20 00:19:24 CEST 2021

Dear colleagues,

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

Best regards
Jakob Nordstrom


The CS department at Lund University invites applications for a tenure-track assistant professorship in algorithms and complexity theory.

Lund University was founded in 1666 and is repeatedly ranked among the top 100 universities in the world. Lund Technical College (LTH) forms the Faculty of Engineering at Lund University, where research of the highest international standard is conducted. The Department of Computer Science at LTH is a partner in the Wallenberg AI, Autonomous Systems and Software Program (WASP), the largest individual research program in Swedish history, and also in the ELLIIT Excellence Centre focused on basic and applied research in information technologies broadly construed. Furthermore, there are extensive collaborations with the University of Copenhagen, the IT University of Copenhagen (ITU), and the Technical University of Denmark (DTU) on the other side of the Oresund bridge.

The application deadline is June 8, 2021. See https://lu.varbi.com/en/what:job/jobID:388991/ for the full announcement with more information and instructions for how to apply. Informal enquiries are welcome and may be sent to jakob.nordstrom at cs.lth.se.

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

More information about the Proof-Complexity mailing list