Fast Dynamic Programming in Trees in the MPC Model-Reference-Cited by-同舟云学术

Fast Dynamic Programming in Trees in the MPC Model

Published:2023-06-17 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures
language:
Short-container-title:

Author:

Gupta Chetan¹^ORCID,Latypov Rustam¹^ORCID,Maus Yannic²^ORCID,Pai Shreyas¹^ORCID,Särkkä Simo¹^ORCID,Studený Jan¹^ORCID,Suomela Jukka¹^ORCID,Uitto Jara¹^ORCID,Vahidi Hossein¹^ORCID

Affiliation:

1. Aalto University, Espoo, Finland

2. TU Graz, Graz, Finland

Funder

Academy of Finland

Publisher

ACM

Link

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

Reference26 articles.

1. Alexandr Andoni , Zhao Song , Clifford Stein , Zhengyu Wang , and Peilin Zhong . 2018 . Parallel Graph Connectivity in Log Diameter Rounds. In 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018 , Paris, France , October 7-9, 2018, Mikkel Thorup (Ed.). IEEE Computer Society, 674--685. https://doi.org/10.1109/FOCS.2018.00070 10.1109/FOCS.2018.00070 Alexandr Andoni, Zhao Song, Clifford Stein, Zhengyu Wang, and Peilin Zhong. 2018. Parallel Graph Connectivity in Log Diameter Rounds. In 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, Mikkel Thorup (Ed.). IEEE Computer Society, 674--685. https://doi.org/10.1109/FOCS.2018.00070

2. Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs

3. Alkida Balliu , Sebastian Brandt , Manuela Fischer , Rustam Latypov , Yannic Maus , Dennis Olivetti , and Jara Uitto . 2022 . Exponential Speedup over Locality in MPC with Optimal Memory . In 36th International Symposium on Distributed Computing, DISC 2022 , October 25-27, 2022, Augusta, Georgia, USA (LIPIcs , Vol. 246),, Christian Scheideler (Ed.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 9:1--9: 21 . https://doi.org/10.4230/LIPIcs.DISC.2022.9 10.4230/LIPIcs.DISC.2022.9 Alkida Balliu, Sebastian Brandt, Manuela Fischer, Rustam Latypov, Yannic Maus, Dennis Olivetti, and Jara Uitto. 2022. Exponential Speedup over Locality in MPC with Optimal Memory. In 36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA (LIPIcs, Vol. 246),, Christian Scheideler (Ed.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 9:1--9:21. https://doi.org/10.4230/LIPIcs.DISC.2022.9

4. Optimal Deterministic Massively Parallel Connectivity on Forests

5. MohammadHossein Bateni , Soheil Behnezhad , Mahsa Derakhshan , MohammadTaghi Hajiaghayi , and Vahab S. Mirrokni . 2018a. Brief Announcement: MapReduce Algorithms for Massive Trees. In 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018 , July 9-13, 2018 , Prague, Czech Republic (LIPIcs , Vol. 107), Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, and Donald Sannella (Eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 162:1--162: 4 . https://doi.org/10.4230/LIPIcs.ICALP.2018.162 10.4230/LIPIcs.ICALP.2018.162 MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, and Vahab S. Mirrokni. 2018a. Brief Announcement: MapReduce Algorithms for Massive Trees. In 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic (LIPIcs, Vol. 107), Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, and Donald Sannella (Eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 162:1--162:4. https://doi.org/10.4230/LIPIcs.ICALP.2018.162