Jonathan Kelner

From MaRDI portal
Person:201076

Available identifiers

zbMath Open kelner.jonathan-aDBLP64/4772WikidataQ102300399 ScholiaQ102300399MaRDI QIDQ201076

List of research outcomes





PublicationDate of PublicationType
An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations2019-06-20Paper
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem2019-05-07Paper
Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs2017-08-17Paper
Rumor Spreading with No Dependence on Conductance2017-02-15Paper
Randomized accuracy-aware program transformations for efficient approximate computations2015-09-11Paper
Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method2015-08-21Paper
Rounding sum-of-squares relaxations2015-06-26Paper
A randomized polynomial-time simplex algorithm for linear programming2014-11-25Paper
A simple, combinatorial algorithm for solving SDD systems in nearly-linear time2014-08-07Paper
Local Graph Partitions for Approximation and Testing2014-07-25Paper
Faster Generation of Random Spanning Trees2014-07-25Paper
Higher Eigenvalues of Graphs2014-07-25Paper
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs2014-06-05Paper
Global computation in a poorly connected world2014-05-13Paper
Hypercontractivity, sum-of-squares proofs, and their applications2014-05-13Paper
Faster approximate multicommodity flow using quadratically coupled flows2014-05-13Paper
Spectral sparsification in the semi-streaming setting2013-10-21Paper
Topology discovery of sparse random graphs with few participants2013-08-27Paper
Metric uniformization and spectral bounds for graphs2012-01-24Paper
Spectral sparsification in the semi-streaming setting2012-01-23Paper
https://portal.mardi4nfdi.de/entity/Q30994022011-12-01Paper
Electric routing and concurrent flow cutting2011-07-27Paper
Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus2010-08-15Paper
Electric routing and concurrent flow cutting2009-12-17Paper
Stochastic Shortest Paths Via Quasi-convex Maximization2008-03-11Paper
Spectral Partitioning, Eigenvalue Bounds, and Circle Packings for Graphs of Bounded Genus2006-06-01Paper
Multiple description vector quantization with a coarse lattice2002-08-04Paper
Quantized frame expansions with erasures2001-09-09Paper
Learning Mixtures of Gaussians Using Diffusion ModelsN/APaper

Research outcomes over time

This page was built for person: Jonathan Kelner