Ravindran Kannan

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	LevAttention: Time, Space, and Streaming Efficient Algorithm for Heavy Attentions	2024	Ravindran Kannan Chiranjib Bhattacharyya Praneeth Kacham David P. Woodruff
+	Random Separating Hyperplane Theorem and Learning Polytopes	2023	Chiranjib Bhattacharyya Ravindran Kannan Amit Kumar
+	Finding k in Latent $k-$ polytope	2021	Chiranjib Bhattacharyya Ravindran Kannan Amit Kumar
+	Algorithms for finding k in k-means.	2020	Chiranjib Bhattacharyya Ravindran Kannan Amit Kumar
+	Random Walks and Markov Chains	2020	Avrim Blum John E. Hopcroft Ravindran Kannan
+	Other Topics	2020	Avrim Blum John E. Hopcroft Ravindran Kannan
+ PDF Chat	Introduction	2020	Avrim Blum John E. Hopcroft Ravindran Kannan
+	Finding a latent k---simplex in O* (k · nnz(data)) time via subset smoothing	2020	Chiranjib Bhattacharyya Ravindran Kannan
+	Algorithms for finding $k$ in $k$-means	2020	Chiranjib Bhattacharyya Ravindran Kannan Amit Kumar
+ PDF Chat	Finding a latent <i>k</i>–simplex in <i>O</i>* (<i>k</i> · nnz(data)) time via Subset Smoothing	2019	Chiranjib Bhattacharyya Ravindran Kannan
+	Finding a latent k-simplex in O(k . nnz(data)) time via Subset Smoothing	2019	Chiranjib Bhattacharyya Ravindran Kannan
+	Finding a latent k-polytope in O(k . nnz(data)) time via Subset Smoothing	2019	Chiranjib Bhattacharyya Ravindran Kannan
+	Finding a latent k-simplex in O(k . nnz(data)) time via Subset Smoothing	2019	Chiranjib Bhattacharyya Ravindran Kannan
+	A provable SVD-based algorithm for learning topics in dominant admixture corpus	2014	Trapit Bansal Chiranjib Bhattacharyya Ravindran Kannan
+ PDF Chat	Spectral Approaches to Nearest Neighbor Search	2014	Amirali Abdullah Alexandr Andoni Ravindran Kannan Robert Krauthgamer
+	Spectral Approaches to Nearest Neighbor Search	2014	Amirali Abdullah Alexandr Andoni Ravindran Kannan Robert Krauthgamer
+	A provable SVD-based algorithm for learning topics in dominant admixture corpus	2014	Trapit Bansal Chiranjib Bhattacharyya Ravindran Kannan
+	Spectral Approaches to Nearest Neighbor Search	2014	Amirali Abdullah Alexandr Andoni Ravindran Kannan Robert Krauthgamer
+	Principal Component Analysis and Higher Correlations for Distributed Data	2013	Ravindran Kannan Santosh Vempala David P. Woodruff
+	Nimble Algorithms for Cloud Computing	2013	Ravindran Kannan Santosh Vempala
+	Principal Component Analysis and Higher Correlations for Distributed Data	2013	Ravindran Kannan Santosh Vempala David P. Woodruff
+ PDF Chat	Computing a nonnegative matrix factorization -- provably	2012	Sanjeev Arora Rong Ge Ravindran Kannan Ankur Moitra
+ PDF Chat	Random Walks on Polytopes and an Affine Interior Point Method for Linear Programming	2012	Ravindran Kannan Hariharan Narayanan
+	Zero-One Rounding of Singular Vectors	2012	Amit Deshpande Ravindran Kannan Nikhil Srivastava
+ PDF Chat	Clustering with Spectral Norm and the k-Means Algorithm	2010	Amit Kumar Ravindran Kannan
+ PDF Chat	Spectral methods for matrices and tensors	2010	Ravindran Kannan
+	Clustering with Spectral Norm and the k-means Algorithm	2010	Amit Kumar Ravindran Kannan
+	Spectral Methods for Matrices and Tensors	2010	Ravindran Kannan
+	Clustering with Spectral Norm and the k-means Algorithm	2010	Amit Kumar Ravindran Kannan
+	Spectral Methods for Matrices and Tensors	2010	Ravindran Kannan
+ PDF Chat	A New Probability Inequality Using Typical Moments and Concentration Results	2009	Ravindran Kannan
+	Two new Probability inequalities and Concentration Results	2008	Ravindran Kannan
+	The Spectral Method for General Mixture Models	2008	Ravindran Kannan Hadi Salmasian Santosh Vempala
+	Clustering algorithms for random and pseudo-random structures	2008	Ravindran Kannan Pradipta Mitra
+	Deterministic and randomized polynomial‐time approximation of radii	2001	Andreas Brieden Peter Gritzmann Ravindran Kannan Victor Klee László Lovász Miklós Simonovits
+	Solution of the Frobenius problem	1989	Ravindran Kannan
+ PDF Chat	Polynomial-Time Aggregation of Integer Programming Problems	1983	Ravindran Kannan
+	A characterization of threshold matroids	1980	Rick Giles Ravindran Kannan
+	Applications of Polynomial Smith Normal form Calculations	1979	Achim Bachem Ravindran Kannan

