[DMANET] Two PhD positions in theoretical computer science at LTH Lund University

The Department of Computer Science at LTH Lund University invites applications for two PhD positions in theoretical computer science with focus on computational complexity and algorithms. The study of the potential and limits of efficient computation is about foundational, mathematical, research, but research results in computational complexity theory have had major impact in other areas of computer science and other scientific disciplines, and have given rise to some of the most important open problems in modern mathematics. A potential research project is to explore connections between proof complexity and circuit complexity.

The PhD students will be working in the research group of Susanna de Rezende. These are four-year full-time employed positions, but PhD positions usually (though not necessarily) include 20% teaching, in which case they are prolonged for one more year. The starting date is negotiable but should ideally during the autumn of 2022. The positions are fully funded, employed positions (including travel money) that come with an internationally very competitive salary.

There is a growing research group in algorithms and complexity theory at Lund University. We expect to have six PhD students by the autumn, in addition to two faculty and some MSc students working in computational complexity. Lund University was founded in 1666 and is repeatedly ranked among the top 100 universities in the world.

Lund University is located in the Öresund area, which is offering one of the strongest and most exciting environments in computational complexity research in Europe. There is extensive collaboration with the University of Copenhagen (UCPH), the IT University of Copenhagen (ITU), and the Technical University of Denmark (DTU) on the other side of the Öresund Bridge. In particular, we will be collaborating with the MIAO research group, which is active at both Lund University and the University of Copenhagen. The PhD students can also look forward to interacting with the five additional faculty in complexity theory in Copenhagen, together with their students and postdocs, as well as with the algorithms group at the Basic Algorithms Research Copenhagen (BARC) centre.

The application deadline is June 30, 2022 at midnight local time. See https://derezende.github.io/openpositions/PhD.html for more information and instructions on how to apply. Informal enquiries are welcome and can be sent to susanna.rezende@cs.lth.se<mailto:susanna.rezende@cs.lth.se>.

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************