The SCEAS System
| |||||||

## Search the dblp DataBase
Ravindran Kannan:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Ravindran Kannan, Hadi Salmasian, Santosh Vempala
**The Spectral Method for General Mixture Models.**[Citation Graph (0, 0)][DBLP] COLT, 2005, pp:444-457 [Conf] - Ravindran Kannan, Gary L. Miller, Larry Rudolph
**Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers**[Citation Graph (0, 0)][DBLP] FOCS, 1984, pp:7-11 [Conf] - Ravindran Kannan, Richard J. Lipton
**The Orbit Problem is Decidable**[Citation Graph (0, 0)][DBLP] STOC, 1980, pp:252-261 [Conf] - Ravindran Kannan, Arjen K. Lenstra, László Lovász
**Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers**[Citation Graph (0, 0)][DBLP] STOC, 1984, pp:191-200 [Conf] - Hadi Salmasian, Ravindran Kannan, Santosh Vempala
**The Spectral Method for Mixture Models**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:067, pp:- [Journal] - Ravindran Kannan
**A Polynomial Algorithm for the Two-Variable Integer Programming Problem.**[Citation Graph (0, 0)][DBLP] J. ACM, 1980, v:27, n:1, pp:118-122 [Journal] - Ravindran Kannan
**Polynomial-Time Aggregation of Integer Programming Problems**[Citation Graph (0, 0)][DBLP] J. ACM, 1983, v:30, n:1, pp:133-145 [Journal] - Ravindran Kannan, Richard J. Lipton
**Polynomial-time algorithm for the orbit problem.**[Citation Graph (0, 0)][DBLP] J. ACM, 1986, v:33, n:4, pp:808-821 [Journal] - Avrim Blum, Ravindran Kannan
**Learning an Intersection of a Constant Number of Halfspaces over a Uniform Distribution.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1997, v:54, n:2, pp:371-380 [Journal] - Ravindran Kannan
**Towards Separating Nondeterminism from Determinism.**[Citation Graph (0, 0)][DBLP] Mathematical Systems Theory, 1984, v:17, n:1, pp:29-45 [Journal] - Ravindran Kannan, Achim Bachem
**Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1979, v:8, n:4, pp:499-507 [Journal] - Ravindran Kannan, Gary L. Miller, Larry Rudolph
**Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1987, v:16, n:1, pp:7-16 [Journal] **A New Probability Inequality Using Typical Moments and Concentration Results.**[Citation Graph (, )][DBLP]**Spectral methods for matrices and tensors.**[Citation Graph (, )][DBLP]**Spectral Methods for Matrices and Tensors**[Citation Graph (, )][DBLP]**Clustering with Spectral Norm and the k-means Algorithm**[Citation Graph (, )][DBLP]
Search in 0.023secs, Finished in 0.024secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |