Round compression for parallel matching algorithms-Reference-Cited by-同舟云学术

Round compression for parallel matching algorithms

Published:2018-06-20 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Czumaj Artur¹,Łącki Jakub²,Mądry Aleksander³,Mitrović Slobodan⁴,Onak Krzysztof⁵,Sankowski Piotr⁶

Affiliation:

1. University of Warwick, UK

2. Google Research, USA

3. Massachusetts Institute of Technology, USA

4. EPFL, Switzerland

5. IBM Research, USA

6. University of Warsaw, Poland

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3188745.3188764

Reference60 articles.

1. Access to Data and Number of Iterations

2. A fast and simple randomized parallel algorithm for the maximal independent set problem

3. Alexandr Andoni Aleksandar Nikolov Krzysztof Onak and Grigory Yaroslavtsev. 2014. Alexandr Andoni Aleksandar Nikolov Krzysztof Onak and Grigory Yaroslavtsev. 2014.

4. Parallel algorithms for geometric graph problems

Cited by 38 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Massively Parallel Algorithms for Approximate Shortest Paths;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17

2. Streaming Graph Algorithms in the Massively Parallel Computation Model;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17

3. Parallel Derandomization for Coloring*;2024 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2024-05-27

4. Deterministic Massively Parallel Connectivity;SIAM Journal on Computing;2023-10-27

5. Exponentially Faster Massively Parallel Maximal Matching;Journal of the ACM;2023-10-11