The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jonathan A. Kelner: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. 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]

  8. On the Hardness and Smoothed Complexity of Quasi-Concave Minimization. [Citation Graph (, )][DBLP]


  9. Faster Generation of Random Spanning Trees. [Citation Graph (, )][DBLP]


  10. Local Graph Partitions for Approximation and Testing. [Citation Graph (, )][DBLP]


  11. Higher Eigenvalues of Graphs. [Citation Graph (, )][DBLP]


  12. Fitting a graph to vector data. [Citation Graph (, )][DBLP]


  13. Breaking and Making Quantum Money: Toward a New Quantum Cryptographic Protocol. [Citation Graph (, )][DBLP]


  14. Faster generation of random spanning trees [Citation Graph (, )][DBLP]


  15. Electric routing and concurrent flow cutting [Citation Graph (, )][DBLP]


  16. Metric uniformization and spectral bounds for graphs [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002