Competive Analysis of Randomized Paging Algorithms. - Dimitris Achlioptas; Marek Chrobak; John Noga (ESA, 1996)

The Analysis of a List-Coloring Algorithm on a Random Graph. - Dimitris Achlioptas; Michael S. O. Molloy (FOCS, 1997)

The complexity of G-free colourability. - Demetrios Achlioptas (Discret. Math., 1997)

The existence of uniquely -G colourable graphs. - Dimitris Achlioptas; Jason I. Brown; Derek G. Corneil; Michael Molloy 001 (Discret. Math., 1998)

Almost all graphs with 2.522 n edges are not 3-colorable. - Dimitris Achlioptas; Michael Molloy 001 (Electron. J. Comb., 1999)

A Sharp Threshold for k-Colorability. - Dimitris Achlioptas; Ehud Friedgut (Random Struct. Algorithms, 1999)

Tight Lower Bounds for st-Connectivity on the NNJAG Model. - Jeff Edmonds; Chung Keung Poon; Dimitris Achlioptas (SIAM J. Comput., 1999)

Threshold phenomena in random graph colouring and satisfiability. - Dimitris Achlioptas (1999)

Generating Satisfiable Problem Instances. - Dimitris Achlioptas; Carla P. Gomes; Henry A. Kautz; Bart Selman (AAAI/IAAI, 2000)

Optimal myopic algorithms for random 3-SAT. - Dimitris Achlioptas; Gregory B. Sorkin (FOCS, 2000)

Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract). - Dimitris Achlioptas (STOC, 2000)

Competitive analysis of randomized paging algorithms. - Dimitris Achlioptas; Marek Chrobak; John Noga (Theor. Comput. Sci., 2000)

Web Search via Hub Synthesis. - Dimitris Achlioptas; Amos Fiat; Anna R. Karlin; Frank McSherry (FOCS, 2001)

Balance and Filtering in Structured Satisfiable Problems. - Henry A. Kautz; Yongshao Ruan; Dimitris Achlioptas; Carla P. Gomes; Bart Selman; Mark E. Stickel (IJCAI, 2001)

Sampling Techniques for Kernel Methods. - Dimitris Achlioptas; Frank McSherry; Bernhard Schölkopf (NIPS, 2001)

Database-friendly random projections. - Dimitris Achlioptas (PODS, 2001)

The phase transition in 1-in-k SAT and NAE 3-SAT. - Dimitris Achlioptas; Arthur D. Chtcherba; Gabriel Istrate; Cristopher Moore (SODA, 2001)

A sharp threshold in proof complexity. - Dimitris Achlioptas; Paul Beame; Michael S. O. Molloy (STOC, 2001)

Fast computation of low rank matrix. - Dimitris Achlioptas; Frank McSherry (STOC, 2001)

Random Constraint Satisfaction: A More Accurate Picture. - Dimitris Achlioptas; Michael S. O. Molloy; Lefteris M. Kirousis; Yannis C. Stamatiou; Evangelos Kranakis; Danny Krizanc (Constraints An Int. J., 2001)

Balance and Filtering in Structured Satisfiable Problems (Preliminary Report). - Henry A. Kautz; Yongshao Ruan; Dimitris Achlioptas; Carla P. Gomes; Bart Selman; Mark E. Stickel (Electron. Notes Discret. Math., 2001)

Lower bounds for random 3-SAT via differential equations. - Dimitris Achlioptas (Theor. Comput. Sci., 2001)

Rigorous results for random (2+p)-SAT. - Dimitris Achlioptas; Lefteris M. Kirousis; Evangelos Kranakis; Danny Krizanc (Theor. Comput. Sci., 2001)

The Asymptotic Order of the Random k -SAT Threshold. - Dimitris Achlioptas; Cristopher Moore (FOCS, 2002)

On the 2-Colorability of Random Hypergraphs. - Dimitris Achlioptas; Cristopher Moore (RANDOM, 2002)

Two-coloring random hypergraphs. - Dimitris Achlioptas; Jeong Han Kim; Michael Krivelevich; Prasad Tetali (Random Struct. Algorithms, 2002)

The threshold for random k-SAT is 2k (ln 2 - O(k)). - Dimitris Achlioptas; Yuval Peres (STOC, 2003)

The Threshold for Random k-SAT is 2kln2 - O(k) - Dimitris Achlioptas; Yuval Peres (CoRR, 2003)

Database-friendly random projections: Johnson-Lindenstrauss with binary coins. - Dimitris Achlioptas (J. Comput. Syst. Sci., 2003)

Almost all graphs with average degree 4 are 3-colorable. - Dimitris Achlioptas; Cristopher Moore (J. Comput. Syst. Sci., 2003)

The Chromatic Number of Random Regular Graphs. - Dimitris Achlioptas; Cristopher Moore (APPROX-RANDOM, 2004)

Sampling Grid Colorings with Fewer Colors. - Dimitris Achlioptas; Michael S. O. Molloy; Cristopher Moore; Frank Van Bussel (LATIN, 2004)

Random Matrices in Data Analysis. - Dimitris Achlioptas (PKDD, 2004)

Exponential bounds for DPLL below the satisfiability threshold. - Dimitris Achlioptas; Paul Beame; Michael Molloy 001 (SODA, 2004)

The two possible values of the chromatic number of a random graph. - Dimitris Achlioptas; Assaf Naor (STOC, 2004)

Summary-based routing for content-based event distribution networks. - Yi-Min Wang; Lili Qiu; Chad Verbowski; Dimitris Achlioptas; Gautam Das 001; Per-Åke Larson (Comput. Commun. Rev., 2004)

A sharp threshold in proof complexity yields lower bounds for satisfiability search. - Dimitris Achlioptas; Paul Beame; Michael S. O. Molloy (J. Comput. Syst. Sci., 2004)

On Spectral Learning of Mixtures of Distributions. - Dimitris Achlioptas; Frank McSherry (COLT, 2005)

Special Issue on Algorithms and Models for the Web-Graph. - Dimitris Achlioptas; Stefano Leonardi 001 (Internet Math., 2005)

Hiding Satisfying Assignments: Two are Better than One. - Dimitris Achlioptas; Haixia Jia; Cristopher Moore (J. Artif. Intell. Res., 2005)

On the solution-space geometry of random constraint satisfaction problems. - Dimitris Achlioptas; Federico Ricci-Tersenghi (STOC, 2006)

Random k-SAT: Two Moments Suffice to Cross a Sharp Threshold. - Dimitris Achlioptas; Cristopher Moore (SIAM J. Comput., 2006)

Fast computation of low-rank matrix approximations. - Dimitris Achlioptas; Frank McSherry (J. ACM, 2007)

On the maximum satisfiability of random formulas. - Dimitris Achlioptas; Assaf Naor; Yuval Peres (J. ACM, 2007)

Special Section on Foundations of Computer Science. - Dimitris Achlioptas; Vladlen Koltun (SIAM J. Comput., 2007)

Algorithmic Barriers from Phase Transitions. - Dimitris Achlioptas; Amin Coja-Oghlan (FOCS, 2008)

On the bias of traceroute sampling: Or, power-law degree distributions in regular graphs. - Dimitris Achlioptas; Aaron Clauset; David Kempe 001; Cristopher Moore (J. ACM, 2009)

Random Formulas Have Frozen Variables. - Dimitris Achlioptas; Federico Ricci-Tersenghi (SIAM J. Comput., 2009)

Random Satisfiability. - Dimitris Achlioptas (Handbook of Satisfiability, 2009)

Algorithmic Barriers from Phase Transitions in Graphs. - Dimitris Achlioptas (WG, 2010)

On the solution-space geometry of random constraint satisfaction problems. - Dimitris Achlioptas; Amin Coja-Oghlan; Federico Ricci-Tersenghi (Random Struct. Algorithms, 2011)

Algorithmic Improvements of the Lovász Local Lemma via Cluster Expansion . - Dimitris Achlioptas; Themis Gouleakis (FSTTCS, 2012)

Unsatisfiability Bounds for Random CSPs from an Energetic Interpolation Method. - Dimitris Achlioptas; Ricardo Menchaca-Mendez (ICALP (1), 2012)

Exponential Lower Bounds for DPLL Algorithms on Satisfiable Random 3-CNF Formulas. - Dimitris Achlioptas; Ricardo Menchaca-Mendez (SAT, 2012)

Near-Optimal Entrywise Sampling for Data Matrices. - Dimitris Achlioptas; Zohar Shay Karnin; Edo Liberty (NIPS, 2013)

High performance & low latency in solid-state drives through redundancy. - Dimitris Skourtis; Dimitris Achlioptas; Carlos Maltzahn; Scott A. Brandt (INFLOW@SOSP, 2013)

Erasure Coding & Read/Write Separation in Flash Storage. - Dimitris Skourtis; Dimitris Achlioptas; Noah Watkins; Carlos Maltzahn; Scott A. Brandt (INFLOW, 2014)

Flash on Rails: Consistent Flash Performance through Redundancy. - Dimitris Skourtis; Dimitris Achlioptas; Noah Watkins; Carlos Maltzahn; Scott A. Brandt (USENIX ATC, 2014)

The Lovász Local Lemma as a Random Walk. - Dimitris Achlioptas; Fotis Iliopoulos (CoRR, 2014)

Stochastic Integration via Error-Correcting Codes. - Dimitris Achlioptas; Pei Jiang 001 (UAI, 2015)

Navigability is a Robust Property. - Dimitris Achlioptas; Paris Siminelakis (WAW, 2015)

