Author of the publication

A randomized polynomial-time simplex algorithm for linear programming.

, and . STOC, page 51-60. ACM, (2006)

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.

 

Other publications of authors with the same name

Learning Some Popular Gaussian Graphical Models without Condition Number Bounds., , , and . CoRR, (2019)Multiple description vector quantization with a coarse lattice., , and . IEEE Trans. Inf. Theory, 48 (3): 781-788 (2002)Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations., , , , , , and . FOCS, page 898-909. IEEE Computer Society, (2018)Topology discovery of sparse random graphs with few participants., , and . SIGMETRICS, page 293-304. ACM, (2011)Spectral Sparsification in the Semi-Streaming Setting., and . STACS, volume 9 of LIPIcs, page 440-451. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)High-precision Estimation of Random Walks in Small Space., , , , , and . CoRR, (2019)Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs, , , , and . Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing, page 273--282. New York, NY, USA, ACM, (2011)High-precision Estimation of Random Walks in Small Space., , , , , and . FOCS, page 1295-1306. IEEE, (2020)Semi-Random Sparse Recovery in Nearly-Linear Time., , , , and . COLT, volume 195 of Proceedings of Machine Learning Research, page 2352-2398. PMLR, (2023)Big-Step-Little-Step: Efficient Gradient Methods for Objectives with Multiple Scales., , , , , and . COLT, volume 178 of Proceedings of Machine Learning Research, page 2431-2540. PMLR, (2022)