This advert is not available!
Lund University was founded in 1666 and is repeatedly ranked among the world’s top universities. The University has around 47 000 students and more than 8 800 staff based in Lund, Helsingborg and Malmö. We are united in our efforts to understand, explain and improve our world and the human condition.
Lund University welcomes applicants with diverse backgrounds and experiences. We regard gender equality and diversity as a strength and an asset.
Subject description
The PhD students will be working in the Mathematical Insights into Algorithms for Optimization (MIAO) group headed by Jakob Nordström, which is active at both Lund University and the University of Copenhagen.
The MIAO research group has a unique profile in that we are doing cutting-edge research both on the mathematical foundations of efficient computation and on state-of-the-art practical algorithms for real-world problems. This creates a very special environment, where we do not only conduct in-depth research on different theoretical and applied topics, but where different lines of research cross-fertilise each other and unexpected and exciting synergies often arise. Much of the activities of the group revolve around powerful algorithmic paradigms such as, e.g., Boolean satisfiability (SAT) solving, Gröbner basis computations, integer linear programming, and constraint programming. This leads to classical questions in computational complexity theory—though often with new, fascinating twists—but also involves work on devising clever algorithms that can exploit the power of such paradigms in practice.
We currently have one openng for a theoretically oriented PhD student, funded by a Consolidator Grant from the Swedish Research Council, and one more applied opening financed by the Wallenberg AI, Autonomous Systems and Software Program (WASP). There is a lot of flexibility as to what kind of research the PhD students will pursue, though, and all candidates are welcome, both those who want to go deep into either theory or practice and those who are inspired by the challenge of bridging the gap between the two.
On the theory side, most of our work is in proof complexity, which studies formal systems for reasoning about logic formulas and other types of problems. Proof complexity has connections to foundational questions in computational complexity theory, but also plays an important role in algorithm analysis by providing a rigorous understanding of the power and limitations of different algorithmic approaches.
On the practical side, we want to gain a more rigorous scientific understanding, and improve the performance, of modern algorithms for automated reasoning and combinatorial optimization. We are particularly interested in designing algorithms that can exploit sophisticated mathematical techniques to achieve exponential improvements in performance compared to the current state of the art—something that theoretical research suggests should be possible, but that has so far been hard to achieve in practice.
Quite recently, we have also made some breakthrough research on how to verify the correctness of state-of-the-art algorithms for combinatorial optimization. Such algorithms are often highly complex, and even mature commercial solvers are known to sometimes produce wrong results. Our goal is to design a new generation of certifying combinatorial solvers with so-called proof logging, meaning that the solvers output not only a solution but also a machine-verifiable proof that is easy to check and provides 100% formal guarantees that the claimed solution is correct and complete.
Work duties
The main duties of doctoral students are to devote themselves to their research studies which includes participating in research projects and third cycle courses. The work duties can also include teaching and other departmental duties (no more than 20%),.
Admission requirements
A person meets the general admission requirements for third-cycle courses and study programmes if the applicant:
A person meets the specific admission requirements for third cycle studies in computer science if the applicant has:
Additional requirements:
Assessment criteria
Selection for third-cycle studies is based on the student’s potential to profit from such studies. The assessment of potential is made primarily on the basis of academic results from the first and second cycle. Special attention is paid to the following:
Consideration will also be given to good collaborative skills, drive and independence, and how the applicant, through his or her experience and skills, is deemed to have the abilities necessary for successfully completing the third cycle programme.
Terms of employment
Only those admitted to third cycle studies may be appointed to a doctoral studentship. Third cycle studies at LTH consist of full-time studies for 4 years. A doctoral studentship is a fixed-term employment of a maximum of 5 years (including 20% departmental duties). Doctoral studentships are regulated in the Higher Education Ordinance (1993:100), chapter 5, 1-7 §§.
We intend to employ 1-2 doctoral students.
Instructions on how to apply
Applications shall be written in English and shall include the following documents:
Please observe that all the documents above should be in English (or for official documents possibly in Swedish).
Type of employment | Temporary position |
---|---|
First day of employment | As soon as possible |
Salary | Monthly salary |
Number of positions | 1 |
Full-time equivalent | 100% |
City | Lund |
County | Skåne län |
Country | Sweden |
Reference number | PA2021/2526 |
Contact |
|
Published | 27.Jul.2021 |
Last application date | 13.Sep.2021 11:59 PM CEST |