Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Almost-Linear-Time Algorithms for Markov Chains and New Spectral Primitives for Directed Graphs.

M. Cohen, J. Kelner, J. Peebles, R. Peng, A. Rao, A. Sidford, and A. Vladu. CoRR, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Judith Kelner

Jonathan Roth

Jonathan Cavanagh

Jonathan Burmeister

Jonathan Vöglein

Other publications of authors with the same name

Multiple description vector quantization with a coarse lattice.V. Goyal, J. Kelner, and J. Kovacevic. IEEE Trans. Inf. Theory, 48 (3): 781-788 (2002)A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem.B. Barak, S. Hopkins, J. Kelner, P. Kothari, A. Moitra, and A. Potechin. SIAM J. Comput., 48 (2): 687-735 (2019)Learning Some Popular Gaussian Graphical Models without Condition Number Bounds.J. Kelner, F. Koehler, R. Meka, and A. Moitra. CoRR, (2019)Distributional Hardness Against Preconditioned Lasso via Erasure-Robust Designs.J. Kelner, F. Koehler, R. Meka, and D. Rohatgi. CoRR, (2022)Lasso with Latents: Efficient Estimation, Covariate Rescaling, and Computational-Statistical Gaps.J. Kelner, F. Koehler, R. Meka, and D. Rohatgi. CoRR, (2024)Big-Step-Little-Step: Efficient Gradient Methods for Objectives with Multiple Scales.J. Kelner, A. Marsden, V. Sharan, A. Sidford, G. Valiant, and H. Yuan. CoRR, (2021)Spectral Sparsification in the Semi-Streaming Setting.J. Kelner, and A. Levin. STACS, volume 9 of LIPIcs, page 440-451. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)Topology discovery of sparse random graphs with few participants.A. Anandkumar, A. Hassidim, and J. Kelner. SIGMETRICS, page 293-304. ACM, (2011)Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations.M. Cohen, J. Kelner, R. Kyng, J. Peebles, R. Peng, A. Rao, and A. Sidford. FOCS, page 898-909. IEEE Computer Society, (2018)Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected GraphsP. Christiano, J. Kelner, A. Madry, D. Spielman, and S. Teng. Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing, page 273--282. New York, NY, USA, ACM, (2011)

BibSonomy

Disambiguation of "Kelner, Jonathan A."

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Almost-Linear-Time Algorithms for Markov Chains and New Spectral Primitives for Directed Graphs.

Please choose a person to relate this publication to

Judith Kelner

Jonathan Roth

Jonathan Cavanagh

Jonathan Burmeister

Jonathan Vöglein

Other publications of authors with the same name

Disambiguation

BibSonomy

Disambiguation of "Kelner, Jonathan A."

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML Almost-Linear-Time Algorithms for Markov Chains and New Spectral Primitives for Directed Graphs.

Please choose a person to relate this publication to

Judith Kelner

Jonathan Roth

Jonathan Cavanagh

Jonathan Burmeister

Jonathan Vöglein

Other publications of authors with the same name

Disambiguation

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Almost-Linear-Time Algorithms for Markov Chains and New Spectral Primitives for Directed Graphs.