Common Coauthors

Coauthor	Papers Together
Chiranjib Bhattacharyya	12
Amit Kumar	7
Santosh Vempala	4
David P. Woodruff	3
Avrim Blum	3
Robert Krauthgamer	3
Alexandr Andoni	3
John E. Hopcroft	3
Amirali Abdullah	3
Trapit Bansal	2
Pradipta Mitra	1
Rick Giles	1
Rong Ge	1
Nikhil Srivastava	1
Sanjeev Arora	1
Victor Klee	1
Miklós Simonovits	1
Peter Gritzmann	1
Andreas Brieden	1
Praneeth Kacham	1
Achim Bachem	1
Amit Deshpande	1
Hariharan Narayanan	1
Ankur Moitra	1
Hadi Salmasian	1
László Lovász	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Spectral partitioning of random graphs	2001	Frank McSherry	9
+	On Spectral Learning of Mixtures of Distributions	2005	Dimitris Achlioptas Frank McSherry	9
+	Quick Approximation to Matrices and Applications	1999	Alan Frieze Ravi Kannan	6
+ PDF Chat	A random polynomial-time algorithm for approximating the volume of convex bodies	1991	Martin Dyer Alan Frieze Ravi Kannan	5
+	Perturbation bounds in connection with singular value decomposition	1972	Per-Åke Wedin	5
+ PDF Chat	Clustering with Spectral Norm and the k-Means Algorithm	2010	Amit Kumar Ravindran Kannan	5
+	Some estimates of norms of random matrices	2004	Rafał Latała	5
+ PDF Chat	A New Probability Inequality Using Typical Moments and Concentration Results	2009	Ravindran Kannan	5
+	Learning mixtures of arbitrary gaussians	2001	Sanjeev Arora Ravi Kannan	5
+	Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication	2006	Petros Drineas Ravi Kannan Michael W. Mahoney	5
+ PDF Chat	Learning mixtures of separated nonspherical Gaussians	2005	Sanjeev Arora Ravi Kannan	5
+	A provable SVD-based algorithm for learning topics in dominant admixture corpus	2014	Trapit Bansal Chiranjib Bhattacharyya Ravindran Kannan	5
+	Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix	2006	Petros Drineas Ravi Kannan Michael W. Mahoney	5
+ PDF Chat	Eigenvalues and expanders	1986	Ilan Alon	4
+	Spectral clustering with limited independence	2007	Anirban Dasgupta John E. Hopcroft Ravi Kannan Pradipta Mitra	4
+	Maximum Likelihood from Incomplete Data Via the <i>EM</i> Algorithm	1977	A. P. Dempster N. M. Laird Donald B. Rubin	4
+ PDF Chat	Settling the Polynomial Learnability of Mixtures of Gaussians	2010	Ankur Moitra Gregory Valiant	4
+ PDF Chat	Low rank approximation and regression in input sparsity time	2013	Kenneth L. Clarkson David P. Woodruff	4
+	Smoothed analysis of algorithms	2004	Daniel A. Spielman Shang‐Hua Teng	4
+	A Spectral Algorithm for Latent Dirichlet Allocation	2012	Animashree Anandkumar Dean P. Foster Daniel Hsu Sham M. Kakade Yi-Kai Liu	4
+	Fast monte-carlo algorithms for finding low-rank approximations	2004	Alan Frieze Ravi Kannan Santosh Vempala	4
+	Random Graphs	2001	Béla Bollobás	4
+	The Symmetric Eigenvalue Problem	1998	Beresford Ν. Parlett	3
+	Efficient Bayesian Estimation from Few Samples: Community Detection and Related Problems	2017	Samuel B. Hopkins David Steurer	3
+	Introduction to Mixed Membership Models and Methods	2014	Edoardo M. Airoldi David M. Blei Elena A. Erosheva Stephen E. Fienberg	3
+ PDF Chat	A Newton-like method for solving rank constrained linear matrix inequalities	2006	Robert Orsi Uwe Helmke J.B. Moore	3
+ PDF Chat	Are randomly grown graphs really random?	2001	Duncan S. Callaway John E. Hopcroft Jon Kleinberg M. E. J. Newman Steven H. Strogatz	3
+	Sur la liaison et la division des points d'un ensemble fini	1951	Kazimierz Florek Justyna Łukaszewicz Juljan Perkal Hugo Steinhaus S. Zubrzycki	3
+ PDF Chat	Approximate counting, uniform generation and rapidly mixing Markov chains	1989	Alistair Sinclair Mark Jerrum	3
+ PDF Chat	Computing a Nonnegative Matrix Factorization---Provably	2016	Sanjeev Arora Rong Ge Ravi Kannan Ankur Moitra	3
+	Threshold functions	1987	B. Bollobás Andrew Thomason	3
+ PDF Chat	CUR matrix decompositions for improved data analysis	2009	Michael W. Mahoney Petros Drineas	3
+ PDF Chat	Robust principal component analysis?	2011	Emmanuel J. Candès Xiaodong Li Yi Ma John Wright	3
+	Robust Hierarchical Clustering	2014	Maria-Florina Balcan Yingyu Liang Pramod Gupta	3
+	Advanced mean field methods: theory and practice	2001	Manfred Opper David Saad	3
+ PDF Chat	Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization	2010	Benjamin Recht Maryam Fazel Pablo A. Parrilo	3
+ PDF Chat	Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality	2008	Mohsen Bayati Devavrat Shah Mayank Sharma	3
+ PDF Chat	Emergence of Scaling in Random Networks	1999	Albert‐László Barabási Réka Albert	3
+	None	2007	Remco van der Hofstad Gerard Hooghiemstra Piet Van Mieghem	3
+	Convergence rate of the gradient descent method with dilatation of the space	1973	N. Z. Shor	3
+	Spectral norm of random matrices	2005	Van H. Vu	3
+	AN INTRODUCTION TO HIDDEN MARKOV MODELS AND BAYESIAN NETWORKS	2001	Zoubin Ghahramani	3
+	The transitive closure of a random digraph	1990	Richard M. Karp	3
+ PDF Chat	Sharp thresholds of graph properties, and the $k$-sat problem	1999	Ehud Friedgut appendix by Jean Bourgain	3
+ PDF Chat	Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming	1995	Michel X. Goemans David P. Williamson	3
+	The Spectral Method for General Mixture Models	2008	Ravindran Kannan Hadi Salmasian Santosh Vempala	3
+	The birth of the giant component	1993	Svante Janson Donald E. Knuth Tomasz Łuczak Boris Pittel	3
+	The eigenvalues of random symmetric matrices	1981	Zoltán Füredi János Komlós	3
+	A critical point for random graphs with a given degree sequence	1995	Michael Molloy Bruce Reed	3
+ PDF Chat	The phase transition in random graphs: A simple proof	2012	Michael Krivelevich Benny Sudakov	3