| 2021 | ICLR | Learning a Latent Simplex in Input Sparsity Time. | Ainesh Bakshi, Chiranjib Bhattacharyya, Ravi Kannan, David P. Woodruff, Samson Zhou |
| 2014 | COLT | Principal Component Analysis and Higher Correlations for Distributed Data. | Ravi Kannan, Santosh S. Vempala, David P. Woodruff |
| 2009 | EACL | Discovering Global Patterns in Linguistic Networks through Spectral Analysis: A Case Study of the Consonant Inventories. | Animesh Mukherjee, Monojit Choudhury, Ravi Kannan |
| 2009 | STOC | Random walks on polytopes and an affine interior point method for linear programming. | Ravi Kannan, Hariharan Narayanan |
| 2009 | WAOA | Finding Dense Subgraphs in | Atish Das Sarma, Amit Deshpande, Ravi Kannan |
| 2008 | FOCS | Market Equilibria in Polynomial Time for Fixed Number of Goods or Agents. | Nikhil R. Devanur, Ravi Kannan |
| 2007 | SODA | Spectral clustering with limited independence. | Anirban Dasgupta, John E. Hopcroft, Ravi Kannan, Pradipta Prometheus Mitra |
| 2007 | SODA | Games of fixed rank: a hierarchy of bimatrix games. | Ravi Kannan, Thorsten Theobald |
| 2006 | ESA | Spectral Clustering by Recursive Partitioning. | Anirban Dasgupta, John E. Hopcroft, Ravi Kannan, Pradipta Prometheus Mitra |
| 2006 | SODA | The space complexity of pass-efficient algorithms for clustering. | Kevin L. Chang, Ravi Kannan |
| 2005 | PODS | A divide-and-merge methodology for clustering. | David Cheng, Santosh S. Vempala, Ravi Kannan, Grant Wang |
| 2005 | STOC | Tensor decomposition and approximation schemes for constraint satisfaction problems. | Wenceslas Fernandez de la Vega, Marek Karpinski, Ravi Kannan, Santosh S. Vempala |
| 2005 | STACS | Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms. | Petros Drineas, Ravi Kannan, Michael W. Mahoney |
| 2003 | ISAAC | Rapid Mixing of Several Markov Chains for a Hard-Core Model. | Ravi Kannan, Michael W. Mahoney, Ravi Montenegro |
| 2003 | SODA | Pass efficient algorithms for approximating large matrices. | Petros Drineas, Ravi Kannan |
| 2002 | STOC | Random sampling and approximation of MAX-CSP problems. | Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski |
| 2001 | FOCS | Fast Monte-Carlo Algorithms for Approximate Matrix Multiplication. | Petros Drineas, Ravi Kannan |
| 2001 | STOC | Learning mixtures of arbitrary gaussians. | Sanjeev Arora, Ravi Kannan |
| 2000 | FOCS | On Clusterings - Good, Bad and Spectral. | Ravi Kannan, Santosh S. Vempala, Adrian Vetta |
| 1999 | SODA | Clustering in Large Graphs and Matrices. | Petros Drineas, Alan M. Frieze, Ravi Kannan, Santosh S. Vempala, V. Vinay |
| 1999 | STOC | Faster Mixing via Average Conductance. | Lszl Lovsz, Ravi Kannan |
| 1998 | ESA | A Fast Random Greedy Algorithm for the Component Commonality Problem. | Ravi Kannan, Andreas Nolte |
| 1998 | FOCS | Approximation of Diameters: Randomization Doesn't Help. | Andreas Brieden, Peter Gritzmann, Ravi Kannan, Victor Klee, Lszl Lovsz, Mikls Simonovits |
| 1998 | FOCS | Fast Monte-Carlo Algorithms for Finding Low-Rank Approximations. | Alan M. Frieze, Ravi Kannan, Santosh S. Vempala |
| 1998 | FOCS | Local Search in Smooth Convex Sets. | Ravi Kannan, Andreas Nolte |
| 1997 | SODA | Simple Markov-Chain Algorithms for Generating Bipartite Graphs and Tournaments (Extended Abstract). | Ravi Kannan, Prasad Tetali, Santosh S. Vempala |
| 1997 | STOC | Sampling Lattice Points. | Ravi Kannan, Santosh S. Vempala |
| 1996 | FOCS | A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions. | Avrim Blum, Alan M. Frieze, Ravi Kannan, Santosh S. Vempala |
| 1996 | FOCS | Learning Linear Transformations. | Alan M. Frieze, Mark Jerrum, Ravi Kannan |
| 1996 | FOCS | The Regularity Lemma and Approximation Schemes for Dense Problems. | Alan M. Frieze, Ravi Kannan |
| 1996 | FOCS | Sampling According to the Multivariate Normal Density. | Ravi Kannan, Guangxing Li |
| 1994 | FOCS | Markov Chains and Polynomial Time Algorithms | Ravi Kannan |
| 1993 | FOCS | Learning an Intersection of k Halfspaces over a Uniform Distribution | Avrim Blum, Ravi Kannan |
| 1993 | IPCO | Optimal solution and value of parametric integer programs. | Ravi Kannan |
| 1991 | STOC | Sampling and Integration of Near Log-Concave functions | David L. Applegate, Ravi Kannan |
| 1989 | STOC | A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies | Martin E. Dyer, Alan M. Frieze, Ravi Kannan |
| 1986 | STOC | On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines | Zvi Galil, Ravi Kannan, Endre Szemerdi |
| 1984 | FOCS | Linear Congruential Generators Do Not Produce Random Sequences | Alan M. Frieze, Ravi Kannan, J. C. Lagarias |
| 1983 | STOC | Improved Algorithms for Integer Programming and Related Lattice Problems | Ravi Kannan |
| 1983 | STOC | Alternation and the Power of Nondeterminism | Ravi Kannan |
| 1981 | FOCS | Towards Separating Nondeterministic Time from Deterministic Time | Ravi Kannan |
| 1981 | FOCS | A Circuit-Size Lower Bound | Ravi Kannan |