Dimitris Achlioptas Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

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

Coauthor Index

1Paul Beame [18] [34] [37]
2Jason I. Brown [4]
3Frank Van Bussel [39]
4Marek Chrobak [1] [8]
5Arthur D. Chtcherba [19]
6Aaron Clauset [46] [47] [57]
7Amin Coja-Oghlan [55]
8Derek G. Corneil [4]
9Gautam Das [35]
10Jeff Edmonds [5]
11Amos Fiat [23]
12Ehud Friedgut [6]
13Carla P. Gomes [12] [15] [22]
14Gabriel Istrate [19]
15Haixia Jia [42] [43] [45]
16Anna R. Karlin [23]
17Henry A. Kautz [12] [15] [22]
18David Kempe [46] [47] [57]
19Jeong Han Kim [10] [24]
20Lefteris M. Kirousis [3] [14] [16]
21Vladlen Koltun [52]
22Evangelos Kranakis [3] [14] [16]
23Michael Krivelevich [10] [24]
24Danny Krizanc [3] [14] [16]
25Per-Åke Larson (Paul Larson) [35]
26Stefano Leonardi [44]
27Frank McSherry [17] [21] [23] [48] [54]
28Michael Molloy (Michael S. O. Molloy) [2] [3] [4] [7] [16] [18] [34] [37] [39]
29Cristopher Moore [19] [25] [26] [27] [28] [31] [39] [41] [42] [43] [45] [46] [47] [49] [57]
30Assaf Naor [33] [36] [53]
31John Noga [1] [8]
32Yuval Peres [30] [32] [33] [53]
33Chung Keung Poon [5]
34Lili Qiu [35]
35Federico Ricci-Tersenghi [50] [51] [56]
36Yongshao Ruan [15] [22]
37Bernhard Schölkopf [21]
38Bart Selman [12] [15] [22]
39Gregory B. Sorkin [11]
40Yannis C. Stamatiou [3] [16]
41Mark E. Stickel [15] [22]
42Prasad Tetali [10] [24]
43Chad Verbowski [35]
44Yi-Min Wang [35]

Colors in the list of coauthors

Copyright © Sun Mar 14 22:39:24 2010 by Michael Ley (ley@uni-trier.de)