World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
52
Citations
12444
World Ranking
5034
National Ranking
25

Research.com Recognitions

  • 2007 - Fellow of Alfred P. Sloan Foundation

Overview

Dimitris Achlioptas is affiliated with the National and Kapodistrian University of Athens in Greece. Their research spans the fields of Computer Science and Mathematics, with particular focus on subfields such as Artificial Intelligence, Computational Theory and Mathematics, Statistics and Probability, Computer Networks and Communications, and Mathematical Physics.

Their main topics of research include Markov Chains and Monte Carlo Methods, Constraint Satisfaction and Optimization, Complexity and Algorithms in Graphs, Bayesian Modeling and Causal Inference, Theoretical and Computational Physics, Data Management and Algorithms, and Logic, Reasoning, and Knowledge.

Recent publications by Dimitris Achlioptas cover a range of topics in theoretical computer science and related areas. Notable papers include:

  • The number of satisfying assignments of random 2-SAT formulas, 2021, Random Structures and Algorithms
  • The random 2-SAT partition function, 2020, arXiv (Cornell University)
  • Local Approximations of the Independent Set Polynomial, 2021, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • A Simpler Proof of the Four Functions Theorem and Some New Variants, 2022, 2022 IEEE International Symposium on Information Theory (ISIT)
  • Special Section on the Fiftieth Annual ACM Symposium on Theory of Computing (STOC 2018), 2020, SIAM Journal on Computing

Dimitris Achlioptas has collaborated frequently with a group of coauthors. These include Kostas Zampetakis, Amin Coja-Oghlan, Max Hahn-Klimroth, Joon Lee, and Noëla Müller, with multiple joint publications.

The scientist's work is commonly published in venues such as arXiv (Cornell University), Random Structures and Algorithms, Leibniz-Zentrum für Informatik (Schloss Dagstuhl), the IEEE International Symposium on Information Theory (ISIT), and the SIAM Journal on Computing.

In recognition of their contributions, Dimitris Achlioptas was named a Fellow of the Alfred P. Sloan Foundation in 2007.

Best Publications

  • Database-friendly random projections: Johnson-Lindenstrauss with binary coins

    Dimitris Achlioptas

  • Database-friendly random projections

    Dimitris Achlioptas

  • Fast computation of low-rank matrix approximations

    Dimitris Achlioptas;Frank Mcsherry

  • Explosive Percolation in Random Networks

    Dimitris Achlioptas;Raissa M. D'Souza;Raissa M. D'Souza;Joel Spencer

  • System and method for employing social networks for information discovery

    Dimitris Achlioptas

  • The two possible values of the chromatic number of a random graph

    Dimitris Achlioptas;Assaf Naor

  • Algorithmic Barriers from Phase Transitions

    D. Achlioptas;A. Coja-Oghlan

  • The threshold for random k-SAT is 2k (ln 2 - O(k))

    Dimitris Achlioptas;Yuval Peres

  • On spectral learning of mixtures of distributions

    Dimitris Achlioptas;Frank McSherry

  • On the bias of traceroute sampling: Or, power-law degree distributions in regular graphs

    Dimitris Achlioptas;Aaron Clauset;David Kempe;Cristopher Moore

  • Rigorous location of phase transitions in hard optimization problems

    Dimitris Achlioptas;Assaf Naor;Yuval Peres

  • The threshold for random k-SAT is 2^k log 2 - O(k)

    Unknown

  • Generating Satisfiable Problem Instances

    Dimitris Achlioptas;Carla P. Gomes;Henry A. Kautz;Bart Selman

  • Sampling Techniques for Kernel Methods

    Dimitris Achlioptas;Frank Mcsherry;Bernhard Schölkopf

  • Random $k$-SAT: Two Moments Suffice to Cross a Sharp Threshold

    Dimitris Achlioptas;Cristopher Moore

  • Lower bounds for random 3-SAT via differential equations

    Dimitris Achlioptas

  • Methods and systems for computing singular value decompositions of matrices and low rank approximations of matrices

    Dimitris Achlioptas;Frank D. McSherry

  • Stateless, affinity-preserving load balancing

    Dimitris Achlioptas;Sean B. House

  • On the solution-space geometry of random constraint satisfaction problems

    Dimitris Achlioptas;Federico Ricci-Tersenghi

  • Random constraint satisfaction: a more accurate picture

    Dimitris Achlioptas;Lefteris M. Kirousis;Evangelos Kranakis;Danny Krizanc

  • Two-coloring random hypergraphs

    Dimitris Achlioptas;Jeong Han Kim;Michael Krivelevich;Prasad Tetali

Frequent Co-Authors

Cristopher Moore
Cristopher Moore Santa Fe Institute
Michael Molloy
Michael Molloy University of Toronto
Frank McSherry
Frank McSherry Materialize, Inc.
Assaf Naor
Assaf Naor Princeton University
Eric Horvitz
Eric Horvitz Microsoft (United States)
David Kempe
David Kempe University of Southern California
Evangelos Kranakis
Evangelos Kranakis Carleton University
Aaron Clauset
Aaron Clauset University of Colorado Boulder
Henry Kautz
Henry Kautz University of Virginia
Paul Beame
Paul Beame University of Washington

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring a career in Computer Science opens doors to a wide range of academic and professional opportunities in the USA. Many students today are looking for flexible and affordable options to earn their credentials online. Whether you are starting your journey or seeking to advance in the field, there are several pathways to consider.

For those interested in advanced research or academic careers, pursuing one of the cheapest phd programs online can provide both cost savings and flexibility. Alternatively, educators looking to move up quickly might benefit from exploring the shortest online edd programs to earn leadership roles in education.

If you’re looking to enter the workforce quickly, consider completing a 6 month degree course to gain essential skills in a short time frame. For those interested in combining technical knowledge with business acumen, the best online business management degree programs can offer a strong foundation in management alongside technical expertise.

These diverse online programs help students balance career goals with personal and financial constraints, making quality education accessible to more learners.

Best Scientists Citing Dimitris Achlioptas

Trending Scientists