The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ravi Kannan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Martin E. Dyer, Alan M. Frieze, Ravi Kannan
    A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies. [Citation Graph (2, 0)][DBLP]
    J. ACM, 1991, v:38, n:1, pp:1-17 [Journal]
  2. Alan M. Frieze, Ravi Kannan, Santosh Vempala
    Fast Monte-Carlo Algorithms for Finding Low-Rank Approximations. [Citation Graph (1, 0)][DBLP]
    FOCS, 1998, pp:370-378 [Conf]
  3. Anirban Dasgupta, John E. Hopcroft, Ravi Kannan, Pradipta Prometheus Mitra
    Spectral Clustering by Recursive Partitioning. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:256-267 [Conf]
  4. Ravi Kannan, Andreas Nolte
    A Fast Random Greedy Algorithm for the Component Commonality Problem. [Citation Graph (0, 0)][DBLP]
    ESA, 1998, pp:223-234 [Conf]
  5. Avrim Blum, Alan M. Frieze, Ravi Kannan, Santosh Vempala
    A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:330-338 [Conf]
  6. Avrim Blum, Ravi Kannan
    Learning an Intersection of k Halfspaces over a Uniform Distribution [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:312-320 [Conf]
  7. Andreas Brieden, Peter Gritzmann, Ravi Kannan, Victor Klee, László Lovász, Miklós Simonovits
    Approximation of Diameters: Randomization Doesn't Help. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:244-251 [Conf]
  8. Petros Drineas, Ravi Kannan
    Fast Monte-Carlo Algorithms for Approximate Matrix Multiplication. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:452-459 [Conf]
  9. Alan M. Frieze, Mark Jerrum, Ravi Kannan
    Learning Linear Transformations. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:359-368 [Conf]
  10. Alan M. Frieze, Ravi Kannan
    The Regularity Lemma and Approximation Schemes for Dense Problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:12-20 [Conf]
  11. Alan M. Frieze, Ravi Kannan, J. C. Lagarias
    Linear Congruential Generators Do Not Produce Random Sequences [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:480-484 [Conf]
  12. Ravi Kannan
    Markov Chains and Polynomial Time Algorithms [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:656-671 [Conf]
  13. Ravi Kannan, Guangxing Li
    Sampling According to the Multivariate Normal Density. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:204-212 [Conf]
  14. Ravi Kannan, Andreas Nolte
    Local Search in Smooth Convex Sets. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:218-226 [Conf]
  15. Ravi Kannan, Santosh Vempala, Adrian Vetta
    On Clusterings - Good, Bad and Spectral. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:367-377 [Conf]
  16. Ravi Kannan
    Basis Reduction and Evidence for Transcendence of Certain Numbers. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:263-269 [Conf]
  17. Ravi Kannan
    The Frobenius Problem. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1989, pp:242-251 [Conf]
  18. Ravi Kannan, László Lovász
    Covering Minima and Lattice Point Free Convex Bodies. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:193-213 [Conf]
  19. Ravi Kannan
    Optimal solution and value of parametric integer programs. [Citation Graph (0, 0)][DBLP]
    IPCO, 1993, pp:11-21 [Conf]
  20. Ravi Kannan, Michael W. Mahoney, Ravi Montenegro
    Rapid Mixing of Several Markov Chains for a Hard-Core Model. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:663-675 [Conf]
  21. Rex A. Dwyer, Ravi Kannan
    Convex Hull of Randomly Chosen Points from A Polytope. [Citation Graph (0, 0)][DBLP]
    Parallel Algorithms and Architectures, 1987, pp:16-24 [Conf]
  22. David Cheng, Santosh Vempala, Ravi Kannan, Grant Wang
    A divide-and-merge methodology for clustering. [Citation Graph (0, 0)][DBLP]
    PODS, 2005, pp:196-205 [Conf]
  23. Kevin L. Chang, Ravi Kannan
    The space complexity of pass-efficient algorithms for clustering. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:1157-1166 [Conf]
  24. Petros Drineas, Alan M. Frieze, Ravi Kannan, Santosh Vempala, V. Vinay
    Clustering in Large Graphs and Matrices. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:291-299 [Conf]
  25. Petros Drineas, Ravi Kannan
    Pass efficient algorithms for approximating large matrices. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:223-232 [Conf]
  26. Ravi Kannan, Prasad Tetali, Santosh Vempala
    Simple Markov-Chain Algorithms for Generating Bipartite Graphs and Tournaments (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:193-200 [Conf]
  27. Petros Drineas, Ravi Kannan, Michael W. Mahoney
    Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:57-68 [Conf]
  28. Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski
    Random sampling and approximation of MAX-CSP problems. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:232-239 [Conf]
  29. David Applegate, Ravi Kannan
    Sampling and Integration of Near Log-Concave functions [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:156-163 [Conf]
  30. Martin E. Dyer, Alan M. Frieze, Ravi Kannan
    A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:375-381 [Conf]
  31. Zvi Galil, Ravi Kannan, Endre Szemerédi
    On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines [Citation Graph (0, 0)][DBLP]
    STOC, 1986, pp:39-49 [Conf]
  32. Ravi Kannan
    Improved Algorithms for Integer Programming and Related Lattice Problems [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:193-206 [Conf]
  33. Ravi Kannan
    Alternation and the Power of Nondeterminism [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:344-346 [Conf]
  34. Ravi Kannan, Santosh Vempala
    Sampling Lattice Points. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:696-700 [Conf]
  35. László Lovász, Ravi Kannan
    Faster Mixing via Average Conductance. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:282-287 [Conf]
  36. Sanjeev Arora, Ravi Kannan
    Learning mixtures of arbitrary gaussians. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:247-257 [Conf]
  37. Wenceslas Fernandez de la Vega, Marek Karpinski, Ravi Kannan, Santosh Vempala
    Tensor decomposition and approximation schemes for constraint satisfaction problems. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:747-754 [Conf]
  38. Avrim Blum, Alan M. Frieze, Ravi Kannan, Santosh Vempala
    A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:22, n:1/2, pp:35-52 [Journal]
  39. William J. Cook, Mark Hartmann, Ravi Kannan, Colin McDiarmid
    On integer points in polyhedra. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1992, v:12, n:1, pp:27-37 [Journal]
  40. Alan M. Frieze, Ravi Kannan
    Quick Approximation to Matrices and Applications. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1999, v:19, n:2, pp:175-220 [Journal]
  41. Zvi Galil, Ravi Kannan, Endre Szemerédi
    On 3-pushdown graphs with large separators. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1989, v:9, n:1, pp:9-19 [Journal]
  42. Ravi Kannan
    Lattice translates of a polytope and the Frobenius problem. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1992, v:12, n:2, pp:161-177 [Journal]
  43. Alan M. Frieze, Ravi Kannan
    A Simple Algorithm for Constructing Szemere'di's Regularity Partition. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1999, v:6, n:, pp:- [Journal]
  44. 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. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:271-284 [Journal]
  45. Ravi Kannan, László Lovász, Miklós Simonovits
    Isoperimetric Problems for Convex Bodies and a Localization Lemama. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:13, n:, pp:541-559 [Journal]
  46. Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski
    Random Sampling and Approximation of MAX-CSP Problems [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:, n:100, pp:- [Journal]
  47. Ravi Kannan
    Unraveling k-page graphs [Citation Graph (0, 0)][DBLP]
    Information and Control, 1985, v:66, n:1/2, pp:1-5 [Journal]
  48. Ravi Kannan, H. Venkateswaran, V. Vinay, Andrew Chi-Chih Yao
    A Circuit-Based Proof of Toda's Theorem [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:104, n:2, pp:271-276 [Journal]
  49. Alan M. Frieze, Ravi Kannan, Santosh Vempala
    Fast monte-carlo algorithms for finding low-rank approximations. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2004, v:51, n:6, pp:1025-1041 [Journal]
  50. Ravi Kannan, Santosh Vempala, Adrian Vetta
    On clusterings: Good, bad and spectral. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2004, v:51, n:3, pp:497-515 [Journal]
  51. Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski
    Random sampling and approximation of MAX-CSPs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:67, n:2, pp:212-243 [Journal]
  52. Zvi Galil, Ravi Kannan, Endre Szemerédi
    On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1989, v:38, n:1, pp:134-149 [Journal]
  53. Petros Drineas, Alan M. Frieze, Ravi Kannan, Santosh Vempala, V. Vinay
    Clustering Large Graphs via the Singular Value Decomposition. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 2004, v:56, n:1-3, pp:9-33 [Journal]
  54. William J. Cook, Ravi Kannan, Alexander Schrijver
    Chvátal Closures for mixed Integer Programming Problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1990, v:47, n:, pp:155-174 [Journal]
  55. Martin E. Dyer, Ravi Kannan, John Mount
    Sampling contingency tables. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1997, v:10, n:4, pp:487-506 [Journal]
  56. Ravi Kannan, László Lovász, Miklós Simonovits
    Random walks and an O*(n5) volume algorithm for convex bodies. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1997, v:11, n:1, pp:1-50 [Journal]
  57. Ravi Kannan, Prasad Tetali, Santosh Vempala
    Simple Markov-chain algorithms for generating bipartite graphs and tournaments. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1999, v:14, n:4, pp:293-308 [Journal]
  58. Alan M. Frieze, Johan Håstad, Ravi Kannan, J. C. Lagarias, Adi Shamir
    Reconstructing Truncated Integer Variables Satisfying Linear Congruences. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:2, pp:262-280 [Journal]
  59. Merrick L. Furst, Ravi Kannan
    Succinct Certificates for Almost All Subset Sum Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:3, pp:550-558 [Journal]
  60. 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))n algorithm for k-SAT based on local search. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:69-83 [Journal]
  61. David Cheng, Ravi Kannan, Santosh Vempala, Grant Wang
    A divide-and-merge methodology for clustering. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Database Syst., 2006, v:31, n:4, pp:1499-1525 [Journal]
  62. Anirban Dasgupta, John E. Hopcroft, Ravi Kannan, Pradipta Prometheus Mitra
    Spectral clustering with limited independence. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:1036-1045 [Conf]
  63. Ravi Kannan, Thorsten Theobald
    Games of fixed rank: a hierarchy of bimatrix games. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:1124-1132 [Conf]
  64. Petros Drineas, Ravi Kannan, Michael W. Mahoney
    Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:1, pp:158-183 [Journal]
  65. Petros Drineas, Ravi Kannan, Michael W. Mahoney
    Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:1, pp:184-206 [Journal]
  66. Petros Drineas, Ravi Kannan, Michael W. Mahoney
    Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:1, pp:132-157 [Journal]

  67. Adaptive Sampling for k-Means Clustering. [Citation Graph (, )][DBLP]


  68. Discovering Global Patterns in Linguistic Networks through Spectral Analysis: A Case Study of the Consonant Inventories. [Citation Graph (, )][DBLP]


  69. Market Equilibria in Polynomial Time for Fixed Number of Goods or Agents. [Citation Graph (, )][DBLP]


  70. A new approach to the planted clique problem. [Citation Graph (, )][DBLP]


  71. Preface -- IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2009). [Citation Graph (, )][DBLP]


  72. Random walks on polytopes and an affine interior point method for linear programming. [Citation Graph (, )][DBLP]


  73. Finding Dense Subgraphs in G(n, 1/2). [Citation Graph (, )][DBLP]


  74. Games of fixed rank: A hierarchy of bimatrix games [Citation Graph (, )][DBLP]


  75. Finding Dense Subgraphs in G(n,1/2) [Citation Graph (, )][DBLP]


  76. Discovering Global Patterns in Linguistic Networks through Spectral Analysis: A Case Study of the Consonant Inventories [Citation Graph (, )][DBLP]


  77. Blocking Conductance and Mixing in Random Walks. [Citation Graph (, )][DBLP]


  78. Approximation of Global MAX-CSP Problems. [Citation Graph (, )][DBLP]


Search in 0.153secs, Finished in 0.155secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002