( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams.

, и . APPROX-RANDOM, том 81 из LIPIcs, стр. 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.

Vidya Sagar

Devika Kale

Rasim Kale

Anubha Sagar

Pramod Sagar

 

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

Beating Greedy for Stochastic Bipartite Matching., , и . SODA, стр. 2841-2854. SIAM, (2019)Weighted Matchings via Unweighted Augmentations., , , и . CoRR, (2018)Faster Algorithms for Bounded Liveness in Graphs and Game Graphs., , , и . ICALP, том 198 из LIPIcs, стр. 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., и . FOCS, стр. 41-50. IEEE Computer Society, (2016)Submodular Maximization Meets Streaming: Matchings, Matroids, and More., и . IPCO, том 8494 из Lecture Notes in Computer Science, стр. 210-221. Springer, (2014)Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams., и . APPROX-RANDOM, том 81 из LIPIcs, стр. 15:1-15:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Weighted Matchings via Unweighted Augmentations., , , и . PODC, стр. 491-500. ACM, (2019)Fully-Dynamic Coresets., и . ESA, том 173 из LIPIcs, стр. 57:1-57:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Robust Algorithms Under Adversarial Injections., , , и . ICALP, том 168 из LIPIcs, стр. 56:1-56:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)