Ravindran Kannan
#14,872
Most Influential Person Now
Indian mathematician
Ravindran Kannan's AcademicInfluence.com Rankings
Ravindran Kannanmathematics Degrees
Mathematics
#1683
World Rank
#2706
Historical Rank
Combinatorics
#60
World Rank
#67
Historical Rank
Graph Theory
#68
World Rank
#75
Historical Rank
Measure Theory
#855
World Rank
#1124
Historical Rank
Download Badge
Computer Science Mathematics
Ravindran Kannan's Degrees
- PhD Computer Science Cornell University
Similar Degrees You Can Earn
Why Is Ravindran Kannan Influential?
(Suggest an Edit or Addition)According to Wikipedia, Ravindran Kannan is a Principal Researcher at Microsoft Research India, where he leads the algorithms research group. He is also the first adjunct faculty of Computer Science and Automation Department of Indian Institute of Science.
Ravindran Kannan's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- On clusterings-good, bad and spectral (2000) (1221)
- A random polynomial-time algorithm for approximating the volume of convex bodies (1989) (790)
- Fast Monte-Carlo algorithms for finding low-rank approximations (1998) (759)
- Minkowski's Convex Body Theorem and Integer Programming (1987) (735)
- Some results on fixed points (1968) (647)
- Some Results on Fixed Points—II (1969) (595)
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix (2006) (534)
- Clustering Large Graphs via the Singular Value Decomposition (2004) (515)
- Improved algorithms for integer programming and related lattice problems (1983) (475)
- Quick Approximation to Matrices and Applications (1999) (475)
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix (1979) (448)
- Isoperimetric problems for convex bodies and a localization lemma (1995) (444)
- Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication (2006) (443)
- Computing a nonnegative matrix factorization -- provably (2011) (374)
- Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition (2006) (314)
- Chvátal closures for mixed integer programming problems (1990) (284)
- Random walks and an O * ( n 5 ) volume algorithm for convex bodies (1997) (259)
- Learning mixtures of arbitrary gaussians (2001) (258)
- Foundations of Data Science (2020) (237)
- Random walks and an O*(n5) volume algorithm for convex bodies (1997) (231)
- Clustering in large graphs and matrices (1999) (223)
- A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions (1996) (213)
- On integer points in polyhedra (1992) (211)
- A deterministic (2-2/(k+1))n algorithm for k-SAT based on local search (2002) (199)
- The regularity lemma and approximation schemes for dense problems (1996) (194)
- Convex Sets and their Applications (2006) (185)
- Clustering with Spectral Norm and the k-Means Algorithm (2010) (184)
- Lattice translates of a polytope and the Frobenius problem (1992) (183)
- Sampling and integration of near log-concave functions (1991) (179)
- The Spectral Method for General Mixture Models (2008) (167)
- Circuit-Size Lower Bounds and Non-Reducibility to Sparse Sets (1982) (166)
- Simple Markov-chain algorithms for generating bipartite graphs and tournaments (1997) (162)
- A divide-and-merge methodology for clustering (2005) (156)
- Spectral Algorithms (2009) (136)
- ALGORITHMIC GEOMETRY OF NUMBERS (1987) (136)
- Adaptive Sampling for k-Means Clustering (2009) (128)
- On the Computational Complexity of Integer Programming Problems (1978) (127)
- Reconstructing Truncated Integer Variables Satisfying Linear Congruences (1988) (119)
- Hermite Normal Form Computation Using Modulo Determinant Arithmetic (1987) (114)
- Sampling contingency tables (1997) (114)
- Faster mixing via average conductance (1999) (110)
- Pass efficient algorithms for approximating large matrices (2003) (105)
- Random sampling and approximation of MAX-CSPs (2003) (105)
- Covering Minima and Lattice Point Free Convex Bodies (1986) (104)
- Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers (1984) (102)
- LEARNING MIXTURES OF SEPARATED NONSPHERICAL GAUSSIANS (2005) (97)
- Polynomial-time algorithm for the orbit problem (1986) (95)
- Fast Monte-Carlo algorithms for approximate matrix multiplication (2001) (82)
- Markov chains and polynomial time algorithms (1994) (82)
- Principal Component Analysis and Higher Correlations for Distributed Data (2013) (79)
- Games of fixed rank: a hierarchy of bimatrix games (2005) (76)
- Random walks on polytopes and an affine interior point method for linear programming (2009) (74)
- Learning linear transformations (1996) (74)
- Simple Markov-Chain Algorithms for Generating Bipartite Graphs and Tournaments (Extended Abstract) (1999) (70)
- Covering minima and lattice-point-free convex bodies (1988) (69)
- Nonlinear analysis : a collection of papers in honor of Erich H. Rothe (1978) (69)
- Market Equilibria in Polynomial Time for Fixed Number of Goods or Agents (2008) (67)
- Some results on fixed points - III (1971) (67)
- Random sampling and approximation of MAX-CSP problems (2002) (65)
- A Polynomial Algorithm for the Two-Variable Integer Programming Problem (1980) (59)
- Periodic solutions of nonlinear wave equations (1983) (59)
- A provable SVD-based algorithm for learning topics in dominant admixture corpus (2014) (56)
- A Simple Algorithm for Constructing Szemere'di's Regularity Partition (1999) (56)
- On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension (1997) (54)
- Functional analysis and nonlinear differential equations (1973) (53)
- A divide-and-merge methodology for clustering (2006) (53)
- Tensor decomposition and approximation schemes for constraint satisfaction problems (2005) (52)
- The Spectral Method for General Mixture Models (2005) (52)
- Deterministic and randomized polynomial-time approximation of radii (2001) (51)
- A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem (1993) (50)
- Randomized algorithms in numerical linear algebra (2017) (49)
- Log-Sobolev inequalities and sampling from log-concave distributions (1999) (49)
- A new approach to the planted clique problem (2008) (49)
- Solving Systems of Linear Equations over Polynomials (1985) (47)
- Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers (1984) (46)
- Blocking Conductance and Mixing in Random Walks (2006) (45)
- An abstract existence theorem at resonance (1977) (45)
- Alternation and the power of nondeterminism (1983) (44)
- Spectral Clustering by Recursive Partitioning (2006) (43)
- The Frobenius Problem (1989) (39)
- The Shapes of Polyhedra (1990) (38)
- Fixed point theorems in reflexive Banach spaces (1973) (37)
- Learning an Intersection of a Constant Number of Halfspaces over a Uniform Distribution (1997) (37)
- Construction of fixed points of a class of nonlinear mappings (1973) (37)
- On nontrivial separators for k-page graphs and simulations by nondeterministic one-tape Turing machines (1986) (36)
- Learning an intersection of k halfspaces over a uniform distribution (1993) (36)
- The orbit problem is decidable (1980) (35)
- Approximation of diameters: randomization doesn't help (1998) (35)
- Sampling lattice points (1997) (34)
- Succinct Certificates for Almost All Subset Sum Problems (1989) (32)
- Linear Congruential Generators Do Not Produce Random Sequences (1984) (31)
- Approximation Algorithms for NP-Hard Problems (2004) (30)
- Random nonlinear equations and monotonic nonlinearities (1977) (29)
- On a class of nonlinear boundary value problems (1977) (29)
- OPEN PROBLEMS IN DATA STREAMS AND RELATED TOPICS IITK WORKSHOP ON ALGORITHMS FOR DATA STREAMS ’06 (2007) (29)
- Rapid Mixing of Several Markov Chains for a Hard-Core Model (2003) (28)
- Towards separating nondeterminism from determinism (1984) (26)
- Test Sets for Integer Programs, 0_ Sentences (1990) (26)
- Solutions in the large of Liénard systems with forcing terms (1976) (25)
- Polynomial-Time Aggregation of Integer Programming Problems (1983) (24)
- Existence of periodic solutions of nonlinear boundary value problems and the method of upper and lower solutions (1984) (23)
- Computing a Nonnegative Matrix Factorization - Provably (2016) (23)
- A Circuit-Based Proof of Toda's Theorem (1993) (23)
- Periodic Solutions of Pendulum-Type Equations (1985) (23)
- Landesman-Lazer conditions for problems with “one- side unbounded” nonlinearities (1985) (22)
- SOLUTIONS OF NONLINEAR HYPERBOLIC EQUATIONS AT RESONANCE (1982) (20)
- Spectral Approaches to Nearest Neighbor Search (2014) (20)
- Sampling according to the multivariate normal density (1996) (20)
- The space complexity of pass-efficient algorithms for clustering (2006) (19)
- Nonlinear boundary value problems and operators TT (1978) (18)
- Singular and nonsingular boundary value problems with sign changing nonlinearities (2000) (18)
- EXISTENCE OF SOLUTIONS OF A NONLINEAR DIFFERENTIAL EQUATION (1983) (18)
- An asymptotic result in forced oscillations of pendulum-type equations (1986) (17)
- Some results on fixed points — IV (1972) (16)
- Spectral clustering with limited independence (2007) (16)
- Qualitative study of a class of nonlinear boundary value problems at resonance (1985) (15)
- Non-negative Matrix Factorization under Heavy Noise (2016) (15)
- On 3-pushdown graphs with large separators (1989) (14)
- Unraveling k-page graphs (1985) (14)
- A New Probability Inequality Using Typical Moments and Concentration Results (2008) (14)
- Superlinear elliptic boundary value problems (1987) (13)
- Discovering Global Patterns in Linguistic Networks through Spectral Analysis: A Case Study of the Consonant Inventories (2009) (13)
- Spectral methods for matrices and tensors (2010) (12)
- A Randomized Algorithm to Optimize Over Certain Convex Sets (1995) (12)
- Existence of Solutions of x + x + g(x) = p(t), x(0) = 0 = x(π) (1986) (11)
- Existence of solutions of nonlinear hyperbolic equations (1979) (10)
- Nimble Algorithms for Cloud Computing (2013) (10)
- Towards separating nondeterministic time from deterministic time (1981) (10)
- Convergence of a two-stage Richardson process for nonlinear equations (1986) (10)
- The Spectral Method for Mixture Models (2004) (10)
- A Note on the Solution Set of Integral Inclusions (2000) (9)
- A circuit-size lower bound (1981) (8)
- Periodic solutions of nonlinear wave equations with damping (1982) (8)
- Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms (2005) (8)
- The size of numbers in the analysis of certain algorithms (1980) (8)
- A characterization of threshold matroids (1980) (8)
- A simple randomised algorithm for convex optimisation (2014) (8)
- Two Algorithms for Solving the Walrasian Equilibrium Inequalities (2006) (8)
- Periodically perturbed conservative systems (1974) (7)
- Nonlinear functional analysis and differential equations : proceedings of the Michigan State University conference (1976) (7)
- Existence of periodic solutions of nonlinear differential equations (1976) (7)
- Operators J∗J and nonlinear Hammerstein equations (1976) (6)
- Algorithms: Recent Highlights and Challenges (2011) (6)
- A note on singular boundary value problems with solutions in weighted spaces (1999) (6)
- Basis Reduction and Evidence for Transcendence of Certain Numbers (1986) (6)
- Learning a Latent Simplex in Input-Sparsity Time (2021) (6)
- Beyond Spectral: Tight Bounds for Planted Gaussians (2016) (6)
- A finite difference approach to the equations of age‐dependent population dynamics (1989) (6)
- Exponential Lower Bounds on a Class of Knapsack Algorithms (1981) (5)
- Solution of the Frobenius problem (1989) (5)
- Continuous dependence of least squares solutions of linear boundary value problems (1976) (5)
- Forced oscillations with rapidly vanishing nonlinearities (1991) (5)
- Rapid mixing in Markov chains (2003) (5)
- Optimal solution and value of parametric integer programs (1993) (5)
- Approximation of Global MAX-CSP Problems (2006) (5)
- Convex Hull of Randomly Chosen Points from A Polytope (1987) (4)
- Solutions of nonlinear wave equations with nonlinear damping (1983) (4)
- An existence theorem for periodic solutions of nonlinear parabolic equations (1982) (4)
- Existence of solutions to u + u + g(t, u, u') = p(t), u(0) = u(π) = 0 (2001) (4)
- Boundary value problems for even order nonlinear ordinary differential equations (1976) (3)
- Chi-squared Amplification: Identifying Hidden Hubs (2016) (3)
- Optimization of a convex program with a polynomial perturbation (2009) (3)
- RANDOM OPERATOR EQUATIONS (1977) (3)
- Indeterminacy, Nonparametric Calibration and Counterfactual Equilibria (2003) (3)
- Markets with Production: A Polynomial Time Algorithm and a Reduction to Pure Exchange (2015) (3)
- Near-optimal sample complexity bounds for learning Latent k-polytopes and applications to Ad-Mixtures (2020) (3)
- Local search in smooth convex sets (1998) (3)
- Finding a latent k-simplex in O(k . nnz(data)) time via Subset Smoothing (2019) (3)
- Decision Methods for Solving Systems of Walrasian Inequalities (2005) (3)
- Nonlinear boundary value problems and orlicz spaces (1977) (2)
- Solution of the Frobenius Problem and Its Generalization (1989) (2)
- Zero-One Rounding of Singular Vectors (2012) (2)
- Pass-Efficient Algorithms for Learning Mixtures of Uniform Distributions (2009) (2)
- Two new Probability inequalities and Concentration Results (2008) (2)
- Applications of Polynomial Smith Normal form Calculations (1979) (2)
- Existence of solutions of a nonlinear problem in potential theory. (1975) (2)
- The Hidden Hubs Problem (2017) (2)
- Nonlinear Perturbations at Resonance (1976) (1)
- A simple randomised algorithm for convex optimisation (2013) (1)
- MONOTONICITY AND MEASURABILITY (1977) (1)
- Learning mixtures of arbitrary gaussians ( STOC 2001 submission ) (2000) (1)
- Correction: Sampling from Log-Concave Distributions (1994) (1)
- Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms (2008) (1)
- A Fast Random Greedy Algorithm for the Component Commonality Problem (1998) (1)
- Best-Fit Subspaces and Singular Value Decomposition (SVD) (2020) (1)
- Singularand Nonsingular Boundary Value Problems with Sign Changing (2000) (1)
- Algorithms for finding k in k-means (2020) (1)
- Bit Complexity of Jordan Normal Form and Spectral Factorization (2021) (1)
- Errata-Corrige : “Existence of solutions of nonlinear hyperbolic equations” (1980) (1)
- Decoupling and Partial Independence (2008) (1)
- Sampling subproblems of heterogeneous Max‐Cut problems and approximation algorithms (2008) (1)
- ALGORITHM FOR CONVEX BODIES (1999) (1)
- Approximate solutions for the Cauchy problem for a semilinear hyperbolic system (1985) (1)
- A Sub-exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem (1993) (1)
- The Computation of Counterfactual Equilibria in Homothetic Walrasian Economies (2004) (1)
- Finding Dense Subgraphs in G(n, 1/2) (2008) (1)
- IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2009, December 15-17, 2009, IIT Kanpur, India (2009) (0)
- Recent Advances in Randomized Numerical Linear Algebra (NII Shonan Meeting 2016-10) (2016) (0)
- Algorithms for Massive Data Problems: Streaming, Sketching, and Sampling (2020) (0)
- Elementary Problems: E3129-E3134 (1986) (0)
- Bit Complexity of Jordan Normal Form and Polynomial Spectral Factorization (2023) (0)
- Mathematics and computing (2009) (0)
- A semi‐discrete convergent scheme for a quasilinear hyperbolic equation (1987) (0)
- FIXED POINT THEOREMS IN REFLEXIVE (2010) (0)
- Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, Pittsburgh, PA, USA, May 1992 (1992) (0)
- Pass-efficient algorithms for clustering (2006) (0)
- 14th Knuth prize: call for nominations (2014) (0)
- A Pass-Efficient Algorithm for Clustering Census Data (0)
- A Markov chain approach to optimization (1994) (0)
- Computational Complexity of Specially Structured Integer Programming Problems (1977) (0)
- Remarks on Numerical Computations Using the Alternative Method (1977) (0)
- Simple Markov-hain algorithms for generatingbipartite graphsand tournaments ( Extended Abstra t ) (1997) (0)
- Finding a latent k-polytope in O(k . nnz(data)) time via Subset Smoothing. (2019) (0)
- Finding k in Latent k- polytope (2021) (0)
- Existence of solutions to somePhi-Laplacian boundary value problems (2001) (0)
- Spectral Algorithms (draft) (2010) (0)
- Existence and nonexistence results for some boundary value problems at resonance (2000) (0)
- Tikhonov Regularization and Nonlinear Problems at Resonance—Deterministic and Random (1978) (0)
- Moment bound for sums of random variables (2020) (0)
- Finding Relevant Subspaces in Neural Network Learning (1994) (0)
- Preface -- IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2009) (2009) (0)
- Clustering algorithms for random and pseudo-random structures (2008) (0)
- Provably good computational approximations to some difficult problems in finance and economics (2002) (0)
- Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, Waterloo, Ontorio, Canada, May 28-30 1990 (1990) (0)
This paper list is powered by the following services:
Other Resources About Ravindran Kannan
What Schools Are Affiliated With Ravindran Kannan?
Ravindran Kannan is affiliated with the following schools:
