@inproceedings{Achlioptas01DatabaseFriendlyRandomProjections,
	title = {Database-friendly random projections},
	address = {New York, NY, USA},
	author = {Dimitris Achlioptas},
	booktitle = {PODS '01: Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems},
	pages = {274--281},
	publisher = {ACM},
	year = {2001},
	biburl = {http://www.bibsonomy.org/bibtex/2a41af3bc4ea271feeaedab8977cd3a9b/mgrani},
	location = {Santa Barbara, California, United States}, isbn = {1-58113-361-8}, doi = {http://doi.acm.org/10.1145/375551.375608},
	keywords = {imported }
}

@article{journals/im/AchlioptasL05,
	title = {Special Issue on Algorithms and Models for the Web-Graph.},
	author = {Dimitris Achlioptas and Stefano Leonardi},
	journal = {Internet Mathematics},
	number = {3},
	url = {http://dblp.uni-trier.de/db/journals/im/im2.html#AchlioptasL05},
	volume = {2},
	year = {2005},
	biburl = {http://www.bibsonomy.org/bibtex/2262d6f322340f624a405cad3702d38ff/dblp},
	description = {dblp},
	date = {2008-02-12},
	keywords = {dblp }
}

@article{journals/corr/abs-cond-mat-0503087,
	title = {On the Bias of Traceroute Sampling; or, Power-law Degree Distributions in Regular Graphs},
	author = {Dimitris Achlioptas and Aaron Clauset and David Kempe and Cristopher Moore},
	journal = {CoRR},
	note = {informal publication},
	url = {http://dblp.uni-trier.de/db/journals/corr/corr0503.html#abs-cond-mat-0503087},
	volume = {abs/cond-mat/0503087},
	year = {2005},
	biburl = {http://www.bibsonomy.org/bibtex/28303082cbd3175fa62b0ae074c288f24/dblp},
	description = {dblp},
	ee = {http://arxiv.org/abs/cond-mat/0503087}, date = {2008-01-02},
	keywords = {dblp }
}

@article{journals/corr/abs-cs-0503046,
	title = {Hiding Satisfying Assignments: Two are Better than One},
	author = {Dimitris Achlioptas and Haixia Jia and Cristopher Moore},
	journal = {CoRR},
	note = {informal publication},
	url = {http://dblp.uni-trier.de/db/journals/corr/corr0503.html#abs-cs-0503046},
	volume = {abs/cs/0503046},
	year = {2005},
	biburl = {http://www.bibsonomy.org/bibtex/2c08be351899efb8609301afec23f994f/dblp},
	description = {dblp},
	ee = {http://arxiv.org/abs/cs/0503046}, date = {2008-01-02},
	keywords = {dblp }
}

@article{journals/corr/abs-cs-0611052,
	title = {On the Solution-Space Geometry of Random Constraint Satisfaction Problems},
	author = {Dimitris Achlioptas and Federico Ricci-Tersenghi},
	journal = {CoRR},
	note = {informal publication},
	url = {http://dblp.uni-trier.de/db/journals/corr/corr0611.html#abs-cs-0611052},
	volume = {abs/cs/0611052},
	year = {2006},
	biburl = {http://www.bibsonomy.org/bibtex/290247b0f079a941b1a34bed930f578de/dblp},
	description = {dblp},
	ee = {http://arxiv.org/abs/cs/0611052}, date = {2008-01-02},
	keywords = {dblp }
}

@article{journals/corr/cs-CC-0305009,
	title = {The Threshold for Random k-SAT is 2kln2 - O(k)},
	author = {Dimitris Achlioptas and Yuval Peres},
	journal = {CoRR},
	note = {informal publication},
	url = {http://dblp.uni-trier.de/db/journals/corr/corr0305.html#cs-CC-0305009},
	volume = {cs.CC/0305009},
	year = {2003},
	biburl = {http://www.bibsonomy.org/bibtex/23c815c5f5e2e2ec7be62a7aedc9bb75b/dblp},
	description = {dblp},
	ee = {http://arxiv.org/abs/cs.CC/0305009}, date = {2008-01-02},
	keywords = {dblp }
}

@article{journals/corr/cond-mat-0310227,
	title = {Random k-SAT: Two Moments Suffice to Cross a Sharp Threshold},
	author = {Dimitris Achlioptas and Cristopher Moore},
	journal = {CoRR},
	note = {informal publication},
	url = {http://dblp.uni-trier.de/db/journals/corr/corr0310.html#cond-mat-0310227},
	volume = {cond-mat/0310227},
	year = {2003},
	biburl = {http://www.bibsonomy.org/bibtex/27cdbf018ba873519f5da3369f8fdebcc/dblp},
	description = {dblp},
	ee = {http://arxiv.org/abs/cond-mat/0310227}, date = {2008-01-02},
	keywords = {dblp }
}

@inproceedings{conf/focs/AchlioptasM02,
	title = {The Asymptotic Order of the Random k -SAT Threshold.},
	author = {Dimitris Achlioptas and Cristopher Moore},
	booktitle = {FOCS},
	crossref = {conf/focs/2002},
	pages = {779-788},
	publisher = {IEEE Computer Society},
	url = {http://dblp.uni-trier.de/db/conf/focs/focs2002.html#AchlioptasM02},
	year = {2002},
	biburl = {http://www.bibsonomy.org/bibtex/2494cb357fce56d8aed0f8704a5ef22e3/dblp},
	description = {dblp},
	ee = {http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1182003}, isbn = {0-7695-1822-2}, date = {2007-07-26},
	keywords = {dblp }
}

@article{journals/jair/AchlioptasJM05,
	title = {Hiding Satisfying Assignments: Two are Better than One.},
	author = {Dimitris Achlioptas and Haixia Jia and Cristopher Moore},
	journal = {J. Artif. Intell. Res. (JAIR)},
	pages = {623-639},
	url = {http://dblp.uni-trier.de/db/journals/jair/jair24.html#AchlioptasJM05},
	volume = {24},
	year = {2005},
	biburl = {http://www.bibsonomy.org/bibtex/2c74b8660d838467c1d70e53ff6e2511f/dblp},
	description = {dblp},
	ee = {http://www.jair.org/papers/paper1681.html}, date = {2007-07-26},
	keywords = {dblp }
}

@article{journals/dm/Achlioptas97,
	title = {The complexity of G-free colourability.},
	author = {Demetrios Achlioptas},
	journal = {Discrete Mathematics},
	pages = {21-30},
	url = {http://dblp.uni-trier.de/db/journals/dm/dm165.html#Achlioptas97},
	volume = {165-166},
	year = {1997},
	biburl = {http://www.bibsonomy.org/bibtex/29286783aa416e5443c99d8e964230b69/dblp},
	description = {dblp},
	ee = {http://dx.doi.org/10.1016/S0012-365X(97)84217-3}, date = {2007-06-27},
	keywords = {dblp }
}