Database-friendly random projections: Johnson-Lindenstrauss with binary coins D Achlioptas Journal of computer and System Sciences 66 (4), 671-687, 2003 | 1560 | 2003 |

Database-friendly random projections D Achlioptas Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on …, 2001 | 1044 | 2001 |

Explosive percolation in random networks D Achlioptas, RM D'Souza, J Spencer science 323 (5920), 1453-1455, 2009 | 680 | 2009 |

Fast computation of low-rank matrix approximations D Achlioptas, F McSherry Journal of the ACM (JACM) 54 (2), 9-es, 2007 | 576 | 2007 |

System and method for employing social networks for information discovery D Achlioptas US Patent 7,472,110, 2008 | 545 | 2008 |

On spectral learning of mixtures of distributions D Achlioptas, F McSherry Learning Theory: 18th Annual Conference on Learning Theory, COLT 2005 …, 2005 | 310 | 2005 |

The threshold for random k-SAT is 2^{k} (ln 2 - O(k))D Achlioptas, Y Peres Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003 | 306 | 2003 |

On the bias of traceroute sampling: or, power-law degree distributions in regular graphs D Achlioptas, A Clauset, D Kempe, C Moore Journal of the ACM (JACM) 56 (4), 1-28, 2009 | 304 | 2009 |

Algorithmic barriers from phase transitions D Achlioptas, A Coja-Oghlan 2008 49th Annual IEEE Symposium on Foundations of Computer Science, 793-802, 2008 | 292 | 2008 |

Rigorous location of phase transitions in hard optimization problems D Achlioptas, A Naor, Y Peres Nature 435 (7043), 759-764, 2005 | 281 | 2005 |

The two possible values of the chromatic number of a random graph D Achlioptas, A Naor Annals of Mathematics 162 (3), 1335-1351, 2005 | 251 | 2005 |

Generating satisfiable problem instances D Achlioptas, C Gomes, H Kautz, B Selman AAAI/IAAI 2000, 256-261, 2000 | 248 | 2000 |

Sampling techniques for kernel methods D Achlioptas, F McSherry, B Schölkopf Advances in neural information processing systems 14, 2001 | 236 | 2001 |

System and method for employing social networks for information discovery D Achlioptas US Patent 8,335,798, 2012 | 197 | 2012 |

Stateless, affinity-preserving load balancing D Achlioptas, SB House US Patent 7,693,050, 2010 | 193 | 2010 |

Random *k*‐SAT: Two Moments Suffice to Cross a Sharp ThresholdD Achlioptas, C Moore SIAM Journal on Computing 36 (3), 740-762, 2006 | 193 | 2006 |

Methods and systems for computing singular value decompositions of matrices and low rank approximations of matrices D Achlioptas, FD McSherry US Patent 6,807,536, 2004 | 188 | 2004 |

Lower bounds for random 3-SAT via differential equations D Achlioptas Theoretical Computer Science 265 (1-2), 159-185, 2001 | 188 | 2001 |

On the solution-space geometry of random constraint satisfaction problems D Achlioptas, F Ricci-Tersenghi Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006 | 166 | 2006 |

A Sharp Threshold for *k*‐ColorabilityD Achlioptas, E Friedgut Random Structures & Algorithms 14 (1), 63-70, 1999 | 165 | 1999 |