| 2011 |
|---|
| 1 |
The solution space geometry of random linear equations. Dimitris Achlioptas, Michael Molloy. CoRR (abs/1107.5550) (2011). Web SearchBibTeXDownload |
| 2 |
On the solution-space geometry of random constraint satisfaction problems. Dimitris Achlioptas, Federico Ricci-Tersenghi, Federico Ricci-Tersenghi. Random Struct. Algorithms (38): 251-268 (2011). Web SearchBibTeXDownload |
| 2010 |
|---|
| 1 |
Algorithmic Barriers from Phase Transitions in Graphs. Dimitris Achlioptas. WG 2010, 1. Web SearchBibTeXDownload |
| 2009 |
|---|
| 1 |
On the bias of traceroute sampling: Or, power-law degree distributions in regular graphs. Dimitris Achlioptas, Aaron Clauset, David Kempe, Cristopher Moore. J. ACM (56) (2009). Web SearchBibTeXDownload |
| 2 |
Random Formulas Have Frozen Variables. Dimitris Achlioptas, Federico Ricci-Tersenghi. SIAM J. Comput. (39): 260-280 (2009). Web SearchBibTeXDownload |
| 3 |
Random Satisfiability. Dimitris Achlioptas. Handbook of Satisfiability 2009, 245-270. Web SearchBibTeXDownload |
| 2008 |
|---|
| 1 |
Algorithmic Barriers from Phase Transitions. Dimitris Achlioptas, Amin Coja-Oghlan. FOCS 2008, 793-802. Web SearchBibTeXDownload |
| 2007 |
|---|
| 1 |
Fast computation of low-rank matrix approximations. Dimitris Achlioptas, Frank McSherry. J. ACM (54) (2007). Web SearchBibTeXDownload |
| 2 |
Special Section on Foundations of Computer Science. Scott Aaronson, Jeff Erickson, Mohammad Mahdian, R. Ravi, Emanuele Viola. SIAM J. Comput. (37): 165 (2007). Web SearchBibTeX |
| 3 |
On the maximum satisfiability of random formulas. Dimitris Achlioptas, Assaf Naor, Yuval Peres. J. ACM (54) (2007). Web SearchBibTeXDownload |
| 2006 |
|---|
| 1 |
On the solution-space geometry of random constraint satisfaction problems. Dimitris Achlioptas, Federico Ricci-Tersenghi, Federico Ricci-Tersenghi. STOC 2006, 130-139. Web SearchBibTeXDownload |
| 2 |
On the Solution-Space Geometry of Random Constraint Satisfaction Problems. Dimitris Achlioptas, Federico Ricci-Tersenghi. CoRR (abs/cs/0611052) (2006). Web SearchBibTeXDownload |
| 3 |
Random k-SAT: Two Moments Suffice to Cross a Sharp Threshold. Dimitris Achlioptas, Cristopher Moore. SIAM J. Comput. (36): 740-762 (2006). Web SearchBibTeXDownload |
| 2005 |
|---|
| 1 |
Hiding Satisfying Assignments: Two are Better than One. Dimitris Achlioptas, Haixia Jia, Cristopher Moore. CoRR (abs/cs/0503046): 623-639 (2005). Web SearchBibTeXDownload |
| 2 |
On Spectral Learning of Mixtures of Distributions. Dimitris Achlioptas, Frank McSherry. COLT 2005, 458-469. Web SearchBibTeXDownload |
| 3 |
Special Issue on Algorithms and Models for the Web-Graph. Dimitris Achlioptas, Stefano Leonardi. Internet Mathematics (2) (2005). Web SearchBibTeX |
| 4 |
On the Bias of Traceroute Sampling; or, Power-law Degree Distributions in Regular Graphs. Dimitris Achlioptas, Aaron Clauset, David Kempe, Cristopher Moore. CoRR (abs/cond-mat/0503087) (2005). Web SearchBibTeXDownload |
| 5 |
On the bias of traceroute sampling: or, power-law degree distributions in regular graphs. Dimitris Achlioptas, Aaron Clauset, David Kempe, Cristopher Moore. STOC 2005, 694-703. Web SearchBibTeXDownload |
| 2004 |
|---|
| 1 |
Summary-based routing for content-based event distribution networks. Yi-Min Wang, Lili Qiu, Chad Verbowski, Dimitris Achlioptas, Gautam Das, Per-Åke Larson. Computer Communication Review (34): 59-74 (2004). Cited by 20Web SearchBibTeXDownload |
| 2 |
Exponential bounds for DPLL below the satisfiability threshold. Dimitris Achlioptas, Paul Beame, Michael Molloy. SODA 2004, 139-140. Web SearchBibTeXDownload |
| 3 |
Random Matrices in Data Analysis. Dimitris Achlioptas. PKDD 2004, 1-7. Web SearchBibTeXDownload |
| 4 |
Hiding Satisfying Assignments: Two Are Better than One. Dimitris Achlioptas, Haixia Jia, Cristopher Moore. AAAI 2004, 131-136. Web SearchBibTeX |
| 5 |
The two possible values of the chromatic number of a random graph. Dimitris Achlioptas, Assaf Naor. STOC 2004, 587-593. Web SearchBibTeXDownload |
| 6 |
The Chromatic Number of Random Regular Graphs. Dimitris Achlioptas, Cristopher Moore. APPROX-RANDOM 2004, 219-228. Web SearchBibTeXDownload |
| 7 |
A sharp threshold in proof complexity yields lower bounds for satisfiability search. Dimitris Achlioptas, Paul Beame, Michael S. O. Molloy. J. Comput. Syst. Sci. (68): 238-268 (2004). Web SearchBibTeXDownload |
| 8 |
Sampling Grid Colorings with Fewer Colors. Dimitris Achlioptas, Michael S. O. Molloy, Cristopher Moore, Frank Van Bussel. LATIN 2004, 80-89. Web SearchBibTeXDownload |
| 2003 |
|---|
| 1 |
Random k-SAT: Two Moments Suffice to Cross a Sharp Threshold. Dimitris Achlioptas, Cristopher Moore. CoRR (cond-mat/0310227) (2003). Web SearchBibTeXDownload |
| 2 |
Database-friendly random projections: Johnson-Lindenstrauss with binary coins. Dimitris Achlioptas. J. Comput. Syst. Sci. (66): 671-687 (2003). Web SearchBibTeXDownload |
| 3 |
On the Maximum Satisfiability of Random Formulas. Dimitris Achlioptas, Assaf Naor, Yuval Peres. FOCS 2003, 362-370. Web SearchBibTeXDownload |
| 4 |
Almost all graphs with average degree 4 are 3-colorable. Dimitris Achlioptas, Cristopher Moore. J. Comput. Syst. Sci. (67): 441-471 (2003). Web SearchBibTeXDownload |
| 5 |
The Threshold for Random k-SAT is 2kln2 - O(k). Dimitris Achlioptas, Yuval Peres. CoRR (cs.CC/0305009) (2003). Web SearchBibTeXDownload |
| 6 |
The threshold for random k-SAT is 2k (ln 2 - O(k)). Dimitris Achlioptas, Yuval Peres. STOC 2003, 223-231. Web SearchBibTeXDownload |
| 2002 |
|---|
| 1 |
The Asymptotic Order of the Random k -SAT Threshold. Dimitris Achlioptas, Cristopher Moore. FOCS 2002, 779-788. Web SearchBibTeXDownload |
| 2 |
On the 2-Colorability of Random Hypergraphs. Dimitris Achlioptas, Cristopher Moore. RANDOM 2002, 78-90. Web SearchBibTeXDownload |
| 3 |
Two-coloring random hypergraphs. Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali. Random Struct. Algorithms (20): 249-259 (2002). Web SearchBibTeX |
| 4 |
Almost all graphs with average degree 4 are 3-colorable. Dimitris Achlioptas, Cristopher Moore. STOC 2002, 199-208. Web SearchBibTeXDownload |
| 2001 |
|---|
| 1 |
Fast computation of low rank matrix. Dimitris Achlioptas, Frank McSherry. STOC 2001, 611-618. Web SearchBibTeXDownload |
| 2 |
Rigorous results for random (2+p)-SAT. Dimitris Achlioptas, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc. Theor. Comput. Sci. (265): 109-129 (2001). Web SearchBibTeXDownload |
| 3 |
Balance and Filtering in Structured Satisfiable Problems (Preliminary Report). Henry A. Kautz, Yongshao Ruan, Dimitris Achlioptas, Carla P. Gomes, Bart Selman, Mark E. Stickel. Electronic Notes in Discrete Mathematics (9): 2-18 (2001). Web SearchBibTeXDownload |
| 4 |
The phase transition in 1-in-k SAT and NAE 3-SAT. Dimitris Achlioptas, Arthur D. Chtcherba, Gabriel Istrate, Cristopher Moore. SODA 2001, 721-722. Web SearchBibTeXDownload |
| 5 |
Sampling Techniques for Kernel Methods. Dimitris Achlioptas, Frank McSherry, Bernhard Schölkopf. NIPS 2001, 335-342. Web SearchBibTeXDownload |
| 6 |
A sharp threshold in proof complexity. Dimitris Achlioptas, Paul Beame, Michael S. O. Molloy. STOC 2001, 337-346. Web SearchBibTeXDownload |
| 7 |
Random Constraint Satisfaction: A More Accurate Picture. Dimitris Achlioptas, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Michael S. O. Molloy, Yannis C. Stamatiou. Constraints (6): 329-344 (2001). Web SearchBibTeXDownload |
| 8 |
Balance and Filtering in Structured Satisfiable Problems. Henry A. Kautz, Yongshao Ruan, Dimitris Achlioptas, Carla P. Gomes, Bart Selman, Mark E. Stickel. IJCAI 2001, 351-358. Web SearchBibTeX |
| 9 |
Web Search via Hub Synthesis. Dimitris Achlioptas, Amos Fiat, Unknown, Frank McSherry. FOCS 2001, 500-509. Web SearchBibTeXDownload |
| 10 |
Database-friendly random projections. Dimitris Achlioptas. PODS 2001. Web SearchBibTeXDownload |
| 11 |
Lower bounds for random 3-SAT via differential equations. Dimitris Achlioptas. Theor. Comput. Sci. (265): 159-185 (2001). Web SearchBibTeXDownload |
| 2000 |
|---|
| 1 |
Generating Satisfiable Problem Instances. Dimitris Achlioptas, Carla P. Gomes, Henry A. Kautz, Bart Selman. AAAI/IAAI 2000, 256-261. Web SearchBibTeX |
| 2 |
Competitive analysis of randomized paging algorithms. Dimitris Achlioptas, Marek Chrobak, John Noga. Theor. Comput. Sci. (234): 203-218 (2000). Web SearchBibTeXDownload |
| 3 |
Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract). Dimitris Achlioptas. STOC 2000, 28-37. Web SearchBibTeXDownload |
| 4 |
Optimal myopic algorithms for random 3-SAT. Dimitris Achlioptas, Gregory B. Sorkin. FOCS 2000, 590-600. Web SearchBibTeXDownload |
| 5 |
Two-coloring Random Hypergraphs. Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali. ICALP Satellite Workshops 2000, 85-96. Web SearchBibTeX |
| 1999 |
|---|
| 1 |
Almost all graphs with 2.522 n edges are not 3-colorable. Dimitris Achlioptas, Michael Molloy. Electr. J. Comb. (6) (1999). Web SearchBibTeXDownload |
| 2 |
Tight Lower Bounds for st-Connectivity on the NNJAG Model. Jeff Edmonds, Chung Keung Poon, Dimitris Achlioptas. SIAM J. Comput. (28): 2257-2284 (1999). Web SearchBibTeXDownload |
| 3 |
A Sharp Threshold for k-Colorability. Dimitris Achlioptas, Ehud Friedgut. Random Struct. Algorithms (14): 63-70 (1999). Web SearchBibTeX |
| 1998 |
|---|
| 1 |
The existence of uniquely -G colourable graphs. Dimitris Achlioptas, Jason I. Brown, Derek G. Corneil, Michael S. O. Molloy. Discrete Mathematics (179): 1-11 (1998). Web SearchBibTeXDownload |
| 1997 |
|---|
| 1 |
The Analysis of a List-Coloring Algorithm on a Random Graph. Dimitris Achlioptas, Michael S. O. Molloy. FOCS 1997, 204-212. Web SearchBibTeXDownload |
| 2 |
Random Constraint Satisfaction: A More Accurate Picture. Dimitris Achlioptas, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Michael S. O. Molloy, Yannis C. Stamatiou. CP 1997, 107-120. Web SearchBibTeXDownload |
| 1996 |
|---|
| 1 |
Competive Analysis of Randomized Paging Algorithms. Dimitris Achlioptas, Marek Chrobak, John Noga. ESA 1996, 419-430. Web SearchBibTeXDownload |
