The SCEAS System
| |||||||

## Search the dblp DataBase
Jonathan A. Kelner:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Jonathan A. Kelner, Vivek K. Goyal, Jelena Kovacevic
**Multiple Description Lattice Vector Quantization: Variations and Extensions.**[Citation Graph (0, 0)][DBLP] Data Compression Conference, 2000, pp:480-489 [Conf] - Evdokia Nikolova, Jonathan A. Kelner, Matthew Brand, Michael Mitzenmacher
**Stochastic Shortest Paths Via Quasi-convex Maximization.**[Citation Graph (0, 0)][DBLP] ESA, 2006, pp:552-563 [Conf] - Jonathan A. Kelner
**Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus.**[Citation Graph (0, 0)][DBLP] STOC, 2004, pp:455-464 [Conf] - Jonathan A. Kelner, Daniel A. Spielman
**A randomized polynomial-time simplex algorithm for linear programming.**[Citation Graph (0, 0)][DBLP] STOC, 2006, pp:51-60 [Conf] - Jonathan A. Kelner, Daniel A. Spielman
**A Randomized Polynomial-Time Simplex Algorithm for Linear Programming (Preliminary Version)**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:156, pp:- [Journal] - Jonathan A. Kelner
**Spectral Partitioning, Eigenvalue Bounds, and Circle Packings for Graphs of Bounded Genus.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2006, v:35, n:4, pp:882-902 [Journal] - Vivek K. Goyal, Jonathan A. Kelner, Jelena Kovacevic
**Multiple description vector quantization with a coarse lattice.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2002, v:48, n:3, pp:781-788 [Journal] **On the Hardness and Smoothed Complexity of Quasi-Concave Minimization.**[Citation Graph (, )][DBLP]**Faster Generation of Random Spanning Trees.**[Citation Graph (, )][DBLP]**Local Graph Partitions for Approximation and Testing.**[Citation Graph (, )][DBLP]**Higher Eigenvalues of Graphs.**[Citation Graph (, )][DBLP]**Fitting a graph to vector data.**[Citation Graph (, )][DBLP]**Breaking and Making Quantum Money: Toward a New Quantum Cryptographic Protocol.**[Citation Graph (, )][DBLP]**Faster generation of random spanning trees**[Citation Graph (, )][DBLP]**Electric routing and concurrent flow cutting**[Citation Graph (, )][DBLP]**Metric uniformization and spectral bounds for graphs**[Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

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