Product Measure Approximation of Symmetric Graph Properties. - Dimitris Achlioptas; Paris Siminelakis (CoRR, 2015)

The solution space geometry of random linear equations. - Dimitris Achlioptas; Michael Molloy 001 (Random Struct. Algorithms, 2015)

Bounds for Random Constraint Satisfaction Problems via Spatial Coupling. - Dimitris Achlioptas; Seyed Hamed Hassani; Nicolas Macris; Rüdiger L. Urbanke (SODA, 2016)

Focused Stochastic Local Search and the Lovász Local Lemma. - Dimitris Achlioptas; Fotis Iliopoulos (SODA, 2016)

Random Walks That Find Perfect Objects and the Lovász Local Lemma. - Dimitris Achlioptas; Fotis Iliopoulos (J. ACM, 2016)

Skip-Gram - Zipf + Uniform = Vector Additivity. - Alex Gittens; Dimitris Achlioptas; Michael W. Mahoney (ACL (1), 2017)

Stochastic Control via Entropy Compression. - Dimitris Achlioptas; Fotis Iliopoulos; Nikos Vlassis (ICALP, 2017)

Time-invariant LDPC convolutional codes. - Dimitris Achlioptas; S. Hamed Hassani; Wei Liu 105; Rüdiger L. Urbanke (ISIT, 2017)

Probabilistic Model Counting with Short XORs. - Dimitris Achlioptas; Panos Theodoropoulos (SAT, 2017)

Fast Sampling of Perfectly Uniform Satisfying Assignments. - Dimitris Achlioptas; Zayd S. Hammoudeh; Panos Theodoropoulos (SAT, 2018)

Fast and Flexible Probabilistic Model Counting. - Dimitris Achlioptas; Zayd Hammoudeh; Panos Theodoropoulos (SAT, 2018)

A New Perspective on Stochastic Local Search and the Lovasz Local Lemma. - Dimitris Achlioptas; Fotis Iliopoulos; Alistair Sinclair (CoRR, 2018)

Local Computation Algorithms for the Lovász Local Lemma. - Dimitris Achlioptas; Themis Gouleakis; Fotis Iliopoulos (CoRR, 2018)

Symmetric graph properties have independent edges. - Dimitris Achlioptas; Paris Siminelakis (Inf. Comput., 2018)

Beyond the Lovász Local Lemma: Point to Set Correlations and Their Algorithmic Applications. - Dimitris Achlioptas; Fotis Iliopoulos; Alistair Sinclair (FOCS, 2019)

Model counting with error-correcting codes. - Dimitris Achlioptas; Panos Theodoropoulos (Constraints An Int. J., 2019)

A Local Lemma for Focused Stochastic Algorithms. - Dimitris Achlioptas; Fotis Iliopoulos; Vladimir Kolmogorov (SIAM J. Comput., 2019)

Bad Global Minima Exist and SGD Can Reach Them. - Shengchao Liu; Dimitris S. Papailiopoulos; Dimitris Achlioptas (NeurIPS, 2020)

Simple Local Computation Algorithms for the General Lovász Local Lemma. - Dimitris Achlioptas; Themis Gouleakis; Fotis Iliopoulos (SPAA, 2020)

The random 2-SAT partition function. - Dimitris Achlioptas; Amin Coja-Oghlan; Max Hahn-Klimroth; Joon Lee; Noëla Müller; Manuel Penschuck; Guangyan Zhou (CoRR, 2020)

Special Section on the Fiftieth Annual ACM Symposium on Theory of Computing (STOC 2018). - Thomas Vidick; Danupon Nanongkai; Dimitris Achlioptas (SIAM J. Comput., 2020)

Local Approximations of the Independent Set Polynomial. - Dimitris Achlioptas; Kostas Zampetakis (ICALP, 2021)

The Lovász Local Lemma is Not About Probability. - Dimitris Achlioptas; Kostas Zampetakis (CoRR, 2021)

The number of satisfying assignments of random 2-SAT formulas. - Dimitris Achlioptas; Amin Coja-Oghlan; Max Hahn-Klimroth; Joon Lee; Noëla Müller; Manuel Penschuck; Guangyan Zhou (Random Struct. Algorithms, 2021)

Random Satisfiabiliy. - Dimitris Achlioptas (Handbook of Satisfiability, 2021)

A Simpler Proof of the Four Functions Theorem and Some New Variants. - Dimitris Achlioptas; Kostas Zampetakis (ISIT, 2022)

Hide and Seek: Scaling Machine Learning for Combinatorial Optimization via the Probabilistic Method. - Dimitris Achlioptas; Amrit Daswaney; Periklis A. Papakonstantinou (CoRR, 2022)

Bounding Weakly Correlated Products from Below: Supermodularity is All You Need. - Dimitris Achlioptas; Kostas Zampetakis (ISIT, 2024)