Author of the publication

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

Streaming and Massively Parallel Algorithms for Edge Coloring., , , , and . ESA, volume 144 of LIPIcs, page 15:1-15:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Adaptive Massively Parallel Constant-Round Tree Contraction., , , and . ITCS, volume 215 of LIPIcs, page 83:1-83:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)String Matching with Wildcards in the Massively Parallel Computation Model., , , and . SPAA, page 275-284. ACM, (2021)Computational Analyses of the Electoral College: Campaigning Is Hard But Approximately Manageable., , , and . AAAI, page 5294-5302. AAAI Press, (2021)Fair Allocation of Indivisible Items With Externalities., , and . CoRR, (2018)Parallel Algorithms for Processing Massive Texts and Graphs.. University of Maryland, College Park, MD, USA, (2022)base-search.net (ftunivmaryland:oai:drum.lib.umd.edu:1903/29927).Adaptive Massively Parallel Algorithms for Cut Problems., , , and . SPAA, page 23-33. ACM, (2022)Location-Sensitive String Problems in MPC., , , and . SPAA, page 101-111. ACM, (2023)Brief Announcement: Streaming and Massively Parallel Algorithms for Edge Coloring., , , , and . DISC, volume 146 of LIPIcs, page 36:1-36:3. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance., , , , , and . FOCS, page 686-697. IEEE, (2022)