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