`Travelled to:`

1 × Canada

8 × USA

`Collaborated with:`

D.A.Spielman B.Barak D.Steurer Z.A.Zhu ∅ G.L.Miller R.Peng S.I.Daitch L.Orecchia A.Sidford S.Misailovic M.C.Rinard K.Censor-Hillel B.Haeupler P.Maymounkov P.Christiano A.Madry S.Teng F.G.S.L.Brandão A.W.Harrow Y.Zhou

`Talks about:`

flow (4) approxim (3) squar (3) graph (3) sum (3) algorithm (2) program (2) system (2) random (2) linear (2)

## Person: Jonathan A. Kelner

### DBLP: Kelner:Jonathan_A=

### Contributed to:

### Wrote 11 papers:

- STOC-2015-BarakKS #composition #learning #taxonomy
- Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method (BB, JAK, DS), pp. 143–151.
- STOC-2014-BarakKS
- Rounding sum-of-squares relaxations (BB, JAK, DS), pp. 31–40.
- STOC-2013-KelnerOSZ #algorithm #combinator
- A simple, combinatorial algorithm for solving SDD systems in nearly-linear time (JAK, LO, AS, ZAZ), pp. 911–920.
- POPL-2012-ZhuMKR #approximate #performance #program transformation #random
- Randomized accuracy-aware program transformations for efficient approximate computations (ZAZ, SM, JAK, MCR), pp. 441–454.
- STOC-2012-BarakBHKSZ #proving
- Hypercontractivity, sum-of-squares proofs, and their applications (BB, FGSLB, AWH, JAK, DS, YZ), pp. 307–326.
- STOC-2012-Censor-HillelHKM #dependence #performance
- Global computation in a poorly connected world: fast rumor spreading with no dependence on conductance (KCH, BH, JAK, PM), pp. 961–970.
- STOC-2012-KelnerMP #approximate #multi #performance #using
- Faster approximate multicommodity flow using quadratically coupled flows (JAK, GLM, RP), pp. 1–18.
- STOC-2011-ChristianoKMST #approximate #graph #performance
- Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs (PC, JAK, AM, DAS, SHT), pp. 273–282.
- ICML-2009-DaitchKS #graph
- Fitting a graph to vector data (SID, JAK, DAS), pp. 201–208.
- STOC-2006-KelnerS #algorithm #linear #polynomial #programming #random
- A randomized polynomial-time simplex algorithm for linear programming (JAK, DAS), pp. 51–60.
- STOC-2004-Kelner #bound #clustering #graph
- Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus (JAK), pp. 455–464.