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

A random polynomial-time algorithm for approximating the volume of convex bodies M Dyer, A Frieze, R Kannan Journal of the ACM (JACM) 38 (1), 1-17, 1991 | 768 | 1991 |

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 | 714 | 2004 |

Minkowski's convex body theorem and integer programming R Kannan Mathematics of operations research 12 (3), 415-440, 1987 | 667 | 1987 |

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 | 531 | 2004 |

Fast Monte Carlo algorithms for matrices II: Computing a low-rank approximation to a matrix P Drineas, R Kannan, MW Mahoney SIAM Journal on computing 36 (1), 158-183, 2006 | 518 | 2006 |

Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix R Kannan, A Bachem siam Journal on Computing 8 (4), 499-507, 1979 | 484 | 1979 |

Improved algorithms for integer programming and related lattice problems R Kannan Proceedings of the fifteenth annual ACM symposium on Theory of computing …, 1983 | 466 | 1983 |

Quick approximation to matrices and applications A Frieze, R Kannan Combinatorica 19 (2), 175-220, 1999 | 447 | 1999 |

Fast Monte Carlo algorithms for matrices I: Approximating matrix multiplication P Drineas, R Kannan, MW Mahoney SIAM Journal on Computing 36 (1), 132-157, 2006 | 376 | 2006 |

Isoperimetric problems for convex bodies and a localization lemma R Kannan, L Lovász, M Simonovits Discrete & Computational Geometry 13 (3-4), 541-559, 1995 | 360 | 1995 |

Random walks and an *O**(*n*^{5}) volume algorithm for convex bodiesR Kannan, L Lovász, M Simonovits Random Structures & Algorithms 11 (1), 1-50, 1997 | 341 | 1997 |

Computing a nonnegative matrix factorization---Provably S Arora, R Ge, R Kannan, A Moitra SIAM Journal on Computing 45 (4), 1582-1611, 2016 | 334 | 2016 |

Chvátal closures for mixed integer programming problems W Cook, R Kannan, A Schrijver Mathematical Programming 47 (1-3), 155-174, 1990 | 304 | 1990 |

Fast Monte Carlo algorithms for matrices III: Computing a compressed approximate matrix decomposition P Drineas, R Kannan, MW Mahoney SIAM Journal on Computing 36 (1), 184-206, 2006 | 291 | 2006 |

A deterministic (2− 2/(k+ 1)) n algorithm for k-SAT based on local search E Dantsin, A Goerdt, EA Hirsch, R Kannan, J Kleinberg, C Papadimitriou, ... Theoretical Computer Science 289 (1), 69-83, 2002 | 240 | 2002 |

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

Learning mixtures of arbitrary gaussians A Sanjeev, R Kannan Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001 | 234 | 2001 |

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 | 207 | 2006 |

The regularity lemma and approximation schemes for dense problems A Frieze, R Kannan Proceedings of 37th Conference on Foundations of Computer Science, 12-20, 1996 | 203 | 1996 |