The following pages link to Ravindran Kannan (Q1356891):
Displaying 50 items.
- (Q463725) (redirect page) (← links)
- A simple randomised algorithm for convex optimisation (Q463726) (← links)
- Clustering large graphs via the singular value decomposition (Q703073) (← links)
- (Q847798) (redirect page) (← links)
- Games of fixed rank: a hierarchy of bimatrix games (Q847799) (← links)
- Chvátal closures for mixed integer programming problems (Q922950) (← links)
- Optimization of a convex program with a polynomial perturbation (Q1043242) (← links)
- Solving systems of linear equations over polynomials (Q1082773) (← links)
- Covering minima and lattice-point-free convex bodies (Q1112339) (← links)
- On nontrivial separators for \(k\)-page graphs and simulations by nondeterministic one-tape Turing machines (Q1122982) (← links)
- Quick approximation to matrices and applications (Q1125616) (← links)
- A characterization of threshold matroids (Q1144029) (← links)
- Lattice translates of a polytope and the Frobenius problem (Q1196686) (← links)
- A polynomial-time algorithm for learning noisy linear threshold functions (Q1271190) (← links)
- A simple algorithm for constructing Szemerédi's regularity partition (Q1283876) (← links)
- Log-Sobolev inequalities and sampling from log-concave distributions (Q1296584) (← links)
- Sampling from log-concave distributions (Q1336592) (← links)
- Learning an intersection of a constant number of halfspaces over a uniform distribution (Q1356892) (← links)
- Learning mixtures of separated nonspherical Gaussians (Q1774210) (← links)
- A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search. (Q1853552) (← links)
- Random sampling and approximation of MAX-CSPs (Q1886453) (← links)
- Isoperimetric problems for convex bodies and a localization lemma (Q1892428) (← links)
- Foundations of data science (Q2035068) (← links)
- On 3-pushdown graphs with large separators (Q2277467) (← links)
- A circuit-based proof of Toda's theorem (Q2366565) (← links)
- Computing a Nonnegative Matrix Factorization---Provably (Q2817794) (← links)
- Faster mixing via average conductance (Q2819555) (← links)
- Zero-One Rounding of Singular Vectors (Q2843255) (← links)
- Spectral methods for matrices and tensors (Q2875128) (← links)
- Random Walks on Polytopes and an Affine Interior Point Method for Linear Programming (Q2884302) (← links)
- (Q2934697) (← links)
- Hermite Normal Form Computation Using Modulo Determinant Arithmetic (Q3026176) (← links)
- (Q3165958) (← links)
- The Shapes of Polyhedra (Q3196930) (← links)
- (Q3223803) (← links)
- Circuit-size lower bounds and non-reducibility to sparse sets (Q3323851) (← links)
- Towards separating nondeterminism from determinism (Q3334987) (← links)
- (Q3352842) (← links)
- Polynomial-time algorithm for the orbit problem (Q3462041) (← links)
- Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms (Q3503606) (← links)
- Finding Dense Subgraphs in G(n,1/2) (Q3558917) (← links)
- Pass-Efficient Algorithms for Learning Mixtures of Uniform Distributions (Q3575149) (← links)
- Random sampling and approximation of MAX-CSP problems (Q3579226) (← links)
- Tensor decomposition and approximation schemes for constraint satisfaction problems (Q3581412) (← links)
- The space complexity of pass-efficient algorithms for clustering (Q3583430) (← links)
- On clusterings (Q3583579) (← links)
- Decoupling and Partial Independence (Q3601927) (← links)
- The Spectral Method for General Mixture Models (Q3631905) (← links)
- Adaptive Sampling for k-Means Clustering (Q3638866) (← links)
- Spectral Algorithms (Q3653374) (← links)
