Ravi Kannan - RankMe

105 papers A* 36A 5B 5Journal 50Unranked 8

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Aspects of a randomly growing cluster in R d , d ≥ 2. Discret. Appl. Math. Alan M. Frieze, Ravi Kannan, Wesley Pegden
2023	A	`conf`	Bit Complexity of Jordan Normal Form and Polynomial Spectral Factorization. ITCS Papri Dey, Ravi Kannan, Nick Ryder, Nikhil Srivastava
2021	J	`jnl`	Bit Complexity of Jordan Normal Form and Spectral Factorization. CoRR Papri Dey, Ravi Kannan, Nick Ryder, Nikhil Srivastava
2021	A*	`conf`	Learning a Latent Simplex in Input Sparsity Time. ICLR Ainesh Bakshi, Chiranjib Bhattacharyya, Ravi Kannan, David P. Woodruff, Samson Zhou
2021	J	`jnl`	Learning a Latent Simplex in Input-Sparsity Time. CoRR Ainesh Bakshi, Chiranjib Bhattacharyya, Ravi Kannan, David P. Woodruff, Samson Zhou
2016	J	`jnl`	Beyond Spectral: Tight Bounds for Planted Gaussians. CoRR Ravi Kannan, Santosh S. Vempala
2016	J	`jnl`	Computing a Nonnegative Matrix Factorization - Provably. SIAM J. Comput. Sanjeev Arora, Rong Ge, Ravi Kannan, Ankur Moitra
2015	A*	`conf`	Markets with Production: A Polynomial Time Algorithm and a Reduction to Pure Exchange. EC Jugal Garg, Ravi Kannan
2014	J	`jnl`	A simple randomised algorithm for convex optimisation - Application to two-stage stochastic programming. Math. Program. Martin E. Dyer, Ravi Kannan, Leen Stougie
2014	A*	`conf`	Principal Component Analysis and Higher Correlations for Distributed Data. COLT Ravi Kannan, Santosh S. Vempala, David P. Woodruff
2011	J	`jnl`	Algorithms: Recent Highlights and Challenges. SIGARCH Comput. Archit. News Ravi Kannan
2011	J	`jnl`	Computing a Nonnegative Matrix Factorization -- Provably CoRR Sanjeev Arora, Rong Ge, Ravi Kannan, Ankur Moitra
2009	—	`conf`	Adaptive Sampling for k-Means Clustering. APPROX-RANDOM Ankit Aggarwal, Amit Deshpande, Ravi Kannan
2009	J	`jnl`	Discovering Global Patterns in Linguistic Networks through Spectral Analysis: A Case Study of the Consonant Inventories CoRR Animesh Mukherjee, Monojit Choudhury, Ravi Kannan
2009	A	`conf`	Discovering Global Patterns in Linguistic Networks through Spectral Analysis: A Case Study of the Consonant Inventories. EACL Animesh Mukherjee, Monojit Choudhury, Ravi Kannan
2009	B	`conf`	Finding Dense Subgraphs in WAOA Atish Das Sarma, Amit Deshpande, Ravi Kannan
2009	—	`ed.`	IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2009, IIT Kanpur, India, December 15-17, 2009 FSTTCS Ravi Kannan, K. Narayan Kumar
2009	J	`jnl`	Optimization of a convex program with a polynomial perturbation. Oper. Res. Lett. Ravi Kannan, Luis Rademacher
2009	J	`jnl`	Pass-Efficient Algorithms for Learning Mixtures of Uniform Distributions. SIAM J. Comput. Kevin L. Chang, Ravi Kannan
2009	—	`conf`	Preface -- IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2009). FSTTCS Ravi Kannan, K. Narayan Kumar
2009	A*	`conf`	Random walks on polytopes and an affine interior point method for linear programming. STOC Ravi Kannan, Hariharan Narayanan
2009	J	`jnl`	Spectral Algorithms. Found. Trends Theor. Comput. Sci. Ravi Kannan, Santosh S. Vempala
2008	—	`conf`	A new approach to the planted clique problem. FSTTCS Alan M. Frieze, Ravi Kannan
2008	J	`jnl`	Finding Dense Subgraphs in G(n,1/2) CoRR Atish Das Sarma, Amit Deshpande, Ravi Kannan
2008	A*	`conf`	Market Equilibria in Polynomial Time for Fixed Number of Goods or Agents. FOCS Nikhil R. Devanur, Ravi Kannan
2008	J	`jnl`	Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms. Random Struct. Algorithms Petros Drineas, Ravi Kannan, Michael W. Mahoney
2007	A*	`conf`	Games of fixed rank: a hierarchy of bimatrix games. SODA Ravi Kannan, Thorsten Theobald
2007	A*	`conf`	Spectral clustering with limited independence. SODA Anirban Dasgupta, John E. Hopcroft, Ravi Kannan, Pradipta Prometheus Mitra
2006	J	`jnl`	A divide-and-merge methodology for clustering. ACM Trans. Database Syst. David Cheng, Ravi Kannan, Santosh S. Vempala, Grant Wang
2006	J	`jnl`	Approximation of Global MAX-CSP Problems. Electron. Colloquium Comput. Complex. Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski
2006	J	`jnl`	Blocking Conductance and Mixing in Random Walks. Comb. Probab. Comput. Ravi Kannan, László Lovász, Ravi Montenegro
2006	J	`jnl`	Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication. SIAM J. Comput. Petros Drineas, Ravi Kannan, Michael W. Mahoney
2006	J	`jnl`	Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix. SIAM J. Comput. Petros Drineas, Ravi Kannan, Michael W. Mahoney
2006	J	`jnl`	Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition. SIAM J. Comput. Petros Drineas, Ravi Kannan, Michael W. Mahoney
2006	A	`conf`	Spectral Clustering by Recursive Partitioning. ESA Anirban Dasgupta, John E. Hopcroft, Ravi Kannan, Pradipta Prometheus Mitra
2006	A*	`conf`	The space complexity of pass-efficient algorithms for clustering. SODA Kevin L. Chang, Ravi Kannan
2005	A*	`conf`	A divide-and-merge methodology for clustering. PODS David Cheng, Santosh S. Vempala, Ravi Kannan, Grant Wang
2005	J	`jnl`	Games of fixed rank: A hierarchy of bimatrix games CoRR Ravi Kannan, Thorsten Theobald
2005	A	`conf`	Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms. STACS Petros Drineas, Ravi Kannan, Michael W. Mahoney
2005	A*	`conf`	Tensor decomposition and approximation schemes for constraint satisfaction problems. STOC Wenceslas Fernandez de la Vega, Marek Karpinski, Ravi Kannan, Santosh S. Vempala
2004	J	`jnl`	Clustering Large Graphs via the Singular Value Decomposition. Mach. Learn. Petros Drineas, Alan M. Frieze, Ravi Kannan, Santosh S. Vempala, V. Vinay
2004	J	`jnl`	Fast monte-carlo algorithms for finding low-rank approximations. J. ACM Alan M. Frieze, Ravi Kannan, Santosh S. Vempala
2004	J	`jnl`	On clusterings: Good, bad and spectral. J. ACM Ravi Kannan, Santosh S. Vempala, Adrian Vetta
2003	A*	`conf`	Pass efficient algorithms for approximating large matrices. SODA Petros Drineas, Ravi Kannan
2003	J	`jnl`	Random sampling and approximation of MAX-CSPs. J. Comput. Syst. Sci. Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski
2003	B	`conf`	Rapid Mixing of Several Markov Chains for a Hard-Core Model. ISAAC Ravi Kannan, Michael W. Mahoney, Ravi Montenegro
2002	J	`jnl`	A deterministic (2-2/(k+1)) Theor. Comput. Sci. Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Ravi Kannan, Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan, Uwe Schöning
2002	A*	`conf`	Random sampling and approximation of MAX-CSP problems. STOC Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski
2001	A*	`conf`	Fast Monte-Carlo Algorithms for Approximate Matrix Multiplication. FOCS Petros Drineas, Ravi Kannan
2001	A*	`conf`	Learning mixtures of arbitrary gaussians. STOC Sanjeev Arora, Ravi Kannan
2001	J	`jnl`	Random Sampling and Approximation of MAX-CSP Problems Electron. Colloquium Comput. Complex. Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski
2000	A*	`conf`	On Clusterings - Good, Bad and Spectral. FOCS Ravi Kannan, Santosh S. Vempala, Adrian Vetta
1999	J	`jnl`	A Simple Algorithm for Constructing Szemere'di's Regularity Partition. Electron. J. Comb. Alan M. Frieze, Ravi Kannan
1999	A*	`conf`	Clustering in Large Graphs and Matrices. SODA Petros Drineas, Alan M. Frieze, Ravi Kannan, Santosh S. Vempala, V. Vinay
1999	A*	`conf`	Faster Mixing via Average Conductance. STOC László Lovász, Ravi Kannan
1999	J	`jnl`	Quick Approximation to Matrices and Applications. Comb. Alan M. Frieze, Ravi Kannan
1999	J	`jnl`	Simple Markov-chain algorithms for generating bipartite graphs and tournaments. Random Struct. Algorithms Ravi Kannan, Prasad Tetali, Santosh S. Vempala
1998	A	`conf`	A Fast Random Greedy Algorithm for the Component Commonality Problem. ESA Ravi Kannan, Andreas Nolte
1998	J	`jnl`	A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions. Algorithmica Avrim Blum, Alan M. Frieze, Ravi Kannan, Santosh S. Vempala
1998	A*	`conf`	Approximation of Diameters: Randomization Doesn't Help. FOCS Andreas Brieden, Peter Gritzmann, Ravi Kannan, Victor Klee, László Lovász, Miklós Simonovits
1998	A*	`conf`	Fast Monte-Carlo Algorithms for Finding Low-Rank Approximations. FOCS Alan M. Frieze, Ravi Kannan, Santosh S. Vempala
1998	A*	`conf`	Local Search in Smooth Convex Sets. FOCS Ravi Kannan, Andreas Nolte
1997	J	`jnl`	On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension. Math. Oper. Res. Martin E. Dyer, Ravi Kannan
1997	J	`jnl`	Random walks and an O Random Struct. Algorithms Ravi Kannan, László Lovász, Miklós Simonovits
1997	A*	`conf`	Sampling Lattice Points. STOC Ravi Kannan, Santosh S. Vempala
1997	J	`jnl`	Sampling contingency tables. Random Struct. Algorithms Martin E. Dyer, Ravi Kannan, John Mount
1997	A*	`conf`	Simple Markov-Chain Algorithms for Generating Bipartite Graphs and Tournaments (Extended Abstract). SODA Ravi Kannan, Prasad Tetali, Santosh S. Vempala
1996	A*	`conf`	A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions. FOCS Avrim Blum, Alan M. Frieze, Ravi Kannan, Santosh S. Vempala
1996	A*	`conf`	Learning Linear Transformations. FOCS Alan M. Frieze, Mark Jerrum, Ravi Kannan
1996	A*	`conf`	Sampling According to the Multivariate Normal Density. FOCS Ravi Kannan, Guangxing Li
1996	A*	`conf`	The Regularity Lemma and Approximation Schemes for Dense Problems. FOCS Alan M. Frieze, Ravi Kannan
1995	J	`jnl`	A Randomized Algorithm to Optimize Over Certain Convex Sets. Math. Oper. Res. Ravi Kannan, John Mount, Sridhar R. Tayur
1995	J	`jnl`	Isoperimetric Problems for Convex Bodies and a Localization Lemama. Discret. Comput. Geom. Ravi Kannan, László Lovász, Miklós Simonovits
1994	A*	`conf`	Markov Chains and Polynomial Time Algorithms FOCS Ravi Kannan
1993	J	`jnl`	A Circuit-Based Proof of Toda's Theorem Inf. Comput. Ravi Kannan, H. Venkateswaran, V. Vinay, Andrew Chi-Chih Yao
1993	J	`jnl`	A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem. Comb. Probab. Comput. Martin E. Dyer, Alan M. Frieze, Ravi Kannan, Ajai Kapoor, Ljubomir Perkovic, Umesh V. Vazirani
1993	A*	`conf`	Learning an Intersection of k Halfspaces over a Uniform Distribution FOCS Avrim Blum, Ravi Kannan
1993	B	`conf`	Optimal solution and value of parametric integer programs. IPCO Ravi Kannan
1992	J	`jnl`	Lattice translates of a polytope and the Frobenius problem. Comb. Ravi Kannan
1992	J	`jnl`	On integer points in polyhedra. Comb. William J. Cook, Mark Hartmann, Ravi Kannan, Colin McDiarmid
1992	B	`ed.`	Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, Pittsburgh, PA, USA, May 1992 IPCO Egon Balas, Gérard Cornuéjols, Ravi Kannan
1991	J	`jnl`	A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies. J. ACM Martin E. Dyer, Alan M. Frieze, Ravi Kannan
1991	A*	`conf`	Sampling and Integration of Near Log-Concave functions STOC David L. Applegate, Ravi Kannan
1990	J	`jnl`	Chvátal Closures for mixed Integer Programming Problems. Math. Program. William J. Cook, Ravi Kannan, Alexander Schrijver
1990	B	`ed.`	Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, Waterloo, Ontorio, Canada, May 28-30 1990 IPCO Ravi Kannan, William R. Pulleyblank
1990	—	`conf`	Test Sets for Integer Programs, 0_ Sentences. Polyhedral Combinatorics Ravi Kannan
1990	J	`jnl`	The Shapes of Polyhedra. Math. Oper. Res. Ravi Kannan, László Lovász, Herbert E. Scarf
1989	A*	`conf`	A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies STOC Martin E. Dyer, Alan M. Frieze, Ravi Kannan
1989	J	`jnl`	On 3-pushdown graphs with large separators. Comb. Zvi Galil, Ravi Kannan, Endre Szemerédi
1989	J	`jnl`	On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines. J. Comput. Syst. Sci. Zvi Galil, Ravi Kannan, Endre Szemerédi
1989	J	`jnl`	Succinct Certificates for Almost All Subset Sum Problems. SIAM J. Comput. Merrick L. Furst, Ravi Kannan
1989	—	`conf`	The Frobenius Problem. FSTTCS Ravi Kannan
1988	J	`jnl`	Reconstructing Truncated Integer Variables Satisfying Linear Congruences. SIAM J. Comput. Alan M. Frieze, Johan Håstad, Ravi Kannan, J. C. Lagarias, Adi Shamir
1987	—	`conf`	Convex Hull of Randomly Chosen Points from A Polytope. Parallel Algorithms and Architectures Rex A. Dwyer, Ravi Kannan
1987	J	`jnl`	Minkowski's Convex Body Theorem and Integer Programming. Math. Oper. Res. Ravi Kannan
1986	—	`conf`	Basis Reduction and Evidence for Transcendence of Certain Numbers. FSTTCS Ravi Kannan
1986	—	`conf`	Covering Minima and Lattice Point Free Convex Bodies. FSTTCS Ravi Kannan, László Lovász
1986	A*	`conf`	On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines STOC Zvi Galil, Ravi Kannan, Endre Szemerédi
1985	J	`jnl`	Unraveling k-page graphs Inf. Control. Ravi Kannan
1984	A*	`conf`	Linear Congruential Generators Do Not Produce Random Sequences FOCS Alan M. Frieze, Ravi Kannan, J. C. Lagarias
1983	A*	`conf`	Alternation and the Power of Nondeterminism STOC Ravi Kannan
1983	A*	`conf`	Improved Algorithms for Integer Programming and Related Lattice Problems STOC Ravi Kannan
1982	J	`jnl`	Circuit-Size Lower Bounds and Non-Reducibility to Sparse Sets Inf. Control. Ravi Kannan
1981	A*	`conf`	A Circuit-Size Lower Bound FOCS Ravi Kannan
1981	A*	`conf`	Towards Separating Nondeterministic Time from Deterministic Time FOCS Ravi Kannan