BibSonomy :: author  ::

bookmarks

publications

(57)

• Database-friendly random projections
  Dimitris Achlioptas PODS '01: Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems 274--281 (2001)
  to imported by mgrani and 2 other people on 2008-05-27 08:15:25
  | BibTeX  
• Special Issue on Algorithms and Models for the Web-Graph.
  Dimitris Achlioptas and Stefano Leonardi Internet Mathematics 2 (2005)
  to dblp by dblp on 2008-02-12 00:00:00
  | URL | BibTeX  
• On the Bias of Traceroute Sampling; or, Power-law Degree Distributions in Regular Graphs
  Dimitris Achlioptas and Aaron Clauset and David Kempe and Cristopher Moore CoRR abs/cond-mat/0503087 (2005)
  to dblp by dblp and 1 other person on 2008-01-02 00:00:00
  | URL | BibTeX  
• Hiding Satisfying Assignments: Two are Better than One
  Dimitris Achlioptas and Haixia Jia and Cristopher Moore CoRR abs/cs/0503046 (2005)
  to dblp by dblp and 1 other person on 2008-01-02 00:00:00
  | URL | BibTeX  
• On the Solution-Space Geometry of Random Constraint Satisfaction Problems
  Dimitris Achlioptas and Federico Ricci-Tersenghi CoRR abs/cs/0611052 (2006)
  to dblp by dblp and 1 other person on 2008-01-02 00:00:00
  | URL | BibTeX  
• The Threshold for Random k-SAT is 2kln2 - O(k)
  Dimitris Achlioptas and Yuval Peres CoRR cs.CC/0305009 (2003)
  to dblp by dblp and 1 other person on 2008-01-02 00:00:00
  | URL | BibTeX  
• Random k-SAT: Two Moments Suffice to Cross a Sharp Threshold
  Dimitris Achlioptas and Cristopher Moore CoRR cond-mat/0310227 (2003)
  to dblp by dblp on 2008-01-02 00:00:00
  | URL | BibTeX  
• The Asymptotic Order of the Random k -SAT Threshold.
  Dimitris Achlioptas and Cristopher Moore FOCS 779-788 (2002)
  to dblp by dblp on 2007-07-26 00:00:00
  | URL | BibTeX  
• Hiding Satisfying Assignments: Two are Better than One.
  Dimitris Achlioptas and Haixia Jia and Cristopher Moore J. Artif. Intell. Res. (JAIR) 24 623-639 (2005)
  to dblp by dblp and 1 other person on 2007-07-26 00:00:00
  | URL | BibTeX  
• The complexity of G-free colourability.
  Demetrios Achlioptas Discrete Mathematics 165-166 21-30 (1997)
  to dblp by dblp on 2007-06-27 00:00:00
  | URL | BibTeX