Dimitris Achlioptas

Dimitris Achlioptas is a Professor at the Department of Informatics and Telecommunications, National and Kapodistrian University of Athens. His research focuses on theoretical computer science, algorithms, and probabilistic methods. He has contributed extensively to areas such as satisfiability problems, random constraint satisfaction, combinatorial optimization, and phase transitions in random structures. His work bridges algorithm design with probabilistic analysis, often leveraging tools from discrete mathematics and statistical physics.

Key research themes include the Lovász Local Lemma, random k-SAT, and the interplay between computational complexity and statistical properties of problems. Notable contributions address algorithmic barriers from phase transitions, solution space geometry of random CSPs, and efficient sampling techniques for combinatorial structures. His recent work explores applications of probabilistic methods in machine learning and optimization, including scalable algorithms for high-dimensional problems.