Round Compression for Parallel Matching Algorithms

Round Compression for Parallel Matching Algorithms

Show other versions (1)

© 2019 Society for Industrial and Applied Mathematics For over a decade now we have been witnessing the success of massive parallel computation frameworks, such as MapReduce, Hadoop, Dryad, or Spark. Compared to the classic distributed algorithms or PRAM models, these frameworks allow for much more...

Full description

Bibliographic Details
Main Authors: Czumaj, Artur, Ła̧cki, Jakub, Ma̧dry, Aleksander, Mitrović, Slobodan, Onak, Krzysztof, Sankowski, Piotr
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Format: Article
Language:English
Published: Society for Industrial & Applied Mathematics (SIAM) 2021
Online Access:https://hdl.handle.net/1721.1/133650

Internet

https://hdl.handle.net/1721.1/133650

Similar Items