|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 7 occurrences of 7 keywords
|
|
|
|
|
Results
Found 29 publication records. Showing 29 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Jonathan A. Kelner, Gary L. Miller, Richard Peng |
Beyond Laplacians: Faster  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Zeyuan Allen Zhu, Sasa Misailovic, Jonathan A. Kelner, Martin C. Rinard |
Randomized accuracy-aware program transformations for efficient approximate computations. |
POPL |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Keren Censor-Hillel, Bernhard Haeupler, Jonathan A. Kelner, Petar Maymounkov |
Global computation in a poorly connected world: fast rumor spreading with no dependence on conductance. |
STOC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jonathan A. Kelner, Gary L. Miller, Richard Peng |
Faster approximate multicommodity flow using quadratically coupled flows. |
STOC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Boaz Barak, Fernando G. S. L. Brandão, Aram Wettroth Harrow, Jonathan A. Kelner, David Steurer, Yuan Zhou |
Hypercontractivity, sum-of-squares proofs, and their applications. |
STOC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jonathan A. Kelner, Petar Maymounkov |
Electric routing and concurrent flow cutting. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Animashree Anandkumar, Avinatan Hassidim, Jonathan A. Kelner |
Topology Discovery of Sparse Random Graphs With Few Participants |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Keren Censor-Hillel, Bernhard Haeupler, Jonathan A. Kelner, Petar Maymounkov |
Global Computation in a Poorly Connected World: Fast Rumor Spreading with No Dependence on Conductance |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Jonathan A. Kelner, Alex Levin |
Spectral Sparsification in the Semi-Streaming Setting. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Christiano, Jonathan A. Kelner, Aleksander Madry, Daniel A. Spielman, Shang-Hua Teng |
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Animashree Anandkumar, Avinatan Hassidim, Jonathan A. Kelner |
Topology discovery of sparse random graphs with few participants. |
SIGMETRICS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Christiano, Jonathan A. Kelner, Aleksander Madry, Daniel A. Spielman, Shang-Hua Teng |
Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Jonathan A. Kelner, James R. Lee, Gregory N. Price, Shang-Hua Teng |
Metric uniformization and spectral bounds for graphs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Andrew Lutomirski, Scott Aaronson, Edward Farhi, David Gosset, Jonathan A. Kelner, Avinatan Hassidim, Peter W. Shor |
Breaking and Making Quantum Money: Toward a New Quantum Cryptographic Protocol. |
ICS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Jonathan A. Kelner, Petar Maymounkov |
Electric routing and concurrent flow cutting |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Jonathan A. Kelner, Aleksander Madry |
Faster generation of random spanning trees |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Samuel I. Daitch, Jonathan A. Kelner, Daniel A. Spielman |
Fitting a graph to vector data. |
ICML |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguyen, Krzysztof Onak |
Local Graph Partitions for Approximation and Testing. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
constant time algorithms, approximation algorithms, separator theorem |
| 1 | Jonathan A. Kelner, Aleksander Madry |
Faster Generation of Random Spanning Trees. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
random walks on graphs, electrical flows, spanning trees |
| 1 | Jonathan A. Kelner, James R. Lee, Gregory N. Price, Shang-Hua Teng |
Higher Eigenvalues of Graphs. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jonathan A. Kelner, Petar Maymounkov |
Electric Routing and Concurrent Flow Cutting. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jonathan A. Kelner, Evdokia Nikolova |
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization. |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jonathan A. Kelner |
Spectral Partitioning, Eigenvalue Bounds, and Circle Packings for Graphs of Bounded Genus. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Evdokia Nikolova, Jonathan A. Kelner, Matthew Brand, Michael Mitzenmacher |
Stochastic Shortest Paths Via Quasi-convex Maximization. |
ESA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jonathan A. Kelner, Daniel A. Spielman |
A randomized polynomial-time simplex algorithm for linear programming. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jonathan A. Kelner, Daniel A. Spielman |
A Randomized Polynomial-Time Simplex Algorithm for Linear Programming (Preliminary Version) |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Jonathan A. Kelner |
Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
bounded genus, circle packing, partitioning, laplacian, graph separators, spectral partitioning |
| 1 | Vivek K. Goyal, Jonathan A. Kelner, Jelena Kovacevic |
Multiple description vector quantization with a coarse lattice. |
IEEE Transactions on Information Theory |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Jonathan A. Kelner, Vivek K. Goyal, Jelena Kovacevic |
Multiple Description Lattice Vector Quantization: Variations and Extensions. |
Data Compression Conference |
2000 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #29 of 29 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")