Julienne-Reference-Cited by-同舟云学术

Julienne

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

Author:

Dhulipala Laxman¹,Blelloch Guy¹,Shun Julian²

Affiliation:

1. Carnegie Mellon University, Pittsburgh, PA, USA

2. University of California Berkeley, Berkeley, CA, USA

Funder

NSF

Publisher

ACM

Link

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

Reference61 articles.

1. The solution space geometry of random linear equations

2. R. Anderson and E. W. Mayr. A P-complete problem and approximations to it. Technical report 1984. R. Anderson and E. W. Mayr. A P-complete problem and approximations to it. Technical report 1984.

3. V. Batagelj and M. Zaversnik. An o(m) algorithm for cores decomposition of networks. CoRR cs.DS/0310049 2003. V. Batagelj and M. Zaversnik. An o(m) algorithm for cores decomposition of networks. CoRR cs.DS/0310049 2003.

4. Direction-optimizing Breadth-First Search

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

1. Multi Bucket Queues: Efficient Concurrent Priority Scheduling;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17

2. When Is Parallelism Fearless and Zero-Cost with Rust?;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17

3. Brief Announcement: Improved Massively Parallel Triangle Counting in O(1) Rounds;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17

4. DAWN: Matrix Operation-Optimized Algorithm for Shortest Paths Problem on Unweighted Graphs;Proceedings of the 38th ACM International Conference on Supercomputing;2024-05-30

5. Differentiating Set Intersections in Maximal Clique Enumeration by Function and Subproblem Size;Proceedings of the 38th ACM International Conference on Supercomputing;2024-05-30