| Quantized frame expansions with erasures VK Goyal, J Kovačević, JA Kelner Applied and Computational Harmonic Analysis 10 (3), 203-233, 2001 | 632 | 2001 |
| Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs P Christiano, JA Kelner, A Madry, DA Spielman, SH Teng Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 405 | 2011 |
| An almost-linear-time algorithm for approximate max flow in undirected graphs, and its multicommodity generalizations JA Kelner, YT Lee, L Orecchia, A Sidford Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014 | 325 | 2014 |
| A simple, combinatorial algorithm for solving SDD systems in nearly-linear time JA Kelner, L Orecchia, A Sidford, ZA Zhu Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013 | 289 | 2013 |
| A nearly tight sum-of-squares lower bound for the planted clique problem B Barak, S Hopkins, J Kelner, PK Kothari, A Moitra, A Potechin SIAM Journal on Computing 48 (2), 687-735, 2019 | 257 | 2019 |
| Hypercontractivity, sum-of-squares proofs, and their applications B Barak, FGSL Brandao, AW Harrow, J Kelner, D Steurer, Y Zhou Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012 | 256 | 2012 |
| Large‐scale identification of genetic design strategies using local search DS Lun, G Rockwell, NJ Guido, M Baym, JA Kelner, B Berger, JE Galagan, ... molecular systems biology 5 (1), 296, 2009 | 210 | 2009 |
| Stochastic shortest paths via quasi-convex maximization E Nikolova, JA Kelner, M Brand, M Mitzenmacher Algorithms–ESA 2006: 14th Annual European Symposium, Zurich, Switzerland …, 2006 | 203 | 2006 |
| Dictionary learning and tensor decomposition via the sum-of-squares method B Barak, JA Kelner, D Steurer Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015 | 192 | 2015 |
| Fitting a graph to vector data SI Daitch, JA Kelner, DA Spielman Proceedings of the 26th annual international conference on machine learning …, 2009 | 154 | 2009 |
| Local graph partitions for approximation and testing A Hassidim, JA Kelner, HN Nguyen, K Onak 2009 50th Annual IEEE Symposium on Foundations of Computer Science, 22-31, 2009 | 152 | 2009 |
| A randomized polynomial-time simplex algorithm for linear programming JA Kelner, DA Spielman Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006 | 124 | 2006 |
| Randomized accuracy-aware program transformations for efficient approximate computations ZA Zhu, S Misailovic, JA Kelner, M Rinard ACM SIGPLAN Notices 47 (1), 441-454, 2012 | 123 | 2012 |
| Faster generation of random spanning trees JA Kelner, A Madry 2009 50th Annual IEEE Symposium on Foundations of Computer Science, 13-21, 2009 | 121 | 2009 |
| Spectral sparsification in the semi-streaming setting JA Kelner, A Levin Theory of Computing Systems 53 (2), 243-262, 2013 | 116 | 2013 |
| Almost-linear-time algorithms for markov chains and new spectral primitives for directed graphs MB Cohen, J Kelner, J Peebles, R Peng, AB Rao, A Sidford, A Vladu Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 112 | 2017 |
| Rounding sum-of-squares relaxations B Barak, JA Kelner, D Steurer Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014 | 109 | 2014 |
| Multiple description vector quantization with a coarse lattice VK Goyal, JA Kelner, J Kovacevic IEEE Transactions on Information Theory 48 (3), 781-788, 2002 | 95 | 2002 |
| Global computation in a poorly connected world: fast rumor spreading with no dependence on conductance K Censor-Hillel, B Haeupler, J Kelner, P Maymounkov Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012 | 87 | 2012 |
| Faster algorithms for computing the stationary distribution, simulating random walks, and more MB Cohen, J Kelner, J Peebles, R Peng, A Sidford, A Vladu 2016 IEEE 57th annual symposium on foundations of computer science (FOCS …, 2016 | 67 | 2016 |
