Author of the publication

Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams.

, and . APPROX-RANDOM, volume 81 of LIPIcs, page 15:1-15:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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

Weighted Matchings via Unweighted Augmentations., , , and . CoRR, (2018)Beating Greedy for Stochastic Bipartite Matching., , and . SODA, page 2841-2854. SIAM, (2019)Faster Algorithms for Bounded Liveness in Graphs and Game Graphs., , , and . ICALP, volume 198 of LIPIcs, page 124:1-124:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Small Space Stream Summary for Matroid Center.. CoRR, (2018)Strong Fooling Sets for Multi-player Communication with Applications to Deterministic Estimation of Stream Statistics., and . FOCS, page 41-50. IEEE Computer Society, (2016)Weighted Matchings via Unweighted Augmentations., , , and . PODC, page 491-500. ACM, (2019)Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams., and . APPROX-RANDOM, volume 81 of LIPIcs, page 15:1-15:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Submodular Maximization Meets Streaming: Matchings, Matroids, and More., and . IPCO, volume 8494 of Lecture Notes in Computer Science, page 210-221. Springer, (2014)Fully-Dynamic Coresets., and . ESA, volume 173 of LIPIcs, page 57:1-57:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Small Space Stream Summary for Matroid Center.. APPROX-RANDOM, volume 145 of LIPIcs, page 20:1-20:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)