| 2024 | ISIT | Bounding Weakly Correlated Products from Below: Supermodularity is All You Need. | Dimitris Achlioptas, Kostas Zampetakis |
| 2022 | ISIT | A Simpler Proof of the Four Functions Theorem and Some New Variants. | Dimitris Achlioptas, Kostas Zampetakis |
| 2021 | ICALP | Local Approximations of the Independent Set Polynomial. | Dimitris Achlioptas, Kostas Zampetakis |
| 2020 | SPAA | Simple Local Computation Algorithms for the General Lovsz Local Lemma. | Dimitris Achlioptas, Themis Gouleakis, Fotis Iliopoulos |
| 2019 | FOCS | Beyond the Lovsz Local Lemma: Point to Set Correlations and Their Algorithmic Applications. | Dimitris Achlioptas, Fotis Iliopoulos, Alistair Sinclair |
| 2018 | SAT | Fast Sampling of Perfectly Uniform Satisfying Assignments. | Dimitris Achlioptas, Zayd S. Hammoudeh, Panos Theodoropoulos |
| 2018 | SAT | Fast and Flexible Probabilistic Model Counting. | Dimitris Achlioptas, Zayd Hammoudeh, Panos Theodoropoulos |
| 2017 | ACL | Skip-Gram - Zipf + Uniform = Vector Additivity. | Alex Gittens, Dimitris Achlioptas, Michael W. Mahoney |
| 2017 | ICALP | Stochastic Control via Entropy Compression. | Dimitris Achlioptas, Fotis Iliopoulos, Nikos Vlassis |
| 2017 | ISIT | Time-invariant LDPC convolutional codes. | Dimitris Achlioptas, S. Hamed Hassani, Wei Liu, Rdiger L. Urbanke |
| 2017 | SAT | Probabilistic Model Counting with Short XORs. | Dimitris Achlioptas, Panos Theodoropoulos |
| 2016 | SODA | Bounds for Random Constraint Satisfaction Problems via Spatial Coupling. | Dimitris Achlioptas, Seyed Hamed Hassani, Nicolas Macris, Rdiger L. Urbanke |
| 2016 | SODA | Focused Stochastic Local Search and the Lovsz Local Lemma. | Dimitris Achlioptas, Fotis Iliopoulos |
| 2015 | ICALP | Symmetric Graph Properties Have Independent Edges. | Dimitris Achlioptas, Paris Siminelakis |
| 2015 | UAI | Stochastic Integration via Error-Correcting Codes. | Dimitris Achlioptas, Pei Jiang |
| 2015 | WAW | Navigability is a Robust Property. | Dimitris Achlioptas, Paris Siminelakis |
| 2014 | FOCS | Random Walks That Find Perfect Objects and the Lovasz Local Lemma. | Dimitris Achlioptas, Fotis Iliopoulos |
| 2014 | OSDI | Erasure Coding & Read/Write Separation in Flash Storage. | Dimitris Skourtis, Dimitris Achlioptas, Noah Watkins, Carlos Maltzahn, Scott A. Brandt |
| 2014 | USENIX | Flash on Rails: Consistent Flash Performance through Redundancy. | Dimitris Skourtis, Dimitris Achlioptas, Noah Watkins, Carlos Maltzahn, Scott A. Brandt |
| 2013 | SOSP | High performance & low latency in solid-state drives through redundancy. | Dimitris Skourtis, Dimitris Achlioptas, Carlos Maltzahn, Scott A. Brandt |
| 2012 | ICALP | Unsatisfiability Bounds for Random CSPs from an Energetic Interpolation Method. | Dimitris Achlioptas, Ricardo Menchaca-Mndez |
| 2012 | SAT | Exponential Lower Bounds for DPLL Algorithms on Satisfiable Random 3-CNF Formulas. | Dimitris Achlioptas, Ricardo Menchaca-Mndez |
| 2010 | WG | Algorithmic Barriers from Phase Transitions in Graphs. | Dimitris Achlioptas |
| 2008 | FOCS | Algorithmic Barriers from Phase Transitions. | Dimitris Achlioptas, Amin Coja-Oghlan |
| 2006 | STOC | On the solution-space geometry of random constraint satisfaction problems. | Dimitris Achlioptas, Federico Ricci-Tersenghi |
| 2005 | COLT | On Spectral Learning of Mixtures of Distributions. | Dimitris Achlioptas, Frank McSherry |
| 2005 | STOC | On the bias of traceroute sampling: or, power-law degree distributions in regular graphs. | Dimitris Achlioptas, Aaron Clauset, David Kempe, Cristopher Moore |
| 2004 | AAAI | Hiding Satisfying Assignments: Two Are Better than One. | Dimitris Achlioptas, Haixia Jia, Cristopher Moore |
| 2004 | LATIN | Sampling Grid Colorings with Fewer Colors. | Dimitris Achlioptas, Michael S. O. Molloy, Cristopher Moore, Frank Van Bussel |
| 2004 | SODA | Exponential bounds for DPLL below the satisfiability threshold. | Dimitris Achlioptas, Paul Beame, Michael Molloy |
| 2004 | STOC | The two possible values of the chromatic number of a random graph. | Dimitris Achlioptas, Assaf Naor |
| 2003 | FOCS | On the Maximum Satisfiability of Random Formulas. | Dimitris Achlioptas, Assaf Naor, Yuval Peres |
| 2003 | STOC | The threshold for random k-SAT is 2 | Dimitris Achlioptas, Yuval Peres |
| 2002 | FOCS | The Asymptotic Order of the Random k -SAT Threshold. | Dimitris Achlioptas, Cristopher Moore |
| 2002 | STOC | Almost all graphs with average degree 4 are 3-colorable. | Dimitris Achlioptas, Cristopher Moore |
| 2001 | FOCS | Web Search via Hub Synthesis. | Dimitris Achlioptas, Amos Fiat, Anna R. Karlin, Frank McSherry |
| 2001 | IJCAI | Balance and Filtering in Structured Satisfiable Problems. | Henry A. Kautz, Yongshao Ruan, Dimitris Achlioptas, Carla P. Gomes, Bart Selman, Mark E. Stickel |
| 2001 | PODS | Database-friendly random projections. | Dimitris Achlioptas |
| 2001 | SODA | The phase transition in 1-in-k SAT and NAE 3-SAT. | Dimitris Achlioptas, Arthur D. Chtcherba, Gabriel Istrate, Cristopher Moore |
| 2001 | STOC | A sharp threshold in proof complexity. | Dimitris Achlioptas, Paul Beame, Michael S. O. Molloy |
| 2001 | STOC | Fast computation of low rank matrix. | Dimitris Achlioptas, Frank McSherry |
| 2000 | AAAI | Generating Satisfiable Problem Instances. | Dimitris Achlioptas, Carla P. Gomes, Henry A. Kautz, Bart Selman |
| 2000 | FOCS | Optimal myopic algorithms for random 3-SAT. | Dimitris Achlioptas, Gregory B. Sorkin |
| 2000 | ICALP | Two-coloring Random Hypergraphs. | Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali |
| 2000 | STOC | Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract). | Dimitris Achlioptas |
| 1997 | CP | Random Constraint Satisfaction: A More Accurate Picture. | Dimitris Achlioptas, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Michael S. O. Molloy, Yannis C. Stamatiou |
| 1997 | FOCS | The Analysis of a List-Coloring Algorithm on a Random Graph. | Dimitris Achlioptas, Michael S. O. Molloy |
| 1996 | ESA | Competive Analysis of Randomized Paging Algorithms. | Dimitris Achlioptas, Marek Chrobak, John Noga |