( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs

, , , , и . Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing, стр. 273--282. New York, NY, USA, ACM, (2011)
DOI: 10.1145/1993636.1993674

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.

Judith Kelner

Jonathan Roth

Jonathan Cavanagh

Jonathan Burmeister

Jonathan Vöglein

 

Другие публикации лиц с тем же именем

Multiple description vector quantization with a coarse lattice., , и . IEEE Trans. Inf. Theory, 48 (3): 781-788 (2002)Big-Step-Little-Step: Efficient Gradient Methods for Objectives with Multiple Scales., , , , , и . CoRR, (2021)Lasso with Latents: Efficient Estimation, Covariate Rescaling, and Computational-Statistical Gaps., , , и . CoRR, (2024)Topology discovery of sparse random graphs with few participants., , и . SIGMETRICS, стр. 293-304. ACM, (2011)Spectral Sparsification in the Semi-Streaming Setting., и . STACS, том 9 из LIPIcs, стр. 440-451. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)Learning Some Popular Gaussian Graphical Models without Condition Number Bounds., , , и . CoRR, (2019)A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem., , , , , и . SIAM J. Comput., 48 (2): 687-735 (2019)Distributional Hardness Against Preconditioned Lasso via Erasure-Robust Designs., , , и . CoRR, (2022)Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations., , , , , , и . FOCS, стр. 898-909. IEEE Computer Society, (2018)Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs, , , , и . Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing, стр. 273--282. New York, NY, USA, ACM, (2011)