Ravi Kannan

Ravindran Kannan, Santosh Vempala: Nimble Algorithms for Cloud Computing. CoRR abs/1304.3162 (2013)

Ravindran Kannan, Hariharan Narayanan: Random Walks on Polytopes and an Affine Interior Point Method for Linear Programming. Math. Oper. Res. 37(1): 1-20 (2012)

Amit Deshpande, Ravindran Kannan, Nikhil Srivastava: Zero-One Rounding of Singular Vectors. ICALP (1) 2012: 278-289

Sanjeev Arora, Rong Ge, Ravindran Kannan, Ankur Moitra: Computing a nonnegative matrix factorization - provably. STOC 2012: 145-162

Ravi Kannan: Algorithms: Recent Highlights and Challenges. SIGARCH Computer Architecture News 39(3) (2011)

Sanjeev Arora, Rong Ge, Ravi Kannan, Ankur Moitra: Computing a Nonnegative Matrix Factorization -- Provably. CoRR abs/1111.0952 (2011)

Amit Kumar, Ravindran Kannan: Clustering with Spectral Norm and the k-Means Algorithm. FOCS 2010: 299-308

Ravindran Kannan: Spectral methods for matrices and tensors. STOC 2010: 1-12

Ravindran Kannan: Spectral Methods for Matrices and Tensors. CoRR abs/1004.1253 (2010)

Amit Kumar, Ravindran Kannan: Clustering with Spectral Norm and the k-means Algorithm. CoRR abs/1004.1823 (2010)

Ravi Kannan, Santosh Vempala: Spectral Algorithms. Foundations and Trends in Theoretical Computer Science 4(3-4): 157-288 (2009)

Ravi Kannan, Luis Rademacher: Optimization of a convex program with a polynomial perturbation. Oper. Res. Lett. 37(6): 384-386 (2009)

Kevin L. Chang, Ravi Kannan: Pass-Efficient Algorithms for Learning Mixtures of Uniform Distributions. SIAM J. Comput. 39(3): 783-812 (2009)

Ankit Aggarwal, Amit Deshpande, Ravi Kannan: Adaptive Sampling for k-Means Clustering. APPROX-RANDOM 2009: 15-28

Animesh Mukherjee, Monojit Choudhury, Ravi Kannan: Discovering Global Patterns in Linguistic Networks through Spectral Analysis: A Case Study of the Consonant Inventories. EACL 2009: 585-593

Ravindran Kannan: A New Probability Inequality Using Typical Moments and Concentration Results. FOCS 2009: 211-220

Ravi Kannan, K. Narayan Kumar: Preface -- IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2009). FSTTCS 2009

Ravi Kannan, Hariharan Narayanan: Random walks on polytopes and an affine interior point method for linear programming. STOC 2009: 561-570

Atish Das Sarma, Amit Deshpande, Ravi Kannan: Finding Dense Subgraphs in G(n, 1/2). WAOA 2009: 98-103

Ravi Kannan, K. Narayan Kumar (Eds.): IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2009, December 15-17, 2009, IIT Kanpur, India. LIPIcs 4, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2009, isbn 978-3-939897-13-2

Animesh Mukherjee, Monojit Choudhury, Ravi Kannan: Discovering Global Patterns in Linguistic Networks through Spectral Analysis: A Case Study of the Consonant Inventories. CoRR abs/0901.2216 (2009)

Petros Drineas, Ravi Kannan, Michael W. Mahoney: Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms. Random Struct. Algorithms 32(3): 307-333 (2008)

Ravindran Kannan, Hadi Salmasian, Santosh Vempala: The Spectral Method for General Mixture Models. SIAM J. Comput. 38(3): 1141-1156 (2008)

Nikhil R. Devanur, Ravi Kannan: Market Equilibria in Polynomial Time for Fixed Number of Goods or Agents. FOCS 2008: 45-53

Alan M. Frieze, Ravi Kannan: A new approach to the planted clique problem. FSTTCS 2008: 187-198

Atish Das Sarma, Amit Deshpande, Ravi Kannan: Finding Dense Subgraphs in G(n,1/2). CoRR abs/0807.5111 (2008)

Anirban Dasgupta, John E. Hopcroft, Ravi Kannan, Pradipta Prometheus Mitra: Spectral clustering with limited independence. SODA 2007: 1036-1045

