Reference : UMR8243-MAXLES-004
Workplace : PARIS 13
Date of publication : Monday, August 1, 2022
Scientific Responsible name : Adrian Vladu
Type of Contract : PhD Student contract / Thesis offer
Contract Period : 36 months
Start date of the thesis : 1 October 2022
Proportion of work : Full time
Remuneration : 2 135,00 € gross monthly
Description of the thesis topic
One PhD position is available under the supervision of Adrian Vladu, in the Algorithms & Complexity group of IRIF (https://www.irif.fr/en/equipes/algocomp/index) at Université Paris Cité in Paris.
The goal is to develop fast and practical solutions for fundamental algorithmic problems. This involves designing faster algorithms for classical problems in combinatorial optimization (involving graphs, matchings, submodular functions, matroids, etc), and developing new theory relevant to modern machine learning. The mathematical toolkit is based on modern techniques from continuous optimization, and interferes with other interesting theory from convex geometry, probability and numerical linear algebra. See here for a list of related topics: https://www.irif.fr/users/vladu/projects
This position is fully funded by ANR Comcopt and will take place at IRIF in the algorithms and complexity team. We provide great working conditions and generous travel support.
We talk about it on Twitter!