| 2007 |
|---|
| 8 | EE | Jonathan A. Kelner,
Evdokia Nikolova:
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization.
FOCS 2007: 472-482 |
| 2006 |
|---|
| 7 | EE | Evdokia Nikolova,
Jonathan A. Kelner,
Matthew Brand,
Michael Mitzenmacher:
Stochastic Shortest Paths Via Quasi-convex Maximization.
ESA 2006: 552-563 |
| 6 | EE | Jonathan A. Kelner,
Daniel A. Spielman:
A randomized polynomial-time simplex algorithm for linear programming.
STOC 2006: 51-60 |
| 5 | EE | Jonathan A. Kelner:
Spectral Partitioning, Eigenvalue Bounds, and Circle Packings for Graphs of Bounded Genus.
SIAM J. Comput. 35(4): 882-902 (2006) |
| 2005 |
|---|
| 4 | EE | Jonathan A. Kelner,
Daniel A. Spielman:
A Randomized Polynomial-Time Simplex Algorithm for Linear Programming (Preliminary Version)
Electronic Colloquium on Computational Complexity (ECCC)(156): (2005) |
| 2004 |
|---|
| 3 | EE | Jonathan A. Kelner:
Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus.
STOC 2004: 455-464 |
| 2002 |
|---|
| 2 | | Vivek K. Goyal,
Jonathan A. Kelner,
Jelena Kovacevic:
Multiple description vector quantization with a coarse lattice.
IEEE Transactions on Information Theory 48(3): 781-788 (2002) |
| 2000 |
|---|
| 1 | EE | Jonathan A. Kelner,
Vivek K. Goyal,
Jelena Kovacevic:
Multiple Description Lattice Vector Quantization: Variations and Extensions.
Data Compression Conference 2000: 480-489 |