Ravi Kannan, Thorsten Theobald: Games of fixed rank: a hierarchy of bimatrix games. SODA 2007: 1124-1132

Ravi Kannan, László Lovász, Ravi Montenegro: Blocking Conductance and Mixing in Random Walks. Combinatorics, Probability & Computing 15(4): 541-570 (2006)

Petros Drineas, Ravi Kannan, Michael W. Mahoney: Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication. SIAM J. Comput. 36(1): 132-157 (2006)

Petros Drineas, Ravi Kannan, Michael W. Mahoney: Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix. SIAM J. Comput. 36(1): 158-183 (2006)

Petros Drineas, Ravi Kannan, Michael W. Mahoney: Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition. SIAM J. Comput. 36(1): 184-206 (2006)

David Cheng, Ravi Kannan, Santosh Vempala, Grant Wang: A divide-and-merge methodology for clustering. ACM Trans. Database Syst. 31(4): 1499-1525 (2006)

Anirban Dasgupta, John E. Hopcroft, Ravi Kannan, Pradipta Prometheus Mitra: Spectral Clustering by Recursive Partitioning. ESA 2006: 256-267

Kevin L. Chang, Ravi Kannan: The space complexity of pass-efficient algorithms for clustering. SODA 2006: 1157-1166

Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski: Approximation of Global MAX-CSP Problems. Electronic Colloquium on Computational Complexity (ECCC) 13(124) (2006)

Ravindran Kannan, Hadi Salmasian, Santosh Vempala: The Spectral Method for General Mixture Models. COLT 2005: 444-457

David Cheng, Santosh Vempala, Ravi Kannan, Grant Wang: A divide-and-merge methodology for clustering. PODS 2005: 196-205

Petros Drineas, Ravi Kannan, Michael W. Mahoney: Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms. STACS 2005: 57-68

Wenceslas Fernandez de la Vega, Marek Karpinski, Ravi Kannan, Santosh Vempala: Tensor decomposition and approximation schemes for constraint satisfaction problems. STOC 2005: 747-754

Ravi Kannan, Thorsten Theobald: Games of fixed rank: A hierarchy of bimatrix games. CoRR abs/cs/0511021 (2005)

Ravi Kannan, Santosh Vempala, Adrian Vetta: On clusterings: Good, bad and spectral. J. ACM 51(3): 497-515 (2004)

Alan M. Frieze, Ravi Kannan, Santosh Vempala: Fast monte-carlo algorithms for finding low-rank approximations. J. ACM 51(6): 1025-1041 (2004)

Petros Drineas, Alan M. Frieze, Ravi Kannan, Santosh Vempala, V. Vinay: Clustering Large Graphs via the Singular Value Decomposition. Machine Learning 56(1-3): 9-33 (2004)

Hadi Salmasian, Ravindran Kannan, Santosh Vempala: The Spectral Method for Mixture Models. Electronic Colloquium on Computational Complexity (ECCC)(067) (2004)

Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski: Random sampling and approximation of MAX-CSPs. J. Comput. Syst. Sci. 67(2): 212-243 (2003)

Ravi Kannan, Michael W. Mahoney, Ravi Montenegro: Rapid Mixing of Several Markov Chains for a Hard-Core Model. ISAAC 2003: 663-675

Petros Drineas, Ravi Kannan: Pass efficient algorithms for approximating large matrices. SODA 2003: 223-232

Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Ravi Kannan, Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan, Uwe Schöning: A deterministic (2-2/(k+1))ⁿ algorithm for k-SAT based on local search. Theor. Comput. Sci. 289(1): 69-83 (2002)

Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski: Random sampling and approximation of MAX-CSP problems. STOC 2002: 232-239

Petros Drineas, Ravi Kannan: Fast Monte-Carlo Algorithms for Approximate Matrix Multiplication. FOCS 2001: 452-459

Sanjeev Arora, Ravi Kannan: Learning mixtures of arbitrary gaussians. STOC 2001: 247-257

Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski: Random Sampling and Approximation of MAX-CSP Problems. Electronic Colloquium on Computational Complexity (ECCC)(100) (2001)

Ravi Kannan, Santosh Vempala, Adrian Vetta: On Clusterings - Good, Bad and Spectral. FOCS 2000: 367-377

Alan M. Frieze, Ravi Kannan: Quick Approximation to Matrices and Applications. Combinatorica 19(2): 175-220 (1999)

