Ravindran Kannan

45 papers A* 17Journal 26Unranked 2

Year	Rank	Type	Title / Venue / Authors
2025	A*	`conf`	LevAttention: Time, Space and Streaming Efficient Algorithm for Heavy Attentions. ICLR Ravindran Kannan, Chiranjib Bhattacharyya, Praneeth Kacham, David P. Woodruff
2024	J	`jnl`	LevAttention: Time, Space, and Streaming Efficient Algorithm for Heavy Attentions. CoRR Ravindran Kannan, Chiranjib Bhattacharyya, Praneeth Kacham, David P. Woodruff
2024	A*	`conf`	Random Separating Hyperplane Theorem and Learning Polytopes. ICALP Chiranjib Bhattacharyya, Ravindran Kannan, Amit Kumar
2023	J	`jnl`	Random Separating Hyperplane Theorem and Learning Polytopes. CoRR Chiranjib Bhattacharyya, Ravindran Kannan, Amit Kumar
2022	A*	`conf`	How many Clusters? - An algorithmic answer. SODA Chiranjib Bhattacharyya, Ravindran Kannan, Amit Kumar
2021	J	`jnl`	A quasi-3D model of the whole lung: airway extension to the tracheobronchial limit using the constrained constructive optimization and alveolar modeling, using a sac-trumpet model. J. Comput. Des. Eng. Ravindran Kannan, Narender Singh, Andrzej Przekwas, Xianlian Zhou, Ross Walenga, Andrew Babiskin
2021	A*	`conf`	Finding k in Latent k- polytope. ICML Chiranjib Bhattacharyya, Ravindran Kannan, Amit Kumar
2020	J	`jnl`	Algorithms for finding k in k-means. CoRR Chiranjib Bhattacharyya, Ravindran Kannan, Amit Kumar
2020	A*	`conf`	Finding a latent SODA Chiranjib Bhattacharyya, Ravindran Kannan
2020	A*	`conf`	Near-optimal sample complexity bounds for learning Latent k-polytopes and applications to Ad-Mixtures. ICML Chiranjib Bhattacharyya, Ravindran Kannan
2019	J	`jnl`	Finding a latent k-simplex in O(k . nnz(data)) time via Subset Smoothing. CoRR Chiranjib Bhattacharyya, Ravindran Kannan
2017	J	`jnl`	Randomized algorithms in numerical linear algebra. Acta Numer. Ravindran Kannan, Santosh S. Vempala
2017	A*	`conf`	The Hidden Hubs Problem. COLT Ravindran Kannan, Santosh S. Vempala
2016	A*	`conf`	Non-negative Matrix Factorization under Heavy Noise. ICML Chiranjib Bhattacharyya, Navin Goyal, Ravindran Kannan, Jagdeep Pani
2016	J	`jnl`	Recent Advances in Randomized Numerical Linear Algebra (NII Shonan Meeting 2016-10). NII Shonan Meet. Rep. Ravindran Kannan, Michael W. Mahoney, David P. Woodruff
2014	J	`jnl`	14th Knuth prize: call for nominations. SIGACT News Ravindran Kannan
2014	—	`conf`	A provable SVD-based algorithm for learning topics in dominant admixture corpus. NIPS Trapit Bansal, Chiranjib Bhattacharyya, Ravindran Kannan
2014	J	`jnl`	A provable SVD-based algorithm for learning topics in dominant admixture corpus. CoRR Trapit Bansal, Chiranjib Bhattacharyya, Ravindran Kannan
2014	A*	`conf`	Spectral Approaches to Nearest Neighbor Search. FOCS Amirali Abdullah, Alexandr Andoni, Ravindran Kannan, Robert Krauthgamer
2014	J	`jnl`	Spectral Approaches to Nearest Neighbor Search. CoRR Amirali Abdullah, Alexandr Andoni, Ravindran Kannan, Robert Krauthgamer
2013	J	`jnl`	Nimble Algorithms for Cloud Computing CoRR Ravindran Kannan, Santosh S. Vempala
2012	A*	`conf`	Computing a nonnegative matrix factorization - provably. STOC Sanjeev Arora, Rong Ge, Ravindran Kannan, Ankur Moitra
2012	J	`jnl`	Random Walks on Polytopes and an Affine Interior Point Method for Linear Programming. Math. Oper. Res. Ravindran Kannan, Hariharan Narayanan
2012	—	`conf`	Zero-One Rounding of Singular Vectors. ICALP (1) Amit Deshpande, Ravindran Kannan, Nikhil Srivastava
2010	A*	`conf`	Clustering with Spectral Norm and the k-Means Algorithm. FOCS Amit Kumar, Ravindran Kannan
2010	J	`jnl`	Clustering with Spectral Norm and the k-means Algorithm CoRR Amit Kumar, Ravindran Kannan
2010	J	`jnl`	Spectral Methods for Matrices and Tensors CoRR Ravindran Kannan
2010	A*	`conf`	Spectral methods for matrices and tensors. STOC Ravindran Kannan
2009	A*	`conf`	A New Probability Inequality Using Typical Moments and Concentration Results. FOCS Ravindran Kannan
2008	J	`jnl`	The Spectral Method for General Mixture Models. SIAM J. Comput. Ravindran Kannan, Hadi Salmasian, Santosh S. Vempala
2005	A*	`conf`	The Spectral Method for General Mixture Models. COLT Ravindran Kannan, Hadi Salmasian, Santosh S. Vempala
2004	J	`jnl`	The Spectral Method for Mixture Models Electron. Colloquium Comput. Complex. Hadi Salmasian, Ravindran Kannan, Santosh S. Vempala
1997	J	`jnl`	Learning an Intersection of a Constant Number of Halfspaces over a Uniform Distribution. J. Comput. Syst. Sci. Avrim Blum, Ravindran Kannan
1987	J	`jnl`	Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers. SIAM J. Comput. Ravindran Kannan, Gary L. Miller, Larry Rudolph
1986	J	`jnl`	Polynomial-time algorithm for the orbit problem. J. ACM Ravindran Kannan, Richard J. Lipton
1985	J	`jnl`	Solving Systems of Linear Equations over Polynomials. Theor. Comput. Sci. Ravindran Kannan
1984	A*	`conf`	Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers STOC Ravindran Kannan, Arjen K. Lenstra, László Lovász
1984	A*	`conf`	Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers FOCS Ravindran Kannan, Gary L. Miller, Larry Rudolph
1984	J	`jnl`	Towards Separating Nondeterminism from Determinism. Math. Syst. Theory Ravindran Kannan
1983	J	`jnl`	Polynomial-Time Aggregation of Integer Programming Problems J. ACM Ravindran Kannan
1981	J	`jnl`	Exponential Lower Bounds on a Class of Knapsack Algorithms. Math. Oper. Res. Dirk Hausmann, Ravindran Kannan, Bernhard Korte
1980	J	`jnl`	A Polynomial Algorithm for the Two-Variable Integer Programming Problem. J. ACM Ravindran Kannan
1980	J	`jnl`	A characterization of threshold matroids. Discret. Math. Rick Giles, Ravindran Kannan
1980	A*	`conf`	The Orbit Problem is Decidable STOC Ravindran Kannan, Richard J. Lipton
1979	J	`jnl`	Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix. SIAM J. Comput. Ravindran Kannan, Achim Bachem