R. Kannan

From MaRDI portal
Person:1356891

Available identifiers

zbMath Open kannan.ravi.1WikidataQ93034 ScholiaQ93034MaRDI QIDQ1356891

List of research outcomes





PublicationDate of PublicationType
Bit complexity of Jordan normal form and polynomial spectral factorization2024-09-25Paper
How many clusters? -- An algorithmic answer2024-07-19Paper
Foundations of data science2021-06-23Paper
Finding a latent k–simplex in O* (k · nnz(data)) time via Subset Smoothing2021-02-02Paper
Randomized algorithms in numerical linear algebra2017-11-17Paper
Faster mixing via average conductance2016-09-29Paper
Computing a nonnegative matrix factorization -- provably2016-09-02Paper
Polynomial-time algorithm for the orbit problem2016-01-04Paper
https://portal.mardi4nfdi.de/entity/Q55017962015-08-14Paper
Learning mixtures of arbitrary gaussians2015-02-27Paper
Random walks on polytopes and an affine interior point method for linear programming2015-02-04Paper
Games of fixed rank: a hierarchy of bimatrix games2014-12-18Paper
https://portal.mardi4nfdi.de/entity/Q29346972014-12-18Paper
A simple randomised algorithm for convex optimisation2014-10-17Paper
Spectral methods for matrices and tensors2014-08-13Paper
A New Probability Inequality Using Typical Moments and Concentration Results2014-07-25Paper
Computing a nonnegative matrix factorization -- provably2014-05-13Paper
Zero-One Rounding of Singular Vectors2013-08-12Paper
https://portal.mardi4nfdi.de/entity/Q31659582012-10-19Paper
Random walks on polytopes and an affine interior point method for linear programming2012-05-24Paper
On clusterings: good, bad and spectral2010-08-17Paper
Tensor decomposition and approximation schemes for constraint satisfaction problems2010-08-16Paper
The space complexity of pass-efficient algorithms for clustering2010-08-16Paper
Random sampling and approximation of MAX-CSP problems2010-08-05Paper
Pass-efficient algorithms for learning mixtures of uniform distributions2010-07-07Paper
Finding dense subgraphs in \(G(n,1/2)\)2010-05-11Paper
Games of fixed rank: a hierarchy of bimatrix games2010-02-19Paper
Spectral algorithms2009-12-22Paper
Optimization of a convex program with a polynomial perturbation2009-12-07Paper
Adaptive Sampling for k-Means Clustering2009-10-28Paper
Algorithms and Computation2009-08-07Paper
The Spectral Method for General Mixture Models2009-06-22Paper
Decoupling and Partial Independence2009-02-12Paper
Two new Probability inequalities and Concentration Results2008-09-15Paper
Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms2008-06-05Paper
Spectral Clustering by Recursive Partitioning2008-03-11Paper
Fast monte-carlo algorithms for finding low-rank approximations2008-01-14Paper
Blocking Conductance and Mixing in Random Walks2007-07-30Paper
Learning Theory2006-06-22Paper
Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition2006-06-01Paper
Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix2006-06-01Paper
Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication2006-06-01Paper
STACS 20052005-12-02Paper
Learning mixtures of separated nonspherical Gaussians2005-04-29Paper
Clustering large graphs via the singular value decomposition2005-01-19Paper
Random sampling and approximation of MAX-CSPs2004-11-18Paper
https://portal.mardi4nfdi.de/entity/Q44712982004-07-28Paper
Deterministic and randomized polynomial‐time approximation of radii2003-11-16Paper
https://portal.mardi4nfdi.de/entity/Q45492342003-06-16Paper
A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search.2003-01-21Paper
https://portal.mardi4nfdi.de/entity/Q45270382001-03-01Paper
Log-Sobolev inequalities and sampling from log-concave distributions2000-02-07Paper
Quick approximation to matrices and applications1999-12-08Paper
https://portal.mardi4nfdi.de/entity/Q42622201999-11-11Paper
https://portal.mardi4nfdi.de/entity/Q42341291999-10-28Paper
https://portal.mardi4nfdi.de/entity/Q42523001999-06-17Paper
https://portal.mardi4nfdi.de/entity/Q42520321999-06-17Paper
A simple algorithm for constructing Szemerédi's regularity partition1999-03-31Paper
A polynomial-time algorithm for learning noisy linear threshold functions1998-11-11Paper
Sampling contingency tables1998-04-05Paper
Learning an intersection of a constant number of halfspaces over a uniform distribution1997-12-08Paper
On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension1997-10-28Paper
Random walks and anO*(n5) volume algorithm for convex bodies1997-09-04Paper
A Randomized Algorithm to Optimize Over Certain Convex Sets1996-09-16Paper
https://portal.mardi4nfdi.de/entity/Q48390591995-08-07Paper
Isoperimetric problems for convex bodies and a localization lemma1995-07-02Paper
Sampling from log-concave distributions1995-05-30Paper
A random polynomial-time algorithm for approximating the volume of convex bodies1994-08-21Paper
A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem1994-04-28Paper
A circuit-based proof of Toda's theorem1993-08-30Paper
Lattice translates of a polytope and the Frobenius problem1993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q39759411992-06-26Paper
Chvátal closures for mixed integer programming problems1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33528421990-01-01Paper
The Shapes of Polyhedra1990-01-01Paper
On nontrivial separators for \(k\)-page graphs and simulations by nondeterministic one-tape Turing machines1989-01-01Paper
On 3-pushdown graphs with large separators1989-01-01Paper
Succinct Certificates for Almost All Subset Sum Problems1989-01-01Paper
Covering minima and lattice-point-free convex bodies1988-01-01Paper
Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers1988-01-01Paper
Reconstructing Truncated Integer Variables Satisfying Linear Congruences1988-01-01Paper
Hermite Normal Form Computation Using Modulo Determinant Arithmetic1987-01-01Paper
Minkowski's Convex Body Theorem and Integer Programming1987-01-01Paper
Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37761521987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37579741986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47247081986-01-01Paper
Solving systems of linear equations over polynomials1985-01-01Paper
Unraveling k-page graphs1985-01-01Paper
Towards separating nondeterminism from determinism1984-01-01Paper
Polynomial-Time Aggregation of Integer Programming Problems1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32238031983-01-01Paper
Circuit-size lower bounds and non-reducibility to sparse sets1982-01-01Paper
Exponential Lower Bounds on a Class of Knapsack Algorithms1981-01-01Paper
A Polynomial Algorithm for the Two-Variable Integer Programming Problem1980-01-01Paper
A characterization of threshold matroids1980-01-01Paper
Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41822561979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41822551979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41947391979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41976291978-01-01Paper

Research outcomes over time

This page was built for person: R. Kannan