Provably Fast and Space-Efficient Parallel Biconnectivity-Reference-Cited by-同舟云学术

Provably Fast and Space-Efficient Parallel Biconnectivity

Published:2023-02-21 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming
language:
Short-container-title:

Author:

Dong Xiaojun¹,Wang Letong¹,Gu Yan¹,Sun Yihan¹

Affiliation:

1. UC Riverside

Funder

National Science Foundation

Publisher

ACM

Link

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

Reference73 articles.

1. 2010. OpenStreetMap © OpenStreetMap contributors. https://www.openstreetmap.org/. 2010. OpenStreetMap © OpenStreetMap contributors. https://www.openstreetmap.org/.

2. Parallel computational geometry

3. Kunal Agrawal , Jeremy T. Fineman , Kefu Lu , Brendan Sheridan , Jim Sukha , and Robert Utterback . 2014 . Provably Good Scheduling for Parallel Programs That Use Data Structures Through Implicit Batching. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). Kunal Agrawal, Jeremy T. Fineman, Kefu Lu, Brendan Sheridan, Jim Sukha, and Robert Utterback. 2014. Provably Good Scheduling for Parallel Programs That Use Data Structures Through Implicit Batching. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA).

4. The problem-based benchmark suite (PBBS), V2

5. Cache-oblivious priority queue and graph algorithm applications

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

1. Brief Announcement: PASGAL: Parallel And Scalable Graph Algorithm Library;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17

2. Teaching Parallel Algorithms Using the Binary-Forking Model;2024 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW);2024-05-27

3. High-Performance and Flexible Parallel Algorithms for Semisort and Related Problems;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17