Alan M. Frieze, Ravi Kannan: A Simple Algorithm for Constructing Szemere'di's Regularity Partition. Electr. J. Comb. 6 (1999)

Ravi Kannan, Prasad Tetali, Santosh Vempala: Simple Markov-chain algorithms for generating bipartite graphs and tournaments. Random Struct. Algorithms 14(4): 293-308 (1999)

Petros Drineas, Alan M. Frieze, Ravi Kannan, Santosh Vempala, V. Vinay: Clustering in Large Graphs and Matrices. SODA 1999: 291-299

László Lovász, Ravi Kannan: Faster Mixing via Average Conductance. STOC 1999: 282-287

Avrim Blum, Alan M. Frieze, Ravi Kannan, Santosh Vempala: A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions. Algorithmica 22(1/2): 35-52 (1998)

Ravi Kannan, Andreas Nolte: A Fast Random Greedy Algorithm for the Component Commonality Problem. ESA 1998: 223-234

Ravi Kannan, Andreas Nolte: Local Search in Smooth Convex Sets. FOCS 1998: 218-226

Andreas Brieden, Peter Gritzmann, Ravi Kannan, Victor Klee, László Lovász, Miklós Simonovits: Approximation of Diameters: Randomization Doesn't Help. FOCS 1998: 244-251

Alan M. Frieze, Ravi Kannan, Santosh Vempala: Fast Monte-Carlo Algorithms for Finding Low-Rank Approximations. FOCS 1998: 370-378

Avrim Blum, Ravindran Kannan: Learning an Intersection of a Constant Number of Halfspaces over a Uniform Distribution. J. Comput. Syst. Sci. 54(2): 371-380 (1997)

Martin E. Dyer, Ravi Kannan, John Mount: Sampling contingency tables. Random Struct. Algorithms 10(4): 487-506 (1997)

Ravi Kannan, László Lovász, Miklós Simonovits: Random walks and an O^*(n⁵) volume algorithm for convex bodies. Random Struct. Algorithms 11(1): 1-50 (1997)

Ravi Kannan, Prasad Tetali, Santosh Vempala: Simple Markov-Chain Algorithms for Generating Bipartite Graphs and Tournaments (Extended Abstract). SODA 1997: 193-200

Ravi Kannan, Santosh Vempala: Sampling Lattice Points. STOC 1997: 696-700

Alan M. Frieze, Ravi Kannan: The Regularity Lemma and Approximation Schemes for Dense Problems. FOCS 1996: 12-20

Ravi Kannan, Guangxing Li: Sampling According to the Multivariate Normal Density. FOCS 1996: 204-212

Avrim Blum, Alan M. Frieze, Ravi Kannan, Santosh Vempala: A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions. FOCS 1996: 330-338

Alan M. Frieze, Mark Jerrum, Ravi Kannan: Learning Linear Transformations. FOCS 1996: 359-368

Ravi Kannan, László Lovász, Miklós Simonovits: Isoperimetric Problems for Convex Bodies and a Localization Lemama. Discrete & Computational Geometry 13: 541-559 (1995)

Ravi Kannan: Markov Chains and Polynomial Time Algorithms. FOCS 1994: 656-671

Martin E. Dyer, Alan M. Frieze, Ravi Kannan, Ajai Kapoor, Ljubomir Perkovic, Umesh V. Vazirani: A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem. Combinatorics, Probability & Computing 2: 271-284 (1993)

Ravi Kannan, H. Venkateswaran, V. Vinay, Andrew Chi-Chih Yao: A Circuit-Based Proof of Toda's Theorem. Inf. Comput. 104(2): 271-276 (1993)

Avrim Blum, Ravi Kannan: Learning an Intersection of k Halfspaces over a Uniform Distribution. FOCS 1993: 312-320

Ravi Kannan: Optimal solution and value of parametric integer programs. IPCO 1993: 11-21

William J. Cook, Mark Hartmann, Ravi Kannan, Colin McDiarmid: On integer points in polyhedra. Combinatorica 12(1): 27-37 (1992)

Ravi Kannan: Lattice translates of a polytope and the Frobenius problem. Combinatorica 12(2): 161-177 (1992)

Egon Balas, Gérard Cornuéjols, Ravi Kannan (Eds.): Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, Pittsburgh, PA, May 1992. Carnegie Mellon University 1992

