Parallelism in Randomized Incremental Algorithms
Main Authors: | Blelloch, Guy, Gu, Yan, Shun, Julian, Sun, Yihan |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | English |
Published: |
ACM
2022
|
Online Access: | https://hdl.handle.net/1721.1/146176 |
Similar Items
-
Randomized Incremental Convex Hull is Highly Parallel
by: Blelloch, Guy, et al.
Published: (2022) -
Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry
by: Blelloch, Guy E, et al.
Published: (2021) -
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
by: Dhulipala, Laxman, et al.
Published: (2022) -
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
by: Dhulipala, Laxman, et al.
Published: (2021) -
Sage: parallel semi-asymmetric graph algorithms for NVRAMs
by: Dhulipala, Laxman, et al.
Published: (2021)