Adaptive Massively Parallel Algorithms for Cut Problems-Reference-Cited by-同舟云学术

Adaptive Massively Parallel Algorithms for Cut Problems

Published:2022-07-11 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures
language:
Short-container-title:

Author:

Hajiaghayi MohammadTaghi¹,Knittel Marina¹,Olkowski Jan¹,Saleh Hamed¹

Affiliation:

1. University of Maryland, College Park, MD, USA

Funder

The National Science Foundation

Publisher

ACM

Link

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

Reference21 articles.

1. Alexandr Andoni Aleksandar Nikolov Krzysztof Onak and Grigory Yaroslavtsev. 2014. Parallel algorithms for geometric graph problems. In STOC. 574--583. Alexandr Andoni Aleksandar Nikolov Krzysztof Onak and Grigory Yaroslavtsev. 2014. Parallel algorithms for geometric graph problems. In STOC. 574--583.

2. Soheil Behnezhad , Laxman Dhulipala , Hossein Esfandiari , Jakub Lacki , and Vahab S . Mirrokni . 2019 . Near-Optimal Massively Parallel Graph Connectivity. In FOCS. 1615--1636. Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, and Vahab S. Mirrokni. 2019. Near-Optimal Massively Parallel Graph Connectivity. In FOCS. 1615--1636.

3. Massively Parallel Computation via Remote Memory Access

4. Parallel graph algorithms in constant adaptive rounds

5. Soheil Behnezhad , MohammadTaghi Hajiaghayi , and David G . Harris . 2019 . Exponentially Faster Massively Parallel Maximal Matching. In FOCS. 1637--1649. Soheil Behnezhad, MohammadTaghi Hajiaghayi, and David G. Harris. 2019. Exponentially Faster Massively Parallel Maximal Matching. In FOCS. 1637--1649.

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

1. Massively Parallel Tree Embeddings for High Dimensional Spaces;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17

2. Adaptive Massively Parallel Connectivity in Optimal Space;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17