On clusterings: Good, bad and spectral R Kannan, S Vempala, A Vetta Journal of the ACM (JACM) 51 (3), 497-515, 2004 | 1391 | 2004 |

Latent semantic indexing: A probabilistic analysis CH Papadimitriou, P Raghavan, H Tamaki, S Vempala Journal of Computer and System Sciences 61 (2), 217-235, 2000 | 1311 | 2000 |

Fast Monte-Carlo algorithms for finding low-rank approximations A Frieze, R Kannan, S Vempala Journal of the ACM (JACM) 51 (6), 1025-1041, 2004 | 733 | 2004 |

Clustering large graphs via the singular value decomposition P Drineas, A Frieze, R Kannan, S Vempala, V Vinay Machine learning 56 (1-3), 9-33, 2004 | 556 | 2004 |

Clustering large graphs via the singular value decomposition P Drineas, A Frieze, R Kannan, S Vempala, V Vinay Machine learning 56 (1-3), 9-33, 2004 | 556 | 2004 |

Efficient algorithms for online decision problems A Kalai, S Vempala Journal of Computer and System Sciences 71 (3), 291-307, 2005 | 527 | 2005 |

The random projection method SS Vempala American Mathematical Soc., 2005 | 450 | 2005 |

Filtering spam with behavioral blacklisting A Ramachandran, N Feamster, S Vempala Proceedings of the 14th ACM conference on Computer and communications …, 2007 | 322 | 2007 |

Matrix approximation and projective clustering via volume sampling A Deshpande, L Rademacher, S Vempala, G Wang Theory of Computing 2 (1), 225-247, 2006 | 310 | 2006 |

The geometry of logconcave functions and sampling algorithms L Lovász, S Vempala Random Structures & Algorithms 30 (3), 307-358, 2007 | 270 | 2007 |

Path splicing M Motiwala, M Elmore, N Feamster, S Vempala Proceedings of the ACM SIGCOMM 2008 conference on Data communication, 27-38, 2008 | 269 | 2008 |

Simulated annealing in convex bodies and an O*(n4) volume algorithm L Lovász, S Vempala Journal of Computer and System Sciences 72 (2), 392-417, 2006 | 262 | 2006 |

The geometry of logconcave functions and sampling algorithms L Lovász, S Vempala Random Structures & Algorithms 30 (3), 307-358, 2007 | 251 | 2007 |

An algorithmic theory of learning: Robust concepts and random projection RI Arriaga, S Vempala 40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039 …, 1999 | 249 | 1999 |

New approximation guarantees for minimum-weight k-trees and prize-collecting salesmen B Awerbuch, Y Azar, A Blum, S Vempala SIAM Journal on computing 28 (1), 254-262, 1998 | 246 | 1998 |

Clustering in Large Graphs and Matrices. P Drineas, AM Frieze, R Kannan, SS Vempala, V Vinay SODA 99, 291-299, 1999 | 244 | 1999 |

A divide-and-merge methodology for clustering D Cheng, R Kannan, S Vempala, G Wang ACM Transactions on Database Systems (TODS) 31 (4), 1499-1525, 2006 | 242* | 2006 |

Solving convex programs by random walks D Bertsimas, S Vempala Journal of the ACM (JACM) 51 (4), 540-556, 2004 | 219 | 2004 |

Hit-and-run from a corner L Lovász, S Vempala SIAM Journal on Computing 35 (4), 985-1005, 2006 | 217 | 2006 |

Locality-preserving hashing in multidimensional spaces P Indyk, R Motwani, P Raghavan, S Vempala Proceedings of the twenty-ninth annual ACM symposium on Theory of computing …, 1997 | 217 | 1997 |