Available identifiers
zbMath Open kelner.jonathan-aWikidataQ102300399 ScholiaQ102300399MaRDI QIDQ201076
List of research outcomes
Publication | Date of Publication | Type |
---|
An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations | 2019-06-20 | Paper |
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem | 2019-05-07 | Paper |
Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs | 2017-08-17 | Paper |
Rumor Spreading with No Dependence on Conductance | 2017-02-15 | Paper |
Randomized accuracy-aware program transformations for efficient approximate computations | 2015-09-11 | Paper |
Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method | 2015-08-21 | Paper |
Rounding sum-of-squares relaxations | 2015-06-26 | Paper |
A randomized polynomial-time simplex algorithm for linear programming | 2014-11-25 | Paper |
A simple, combinatorial algorithm for solving SDD systems in nearly-linear time | 2014-08-07 | Paper |
Local Graph Partitions for Approximation and Testing | 2014-07-25 | Paper |
Faster Generation of Random Spanning Trees | 2014-07-25 | Paper |
Higher Eigenvalues of Graphs | 2014-07-25 | Paper |
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs | 2014-06-05 | Paper |
Faster approximate multicommodity flow using quadratically coupled flows | 2014-05-13 | Paper |
Hypercontractivity, sum-of-squares proofs, and their applications | 2014-05-13 | Paper |
Global computation in a poorly connected world | 2014-05-13 | Paper |
Spectral sparsification in the semi-streaming setting | 2013-10-21 | Paper |
Topology discovery of sparse random graphs with few participants | 2013-08-27 | Paper |
Metric uniformization and spectral bounds for graphs | 2012-01-24 | Paper |
https://portal.mardi4nfdi.de/entity/Q3113709 | 2012-01-23 | Paper |
https://portal.mardi4nfdi.de/entity/Q3099402 | 2011-12-01 | Paper |
Electric routing and concurrent flow cutting | 2011-07-27 | Paper |
Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus | 2010-08-15 | Paper |
Electric Routing and Concurrent Flow Cutting | 2009-12-17 | Paper |
Stochastic Shortest Paths Via Quasi-convex Maximization | 2008-03-11 | Paper |
Spectral Partitioning, Eigenvalue Bounds, and Circle Packings for Graphs of Bounded Genus | 2006-06-01 | Paper |
Multiple description vector quantization with a coarse lattice | 2002-08-04 | Paper |
Quantized frame expansions with erasures | 2001-09-09 | Paper |
Research outcomes over time
Doctoral students
No records found.
Known relations from the MaRDI Knowledge Graph
This page was built for person: Jonathan A. Kelner