Martin E. Dyer, Alan M. Frieze, Ravi Kannan: A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies. J. ACM 38(1): 1-17 (1991)

David Applegate, Ravi Kannan: Sampling and Integration of Near Log-Concave functions. STOC 1991: 156-163

William J. Cook, Ravi Kannan, Alexander Schrijver: Chvátal Closures for mixed Integer Programming Problems. Math. Program. 47: 155-174 (1990)

Ravi Kannan, William R. Pulleyblank (Eds.): Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, Waterloo, Ontorio, Canada, May 28-30 1990. University of Waterloo Press 1990, isbn 0-88898-099-X

Zvi Galil, Ravi Kannan, Endre Szemerédi: On 3-pushdown graphs with large separators. Combinatorica 9(1): 9-19 (1989)

Zvi Galil, Ravi Kannan, Endre Szemerédi: On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines. J. Comput. Syst. Sci. 38(1): 134-149 (1989)

Merrick L. Furst, Ravi Kannan: Succinct Certificates for Almost All Subset Sum Problems. SIAM J. Comput. 18(3): 550-558 (1989)

Ravi Kannan: The Frobenius Problem. FSTTCS 1989: 242-251

Martin E. Dyer, Alan M. Frieze, Ravi Kannan: A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies. STOC 1989: 375-381

Alan M. Frieze, Johan Håstad, Ravi Kannan, J. C. Lagarias, Adi Shamir: Reconstructing Truncated Integer Variables Satisfying Linear Congruences. SIAM J. Comput. 17(2): 262-280 (1988)

Ravindran Kannan, Gary L. Miller, Larry Rudolph: Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers. SIAM J. Comput. 16(1): 7-16 (1987)

Rex A. Dwyer, Ravi Kannan: Convex Hull of Randomly Chosen Points from A Polytope. Parallel Algorithms and Architectures 1987: 16-24

Ravindran Kannan, Richard J. Lipton: Polynomial-time algorithm for the orbit problem. J. ACM 33(4): 808-821 (1986)

Ravi Kannan, László Lovász: Covering Minima and Lattice Point Free Convex Bodies. FSTTCS 1986: 193-213

Ravi Kannan: Basis Reduction and Evidence for Transcendence of Certain Numbers. FSTTCS 1986: 263-269

Zvi Galil, Ravi Kannan, Endre Szemerédi: On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines. STOC 1986: 39-49

Ravi Kannan: Unraveling k-page graphs. Information and Control 66(1/2): 1-5 (1985)

Ravindran Kannan: Solving Systems of Linear Equations over Polynomials. Theor. Comput. Sci. 39: 69-88 (1985)

Ravindran Kannan: Towards Separating Nondeterminism from Determinism. Mathematical Systems Theory 17(1): 29-45 (1984)

Ravindran Kannan, Gary L. Miller, Larry Rudolph: Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers. FOCS 1984: 7-11

Alan M. Frieze, Ravi Kannan, J. C. Lagarias: Linear Congruential Generators Do Not Produce Random Sequences. FOCS 1984: 480-484

Ravindran Kannan, Arjen K. Lenstra, László Lovász: Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers. STOC 1984: 191-200

Ravindran Kannan: Polynomial-Time Aggregation of Integer Programming Problems. J. ACM 30(1): 133-145 (1983)

Ravi Kannan: Improved Algorithms for Integer Programming and Related Lattice Problems. STOC 1983: 193-206

Ravi Kannan: Alternation and the Power of Nondeterminism. STOC 1983: 344-346

Ravi Kannan: Circuit-Size Lower Bounds and Non-Reducibility to Sparse Sets. Information and Control 55(1-3): 40-56 (1982)

Ravi Kannan: Towards Separating Nondeterministic Time from Deterministic Time. FOCS 1981: 235-243

Ravi Kannan: A Circuit-Size Lower Bound. FOCS 1981: 304-309

Ravindran Kannan: A Polynomial Algorithm for the Two-Variable Integer Programming Problem. J. ACM 27(1): 118-122 (1980)

Ravindran Kannan, Richard J. Lipton: The Orbit Problem is Decidable. STOC 1980: 252-261

Ravindran Kannan, Achim Bachem: Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix. SIAM J. Comput. 8(4): 499-507 (1979)