Brief Announcement: Deterministic Massively Parallel Algorithms for Ruling Sets-Reference-Cited by-同舟云学术

Brief Announcement: Deterministic Massively Parallel Algorithms for Ruling Sets

Published:2022-07-20 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing
language:
Short-container-title:

Author:

Pai Shreyas¹,Pemmaraju Sriram V.²

Affiliation:

1. Aalto University, Espoo, Finland

2. The University of Iowa, Iowa City, IA, USA

Publisher

ACM

Link

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

Reference14 articles.

1. Keren Censor-Hillel , Merav Parter , and Gregory Schwartzman . 2017 . Derandomizing Local Distributed Algorithms under Bandwidth Restrictions . In 31st International Symposium on Distributed Computing, DISC 2017 , October 16 --20 , 2017, Vienna, Austria (LIPIcs, Vol. 91). https://doi.org/ 10 .4230/LIPIcs.DISC.2017.11 10.4230/LIPIcs.DISC.2017.11 Keren Censor-Hillel, Merav Parter, and Gregory Schwartzman. 2017. Derandomizing Local Distributed Algorithms under Bandwidth Restrictions. In 31st International Symposium on Distributed Computing, DISC 2017, October 16--20, 2017, Vienna, Austria (LIPIcs, Vol. 91). https://doi.org/10.4230/LIPIcs.DISC.2017.11

2. Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space

3. James W. Hegeman , Sriram V. Pemmaraju , and Vivek Sardeshmukh . 2014 . Near-Constant-Time Distributed Algorithms on a Congested Clique. In Distributed Computing - 28th International Symposium , DISC 2014, Austin, TX, USA, October 12--15, 2014. Proceedings (Lecture Notes in Computer Science , Vol. 8784), Fabian Kuhn (Ed.). Springer, 514-- 530 . https://doi.org/10.1007/978--3--662--45174--8_35 10.1007/978--3--662--45174--8_35 James W. Hegeman, Sriram V. Pemmaraju, and Vivek Sardeshmukh. 2014. Near-Constant-Time Distributed Algorithms on a Congested Clique. In Distributed Computing - 28th International Symposium, DISC 2014, Austin, TX, USA, October 12--15, 2014. Proceedings (Lecture Notes in Computer Science, Vol. 8784), Fabian Kuhn (Ed.). Springer, 514--530. https://doi.org/10.1007/978--3--662--45174--8_35

4. James W. Hegeman , Sriram V. Pemmaraju , and Vivek Sardeshmukh . 2014. Near-Constant-Time Distributed Algorithms on a Congested Clique. CoRR abs/1408.2071 ( 2014 ). arXiv:1408.2071 http://arxiv.org/abs/1408.2071 James W. Hegeman, Sriram V. Pemmaraju, and Vivek Sardeshmukh. 2014. Near-Constant-Time Distributed Algorithms on a Congested Clique. CoRR abs/1408.2071 (2014). arXiv:1408.2071 http://arxiv.org/abs/1408.2071

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

1. Brief Announcement: Massively Parallel Ruling Set Made Deterministic;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17

2. Deterministic Massively Parallel Symmetry Breaking for Sparse Graphs;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17