Jonathan A. Kelner

	2012
30		Zeyuan Allen Zhu, Sasa Misailovic, Jonathan A. Kelner, Martin C. Rinard: Randomized accuracy-aware program transformations for efficient approximate computations. POPL 2012: 441-454
29		Jonathan A. Kelner, Gary L. Miller, Richard Peng: Faster approximate multicommodity flow using quadratically coupled flows. STOC 2012: 1-18
28		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: 307-326
27		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: 961-970
26		Jonathan A. Kelner, Gary L. Miller, Richard Peng: Beyond Laplacians: Faster CoRR abs/1202.3367: (2012)
25		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 CoRR abs/1205.4484: (2012)
	2011
24		Animashree Anandkumar, Avinatan Hassidim, Jonathan A. Kelner: Topology discovery of sparse random graphs with few participants. SIGMETRICS 2011: 293-304
23		Jonathan A. Kelner, Alex Levin: Spectral Sparsification in the Semi-Streaming Setting. STACS 2011: 440-451
22		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: 273-282
21		Animashree Anandkumar, Avinatan Hassidim, Jonathan A. Kelner: Topology Discovery of Sparse Random Graphs With Few Participants CoRR abs/1102.5063: (2011)
20		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 abs/1104.2944: (2011)
19		Jonathan A. Kelner, Petar Maymounkov: Electric routing and concurrent flow cutting. Theor. Comput. Sci. 412(32): 4123-4135 (2011)
	2010
18		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: 20-31
17		Jonathan A. Kelner, James R. Lee, Gregory N. Price, Shang-Hua Teng: Metric uniformization and spectral bounds for graphs CoRR abs/1008.3594: (2010)
16		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 abs/1010.2921: (2010)
	2009
15		Jonathan A. Kelner, Aleksander Madry: Faster Generation of Random Spanning Trees. FOCS 2009: 13-21
14		Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguyen, Krzysztof Onak: Local Graph Partitions for Approximation and Testing. FOCS 2009: 22-31
13		Jonathan A. Kelner, James R. Lee, Gregory N. Price, Shang-Hua Teng: Higher Eigenvalues of Graphs. FOCS 2009: 735-744
12		Samuel I. Daitch, Jonathan A. Kelner, Daniel A. Spielman: Fitting a graph to vector data. ICML 2009: 26
11		Jonathan A. Kelner, Petar Maymounkov: Electric Routing and Concurrent Flow Cutting. ISAAC 2009: 792-801
10		Jonathan A. Kelner, Aleksander Madry: Faster generation of random spanning trees CoRR abs/0908.1448: (2009)
9		Jonathan A. Kelner, Petar Maymounkov: Electric routing and concurrent flow cutting CoRR abs/0909.2859: (2009)
	2007
8		Jonathan A. Kelner, Evdokia Nikolova: On the Hardness and Smoothed Complexity of Quasi-Concave Minimization. FOCS 2007: 472-482
	2006
7		Evdokia Nikolova, Jonathan A. Kelner, Matthew Brand, Michael Mitzenmacher: Stochastic Shortest Paths Via Quasi-convex Maximization. ESA 2006: 552-563
6		Jonathan A. Kelner, Daniel A. Spielman: A randomized polynomial-time simplex algorithm for linear programming. STOC 2006: 51-60
5		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		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		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		Jonathan A. Kelner, Vivek K. Goyal, Jelena Kovacevic: Multiple Description Lattice Vector Quantization: Variations and Extensions. Data Compression Conference 2000: 480-489

Coauthor Index

1	Scott Aaronson	[18]
2	Animashree Anandkumar	[21] [24]
3	Boaz Barak	[25] [28]
4	Matthew Brand	[7]
5	Fernando G. S. L. Brandão	[25] [28]
6	Keren Censor-Hillel (Keren Censor)	[20] [27]
7	Paul Christiano	[16] [22]
8	Samuel I. Daitch	[12]
9	Edward Farhi	[18]
10	David Gosset	[18]
11	Vivek K. Goyal	[1] [2]
12	Bernhard Haeupler	[20] [27]
13	Aram Wettroth Harrow	[25] [28]
14	Avinatan Hassidim	[14] [18] [21] [24]
15	Jelena Kovacevic	[1] [2]
16	James R. Lee	[13] [17]
17	Alex Levin	[23]
18	Andrew Lutomirski	[18]
19	Aleksander Madry	[10] [15] [16] [22]
20	Petar Maymounkov	[9] [11] [19] [20] [27]
21	Gary L. Miller	[26] [29]
22	Sasa Misailovic	[30]
23	Michael Mitzenmacher	[7]
24	Huy N. Nguyen	[14]
25	Evdokia Nikolova	[7] [8]
26	Krzysztof Onak	[14]
27	Richard Peng	[26] [29]
28	Gregory N. Price	[13] [17]
29	Martin C. Rinard	[30]
30	Peter W. Shor	[18]
31	Daniel A. Spielman	[4] [6] [12] [16] [22]
32	David Steurer	[25] [28]
33	Shang-Hua Teng	[13] [16] [17] [22]
34	Yuan Zhou	[25] [28]
35	Zeyuan Allen Zhu	[30]

Colors in the list of coauthors

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page