- Exponential Bounds for DPLL Below the Satisfiability Threshold Dimitris Achlioptas
- EPJ manuscript No. (will be inserted by the editor)
- Random Formulas Have Frozen Variables Dimitris Achlioptas
- On the Solution-Space Geometry of Random Constraint Satisfaction Problems
- A Sharp Threshold for k-Colorability Dimitris Achlioptas1,
- J.Stat.Mech.(2005)P10012 ournal of Statistical Mechanics
- The Phase Transition in 1-in-k SAT and NAE 3-SAT Dimitris Achlioptas* Arthur Chtcherba t Gabriel Istrate* Cristopher Moore
- JOURNAL OF THE AMERICAN MATHEMATICAL SOCIETY
- Random Matrices in Data Analysis Dimitris Achlioptas
- http://www.elsevier.com/locate/jcss Journal of Computer and System Sciences 67 (2003) 441471
- http://www.elsevier.com/locate/jcss Journal of Computer and System Sciences 68 (2004) 238268
- Handbook of Satisfiability Armin Biere, Marijn Heule, Hans van Maaren and Toby Walsch
- On the Bias of Traceroute Sampling: or, Power-Law Degree Distributions in Regular Graphs
- Algorithmic Barriers from Phase Transitions Dimitris Achlioptas
- On the Maximum Satisfiability of Random Formulas Dimitris Achlioptas
- SIAM J. COMPUT. c 2006 Society for Industrial and Applied Mathematics Vol. 36, No. 3, pp. 740762
- The Chromatic Number of Random Regular Graphs
- http://www.elsevier.com/locate/jcss Journal of Computer and System Sciences 66 (2003) 671687
- Web Search Via Hub Synthesis Dimitris Achlioptas
- Constraints, 6, 329344, 2001 2001 Kluwer Academic Publishers. Manufactured in The Netherlands.
- Generating Satisfiable Problem Instances Dimitris Achlioptas
- Setting 2 variables at a time yields a new lower bound for random 3-SAT
- Theoretical Computer Science 234 (2000) 203218 www.elsevier.com/locate/tcs
- TIGHT LOWER BOUNDS FOR st-CONNECTIVITY ON THE NNJAG MODEL
- The Analysis of a List-Coloring Algorithm on a Random Graph (extended abstract)
- Two-Coloring Random Hypergraphs Dimitris Achlioptas,1
- On the 2-Colorability of Random Hypergraphs Dimitris Achlioptas and Cristopher Moore
- Theoretical Computer Science 265 (2001) 109129 www.elsevier.com/locate/tcs
- Journal of Artificial Intelligence Research 24 (2005) 623-639 Submitted 12/04; published 11/05 Hiding Satisfying Assignments: Two are Better than One
- Theoretical Computer Science 265 (2001) 159185 www.elsevier.com/locate/tcs
- Optimal myopic algorithms for random 3-SAT Dimitris Achlioptas Gregory B. Sorkin
- Fast Computation of Low Rank Matrix Approximations Dimitris Achlioptas
- MATHEMATICS ELSEVIER Discrete Mathematics 179 (1998) 1-11
- Balance and Filtering in Structured Satisfiable Problems Henry Kautz
- On the Solution-Space Geometry of Random Constraint Satisfaction Problems
- Rigorous location of phase transitions in hard optimization problems
- Sampling Techniques for Kernel Methods Dimitris Achlioptas
- EL%VIER Discrete Mathematics 1651166 (1997) 2 I-30 MATHEMATICS
- Annals of Mathematics, 162 (2005), 13351351 The two possible values of the
- 38. S. Choi, J. Klingauf, R. W. Tsien, Philos. Trans. R. Soc. London Ser. B 358, 695 (2003).
- Almost all graphs with 2.522n edges are not 3-colorable Dimitris Achlioptas
