| 2025 | ICLR | LevAttention: Time, Space and Streaming Efficient Algorithm for Heavy Attentions. | Ravindran Kannan, Chiranjib Bhattacharyya, Praneeth Kacham, David P. Woodruff |
| 2024 | ICALP | Random Separating Hyperplane Theorem and Learning Polytopes. | Chiranjib Bhattacharyya, Ravindran Kannan, Amit Kumar |
| 2022 | SODA | How many Clusters? - An algorithmic answer. | Chiranjib Bhattacharyya, Ravindran Kannan, Amit Kumar |
| 2021 | ICML | Finding k in Latent k- polytope. | Chiranjib Bhattacharyya, Ravindran Kannan, Amit Kumar |
| 2020 | ICML | Near-optimal sample complexity bounds for learning Latent k-polytopes and applications to Ad-Mixtures. | Chiranjib Bhattacharyya, Ravindran Kannan |
| 2020 | SODA | Finding a latent | Chiranjib Bhattacharyya, Ravindran Kannan |
| 2017 | COLT | The Hidden Hubs Problem. | Ravindran Kannan, Santosh S. Vempala |
| 2016 | ICML | Non-negative Matrix Factorization under Heavy Noise. | Chiranjib Bhattacharyya, Navin Goyal, Ravindran Kannan, Jagdeep Pani |
| 2014 | FOCS | Spectral Approaches to Nearest Neighbor Search. | Amirali Abdullah, Alexandr Andoni, Ravindran Kannan, Robert Krauthgamer |
| 2012 | ICALP | Zero-One Rounding of Singular Vectors. | Amit Deshpande, Ravindran Kannan, Nikhil Srivastava |
| 2012 | STOC | Computing a nonnegative matrix factorization - provably. | Sanjeev Arora, Rong Ge, Ravindran Kannan, Ankur Moitra |
| 2010 | FOCS | Clustering with Spectral Norm and the k-Means Algorithm. | Amit Kumar, Ravindran Kannan |
| 2010 | STOC | Spectral methods for matrices and tensors. | Ravindran Kannan |
| 2009 | FOCS | A New Probability Inequality Using Typical Moments and Concentration Results. | Ravindran Kannan |
| 2005 | COLT | The Spectral Method for General Mixture Models. | Ravindran Kannan, Hadi Salmasian, Santosh S. Vempala |
| 1984 | FOCS | Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers | Ravindran Kannan, Gary L. Miller, Larry Rudolph |
| 1984 | STOC | Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers | Ravindran Kannan, Arjen K. Lenstra, Lszl Lovsz |
| 1980 | STOC | The Orbit Problem is Decidable | Ravindran Kannan, Richard J. Lipton |