Ravi Kannan
Orcid: 000000018046673XAffiliations:
 Yale University, New Haven, Connecticut, USA
According to our database^{1},
Ravi Kannan
authored at least 124 papers
between 1979 and 2024.
Collaborative distances:
Collaborative distances:
Awards
ACM Fellow
ACM Fellow 2016, "For contributions to the field of theoretical computer science".
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on zbmath.org

on orcid.org

on dnb.info

on cs.yale.edu

on isni.org

on dl.acm.org
On csauthors.net:
Bibliography
2024
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024
2023
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023
2022
Proceedings of the 2022 ACMSIAM Symposium on Discrete Algorithms, 2022
2021
A quasi3D model of the whole lung: airway extension to the tracheobronchial limit using the constrained constructive optimization and alveolar modeling, using a sactrumpet model.
J. Comput. Des. Eng., 2021
CoRR, 2021
Proceedings of the 38th International Conference on Machine Learning, 2021
Proceedings of the 9th International Conference on Learning Representations, 2021
2020
CoRR, 2020
Finding a latent <i>k</i>simplex in <i>O</i>* (<i>k</i> · nnz(data)) time via Subset Smoothing.
Proceedings of the 2020 ACMSIAM Symposium on Discrete Algorithms, 2020
Nearoptimal sample complexity bounds for learning Latent kpolytopes and applications to AdMixtures.
Proceedings of the 37th International Conference on Machine Learning, 2020
2019
CoRR, 2019
2017
Acta Numer., 2017
Proceedings of the 30th Conference on Learning Theory, 2017
2016
SIAM J. Comput., 2016
Recent Advances in Randomized Numerical Linear Algebra (NII Shonan Meeting 201610).
NII Shonan Meet. Rep., 2016
CoRR, 2016
Proceedings of the 33nd International Conference on Machine Learning, 2016
2015
Markets with Production: A Polynomial Time Algorithm and a Reduction to Pure Exchange.
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015
2014
SIGACT News, 2014
A simple randomised algorithm for convex optimisation  Application to twostage stochastic programming.
Math. Program., 2014
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014
Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014
Proceedings of The 27th Conference on Learning Theory, 2014
2013
CoRR, 2013
2012
Random Walks on Polytopes and an Affine Interior Point Method for Linear Programming.
Math. Oper. Res., 2012
Proceedings of the Automata, Languages, and Programming  39th International Colloquium, 2012
2011
SIGARCH Comput. Archit. News, 2011
2010
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010
2009
SIAM J. Comput., 2009
Oper. Res. Lett., 2009
Found. Trends Theor. Comput. Sci., 2009
Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009
Preface  IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2009).
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009
Discovering Global Patterns in Linguistic Networks through Spectral Analysis: A Case Study of the Consonant Inventories.
Proceedings of the EACL 2009, 12th Conference of the European Chapter of the Association for Computational Linguistics, Proceedings of the Conference, Athens, Greece, March 30, 2009
Proceedings of the Approximation, 2009
2008
SIAM J. Comput., 2008
Sampling subproblems of heterogeneous MaxCut problems and approximation algorithms.
Random Struct. Algorithms, 2008
CoRR, 2008
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008
2007
Proceedings of the Eighteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2007
Proceedings of the Eighteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2007
2006
ACM Trans. Database Syst., 2006
Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition.
SIAM J. Comput., 2006
Fast Monte Carlo Algorithms for Matrices II: Computing a LowRank Approximation to a Matrix.
SIAM J. Comput., 2006
SIAM J. Comput., 2006
Electron. Colloquium Comput. Complex., 2006
Comb. Probab. Comput., 2006
Proceedings of the Seventeenth Annual ACMSIAM Symposium on Discrete Algorithms, 2006
Proceedings of the Algorithms, 2006
2005
Tensor decomposition and approximation schemes for constraint satisfaction problems.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005
Sampling Subproblems of Heterogeneous Maxcut Problems and Approximation Algorithms.
Proceedings of the STACS 2005, 2005
2004
Mach. Learn., 2004
J. ACM, 2004
J. ACM, 2004
Electron. Colloquium Comput. Complex., 2004
2003
J. Comput. Syst. Sci., 2003
Proceedings of the Fourteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2003
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003
2002
A deterministic (22/(k+1))<sup>n</sup> algorithm for kSAT based on local search.
Theor. Comput. Sci., 2002
2001
Electron. Colloquium Comput. Complex., 2001
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001
1999
Random Struct. Algorithms, 1999
Electron. J. Comb., 1999
Comb., 1999
Proceedings of the ThirtyFirst Annual ACM Symposium on Theory of Computing, 1999
Proceedings of the Tenth Annual ACMSIAM Symposium on Discrete Algorithms, 1999
1998
Algorithmica, 1998
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998
Proceedings of the Algorithms, 1998
1997
Random walks and an O<sup>*</sup>(n<sup>5</sup>) volume algorithm for convex bodies.
Random Struct. Algorithms, 1997
Random Struct. Algorithms, 1997
Math. Oper. Res., 1997
Learning an Intersection of a Constant Number of Halfspaces over a Uniform Distribution.
J. Comput. Syst. Sci., 1997
Proceedings of the TwentyNinth Annual ACM Symposium on the Theory of Computing, 1997
Simple MarkovChain Algorithms for Generating Bipartite Graphs and Tournaments (Extended Abstract).
Proceedings of the Eighth Annual ACMSIAM Symposium on Discrete Algorithms, 1997
1996
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996
1995
Math. Oper. Res., 1995
Discret. Comput. Geom., 1995
1994
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994
1993
Inf. Comput., June, 1993
A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem.
Comb. Probab. Comput., 1993
Optimal solution and value of parametric integer programs.
Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993
1992
Comb., 1992
Comb., 1992
1991
J. ACM, 1991
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991
1990
Math. Program., 1990
Math. Oper. Res., 1990
Proceedings of the Polyhedral Combinatorics, 1990
1989
SIAM J. Comput., 1989
On Nontrivial Separators for kPage Graphs and Simulations by Nondeterministic OneTape Turing Machines.
J. Comput. Syst. Sci., 1989
Comb., 1989
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1989
1988
SIAM J. Comput., 1988
1987
Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers.
SIAM J. Comput., 1987
Math. Oper. Res., 1987
Proceedings of the Parallel Algorithms and Architectures, 1987
1986
J. ACM, 1986
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1986
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1986
1985
Theor. Comput. Sci., 1985
Inf. Control., 1985
1984
Math. Syst. Theory, 1984
Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984
1983
J. ACM, January, 1983
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983
1982
Inf. Control., 1982
1981
Math. Oper. Res., 1981
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981
1980
J. ACM, 1980
Discret. Math., 1980
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980
1979
Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix.
SIAM J. Comput., 1979