RESEARCH FIELDComputer science
RESEARCHER PROFILEFirst Stage Researcher (R1)
APPLICATION DEADLINE05/07/2021 23:59 - Europe/Brussels
LOCATIONSweden › Lund
TYPE OF CONTRACTTemporary
The PhD student 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 fairly unusual profile in that we are on the one hand conducting deeply theoretical, mathematical research on the foundations of efficient computation, and on the other hand working on the design of state-of-the-art applied algorithms that are meant to run blisteringly fast in practice. 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, constraint programming, and semidefinite programming. This leads to classic questions in computational complexity theory—though often with new, interesting twists—but also involves work on devising new algorithmic approaches that can exploit the power of such paradigms in practice.
On the theory side, most of our work is in proof complexity. Proof complexity has connections to foundational questions in computational complexity theory, but another important motivation is algorithm analysis. All algorithms use some kind of method of reasoning to compute solutions to problems, and proof complexity can be used to analyse the potential and limitations of such methods (and thereby of the algorithms using them).
On the practical side, one problem of interest is to gain a better understanding of, and improve, the performance of current state-of-the-art SAT solvers based on conflict-driven clause learning (CDCL). We are even more interested in exploring new algebraic or geometric techniques, such as Gröbner bases or 0-1 integer linear programming (also known as pseudo-Boolean solving), that can sometimes be exponentially more powerful than CDCL, and that can also be used to solve optimization problems.
Another research area of interest is 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. We want to redesign state-of-the-art combinatorial solvers to make them certifying, i.e., so that they output not only a solution but also a simple, machine-verifiable proof that the claimed solution is correct and complete.
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%), in which case the position is prolonged accordingly.
A person meets the general admission requirements for third-cycle courses and study programmes if the applicant:
- has been awarded a second-cycle qualification, or
- has satisfied the requirements for courses comprising at least 240 credits of which at least 60 credits were awarded in the second cycle, or
- has acquired substantially equivalent knowledge in some other way in Sweden or abroad.
A person meets the specific admission requirements for third cycle studies in computer science if the applicant has:
- at least 60 second-cycle credits at an advanced level with relevance for the research topic, or
- an MSc in Engineering in Computer Science and Engineering, Electrical Engineering, Information and Communication Technology, Engineering Physics or Engineering Mathematics.
- Very good oral and written proficiency in English.
- Strong background and passionate interest in computer science and mathematics.
- Problem solving skills and creativity.
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:
- Knowledge and skills relevant to the thesis project and the subject of study.
- An assessment of ability to work independently and to formulate and tackle research problems.
- Written and oral communication skills.
- Other experience relevant to the third-cycle studies, e.g. professional experience.
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 §§.
Instructions on how to apply
Applications shall be written in English and shall include the following documents:
- Curriculum vitae.
- Brief statement as to why the applicant wishes to conduct doctoral studies, including a description of the applicant's qualifications and interests.
- Diploma and transcripts of records (BSc and MSc).
- If applicable, copies of the applicant's MSc thesis (or possibly BSc thesis) and any research publications.
- Names and addresses for three references who might be contacted for reference letters later in the recruitment process.
Please observe that all the documents above should be in English (or for official documents possibly in Swedish).
REQUIRED EDUCATION LEVELComputer science: Master Degree or equivalent
EURAXESS offer ID: 622626
Posting organisation offer ID: 392181
The responsibility for the jobs published on this website, including the job description, lies entirely with the publishing institutions. The application is handled uniquely by the employer, who is also fully responsible for the recruitment and selection processes.
Please contact firstname.lastname@example.org if you wish to download all jobs in XML.