default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJonathan A. Kelner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c37]Khashayar Gatmiry, Jonathan A. Kelner, Santosh S. Vempala:
Sampling Polytopes with Riemannian HMC: Faster Mixing via the Lewis Weights Barrier. COLT 2024: 1796-1881- [c36]Jonathan A. Kelner, Frederic Koehler, Raghu Meka, Dhruv Rohatgi:
Lasso with Latents: Efficient Estimation, Covariate Rescaling, and Computational-Statistical Gaps. COLT 2024: 2840-2886 - [i30]Jonathan A. Kelner, Frederic Koehler, Raghu Meka, Dhruv Rohatgi:
Lasso with Latents: Efficient Estimation, Covariate Rescaling, and Computational-Statistical Gaps. CoRR abs/2402.15409 (2024) - [i29]Khashayar Gatmiry, Jonathan A. Kelner, Holden Lee:
Learning Mixtures of Gaussians Using Diffusion Models. CoRR abs/2404.18869 (2024) - 2023
- [c35]Jonathan A. Kelner, Jerry Li, Allen Liu, Aaron Sidford, Kevin Tian:
Semi-Random Sparse Recovery in Nearly-Linear Time. COLT 2023: 2352-2398 - [c34]Jonathan A. Kelner, Jerry Li, Allen Liu, Aaron Sidford, Kevin Tian:
Matrix Completion in Almost-Verification Time. FOCS 2023: 2102-2128 - [c33]Jonathan A. Kelner, Frederic Koehler, Raghu Meka, Dhruv Rohatgi:
Feature Adaptation for Sparse Linear Regression. NeurIPS 2023 - [i28]Khashayar Gatmiry, Jonathan A. Kelner, Santosh S. Vempala:
Sampling with Barriers: Faster Mixing via Lewis Weights. CoRR abs/2303.00480 (2023) - [i27]Jonathan A. Kelner, Frederic Koehler, Raghu Meka, Dhruv Rohatgi:
Feature Adaptation for Sparse Linear Regression. CoRR abs/2305.16892 (2023) - [i26]Jonathan A. Kelner, Jerry Li, Allen Liu, Aaron Sidford, Kevin Tian:
Matrix Completion in Almost-Verification Time. CoRR abs/2308.03661 (2023) - 2022
- [c32]Jonathan A. Kelner, Annie Marsden, Vatsal Sharan, Aaron Sidford, Gregory Valiant, Honglin Yuan:
Big-Step-Little-Step: Efficient Gradient Methods for Objectives with Multiple Scales. COLT 2022: 2431-2540 - [c31]Khashayar Gatmiry, Stefanie Jegelka, Jonathan A. Kelner:
Optimization and Adaptive Generalization of Three layer Neural Networks. ICLR 2022 - [c30]Jonathan A. Kelner, Frederic Koehler, Raghu Meka, Dhruv Rohatgi:
Lower Bounds on Randomly Preconditioned Lasso via Robust Sparse Designs. NeurIPS 2022 - [i25]Jonathan A. Kelner, Frederic Koehler, Raghu Meka, Dhruv Rohatgi:
Distributional Hardness Against Preconditioned Lasso via Erasure-Robust Designs. CoRR abs/2203.02824 (2022) - [i24]Jonathan A. Kelner, Jerry Li, Allen Liu, Aaron Sidford, Kevin Tian:
Semi-Random Sparse Recovery in Nearly-Linear Time. CoRR abs/2203.04002 (2022) - 2021
- [c29]Jonathan A. Kelner, Frederic Koehler, Raghu Meka, Dhruv Rohatgi:
On the Power of Preconditioning in Sparse Linear Regression. FOCS 2021: 550-561 - [i23]Jonathan A. Kelner, Frederic Koehler, Raghu Meka, Dhruv Rohatgi:
On the Power of Preconditioning in Sparse Linear Regression. CoRR abs/2106.09207 (2021) - [i22]Jonathan A. Kelner, Annie Marsden, Vatsal Sharan, Aaron Sidford, Gregory Valiant, Honglin Yuan:
Big-Step-Little-Step: Efficient Gradient Methods for Objectives with Multiple Scales. CoRR abs/2111.03137 (2021) - 2020
- [c28]AmirMahdi Ahmadinejad, Jonathan A. Kelner, Jack Murtagh, John Peebles, Aaron Sidford, Salil P. Vadhan:
High-precision Estimation of Random Walks in Small Space. FOCS 2020: 1295-1306 - [c27]Jonathan A. Kelner, Frederic Koehler, Raghu Meka, Ankur Moitra:
Learning Some Popular Gaussian Graphical Models without Condition Number Bounds. NeurIPS 2020
2010 – 2019
- 2019
- [j8]Boaz Barak, Samuel B. Hopkins, Jonathan A. Kelner, Pravesh K. Kothari, Ankur Moitra, Aaron Potechin
:
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem. SIAM J. Comput. 48(2): 687-735 (2019) - [i21]Jonathan A. Kelner, Frederic Koehler, Raghu Meka, Ankur Moitra:
Learning Some Popular Gaussian Graphical Models without Condition Number Bounds. CoRR abs/1905.01282 (2019) - [i20]AmirMahdi Ahmadinejad, Jonathan A. Kelner, Jack Murtagh, John Peebles, Aaron Sidford, Salil P. Vadhan:
High-precision Estimation of Random Walks in Small Space. CoRR abs/1912.04524 (2019) - 2018
- [c26]Michael B. Cohen, Jonathan A. Kelner, Rasmus Kyng, John Peebles, Richard Peng, Anup B. Rao, Aaron Sidford:
Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations. FOCS 2018: 898-909 - [i19]Michael B. Cohen, Jonathan A. Kelner, Rasmus Kyng, John Peebles, Richard Peng, Anup B. Rao, Aaron Sidford:
Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations. CoRR abs/1811.10722 (2018) - 2017
- [j7]Keren Censor-Hillel, Bernhard Haeupler, Jonathan A. Kelner, Petar Maymounkov:
Rumor Spreading with No Dependence on Conductance. SIAM J. Comput. 46(1): 58-79 (2017) - [c25]Michael B. Cohen, Jonathan A. Kelner, John Peebles, Richard Peng, Anup B. Rao, Aaron Sidford, Adrian Vladu:
Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs. STOC 2017: 410-419 - 2016
- [c24]Boaz Barak, Samuel B. Hopkins, Jonathan A. Kelner, Pravesh Kothari, Ankur Moitra, Aaron Potechin:
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem. FOCS 2016: 428-437 - [c23]Michael B. Cohen, Jonathan A. Kelner, John Peebles, Richard Peng, Aaron Sidford, Adrian Vladu:
Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More. FOCS 2016: 583-592 - [i18]Boaz Barak, Samuel B. Hopkins, Jonathan A. Kelner, Pravesh Kothari, Ankur Moitra, Aaron Potechin:
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem. CoRR abs/1604.03084 (2016) - [i17]Michael B. Cohen, Jonathan A. Kelner, John Peebles, Richard Peng, Aaron Sidford, Adrian Vladu:
Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More. CoRR abs/1608.03270 (2016) - [i16]Michael B. Cohen, Jonathan A. Kelner, John Peebles, Richard Peng, Anup B. Rao, Aaron Sidford, Adrian Vladu:
Almost-Linear-Time Algorithms for Markov Chains and New Spectral Primitives for Directed Graphs. CoRR abs/1611.00755 (2016) - [i15]Boaz Barak, Samuel B. Hopkins, Jonathan A. Kelner, Pravesh Kothari, Ankur Moitra, Aaron Potechin:
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c22]Boaz Barak, Jonathan A. Kelner, David Steurer:
Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method. STOC 2015: 143-151 - 2014
- [c21]Jonathan A. Kelner, Yin Tat Lee, Lorenzo Orecchia, Aaron Sidford:
An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations. SODA 2014: 217-226 - [c20]Boaz Barak, Jonathan A. Kelner, David Steurer:
Rounding sum-of-squares relaxations. STOC 2014: 31-40 - [i14]Boaz Barak, Jonathan A. Kelner, David Steurer:
Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method. CoRR abs/1407.1543 (2014) - 2013
- [j6]Jonathan A. Kelner, Alex Levin:
Spectral Sparsification in the Semi-streaming Setting. Theory Comput. Syst. 53(2): 243-262 (2013) - [j5]Animashree Anandkumar, Avinatan Hassidim, Jonathan A. Kelner:
Topology discovery of sparse random graphs with few participants. Random Struct. Algorithms 43(1): 16-48 (2013) - [c19]Jonathan A. Kelner, Lorenzo Orecchia, Aaron Sidford, Zeyuan Allen Zhu:
A simple, combinatorial algorithm for solving SDD systems in nearly-linear time. STOC 2013: 911-920 - [i13]Jonathan A. Kelner, Lorenzo Orecchia, Aaron Sidford, Zeyuan Allen Zhu:
A Simple, Combinatorial Algorithm for Solving SDD Systems in Nearly-Linear Time. CoRR abs/1301.6628 (2013) - [i12]Jonathan A. Kelner, Lorenzo Orecchia, Yin Tat Lee, Aaron Sidford:
An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations. CoRR abs/1304.2338 (2013) - [i11]Boaz Barak, Jonathan A. Kelner, David Steurer:
Rounding Sum-of-Squares Relaxations. CoRR abs/1312.6652 (2013) - [i10]Boaz Barak, Jonathan A. Kelner, David Steurer:
Rounding Sum-of-Squares Relaxations. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j4]Scott Aaronson, Edward Farhi, David Gosset, Avinatan Hassidim, Jonathan A. Kelner, Andrew Lutomirski:
Quantum money. Commun. ACM 55(8): 84-92 (2012) - [c18]Zeyuan Allen Zhu, Sasa Misailovic, Jonathan A. Kelner, Martin C. Rinard:
Randomized accuracy-aware program transformations for efficient approximate computations. POPL 2012: 441-454 - [c17]Jonathan A. Kelner, Gary L. Miller, Richard Peng:
Faster approximate multicommodity flow using quadratically coupled flows. STOC 2012: 1-18 - [c16]Boaz Barak, Fernando G. S. L. Brandão, Aram W. Harrow, Jonathan A. Kelner, David Steurer, Yuan Zhou:
Hypercontractivity, sum-of-squares proofs, and their applications. STOC 2012: 307-326 - [c15]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 - [i9]Jonathan A. Kelner, Gary L. Miller, Richard Peng:
Faster Approximate Multicommodity Flow Using Quadratically Coupled Flows. CoRR abs/1202.3367 (2012) - [i8]Boaz Barak, Fernando G. S. L. Brandão, Aram W. Harrow, Jonathan A. Kelner, David Steurer, Yuan Zhou:
Hypercontractivity, Sum-of-Squares Proofs, and their Applications. CoRR abs/1205.4484 (2012) - 2011
- [j3]Jonathan A. Kelner, Petar Maymounkov:
Electric routing and concurrent flow cutting. Theor. Comput. Sci. 412(32): 4123-4135 (2011) - [c14]Animashree Anandkumar, Avinatan Hassidim, Jonathan A. Kelner:
Topology discovery of sparse random graphs with few participants. SIGMETRICS 2011: 293-304 - [c13]Jonathan A. Kelner, Alex Levin:
Spectral Sparsification in the Semi-Streaming Setting. STACS 2011: 440-451 - [c12]Paul F. 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 - [i7]Animashree Anandkumar, Avinatan Hassidim, Jonathan A. Kelner:
Topology Discovery of Sparse Random Graphs With Few Participants. CoRR abs/1102.5063 (2011) - [i6]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) - 2010
- [c11]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 - [i5]Jonathan A. Kelner, James R. Lee, Gregory N. Price, Shang-Hua Teng:
Metric uniformization and spectral bounds for graphs. CoRR abs/1008.3594 (2010) - [i4]Paul F. 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)
2000 – 2009
- 2009
- [c10]Jonathan A. Kelner, Aleksander Madry:
Faster Generation of Random Spanning Trees. FOCS 2009: 13-21 - [c9]Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguyen, Krzysztof Onak:
Local Graph Partitions for Approximation and Testing. FOCS 2009: 22-31 - [c8]Jonathan A. Kelner, James R. Lee, Gregory N. Price, Shang-Hua Teng:
Higher Eigenvalues of Graphs. FOCS 2009: 735-744 - [c7]Samuel I. Daitch, Jonathan A. Kelner, Daniel A. Spielman:
Fitting a graph to vector data. ICML 2009: 201-208 - [c6]Jonathan A. Kelner, Petar Maymounkov:
Electric Routing and Concurrent Flow Cutting. ISAAC 2009: 792-801 - [i3]Jonathan A. Kelner, Aleksander Madry:
Faster generation of random spanning trees. CoRR abs/0908.1448 (2009) - [i2]Jonathan A. Kelner, Petar Maymounkov:
Electric routing and concurrent flow cutting. CoRR abs/0909.2859 (2009) - 2007
- [c5]Jonathan A. Kelner, Evdokia Nikolova:
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization. FOCS 2007: 472-482 - 2006
- [b1]Jonathan A. Kelner:
New geometric techniques for linear programming and graph partitioning. Massachusetts Institute of Technology, Cambridge, MA, USA, 2006 - [j2]Jonathan A. Kelner:
Spectral Partitioning, Eigenvalue Bounds, and Circle Packings for Graphs of Bounded Genus. SIAM J. Comput. 35(4): 882-902 (2006) - [c4]Evdokia Nikolova, Jonathan A. Kelner, Matthew Brand, Michael Mitzenmacher:
Stochastic Shortest Paths Via Quasi-convex Maximization. ESA 2006: 552-563 - [c3]Jonathan A. Kelner, Daniel A. Spielman:
A randomized polynomial-time simplex algorithm for linear programming. STOC 2006: 51-60 - 2005
- [i1]Jonathan A. Kelner, Daniel A. Spielman:
A Randomized Polynomial-Time Simplex Algorithm for Linear Programming (Preliminary Version). Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [c2]Jonathan A. Kelner:
Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus. STOC 2004: 455-464 - 2002
- [j1]Vivek K. Goyal, Jonathan A. Kelner, Jelena Kovacevic:
Multiple description vector quantization with a coarse lattice. IEEE Trans. Inf. Theory 48(3): 781-788 (2002) - 2000
- [c1]Jonathan A. Kelner, Vivek K. Goyal, Jelena Kovacevic:
Multiple Description Lattice Vector Quantization: Variations and Extensions. Data Compression Conference 2000: 480-489
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
