A Parallel Batch-Dynamic Data Structure for the Closest Pair Problem | 0 | 0.34 | 2021 |
Parallelism in Randomized Incremental Algorithms | 0 | 0.34 | 2020 |
Randomized Incremental Convex Hull is Highly Parallel | 1 | 0.34 | 2020 |
Optimal Parallel Algorithms in the Binary-Forking Model. | 0 | 0.34 | 2019 |
Algorithmic Building Blocks for Asymmetric Memories. | 2 | 0.36 | 2018 |
Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry. | 2 | 0.36 | 2018 |
Parallel Algorithms for Asymmetric Read-Write Costs. | 9 | 0.51 | 2016 |
A New Efficient Construction on Probabilistic Tree Embeddings. | 1 | 0.34 | 2016 |
Sorting with Asymmetric Read and Write Costs. | 11 | 0.55 | 2016 |
Sequential random permutation, list contraction and tree contraction are highly parallel | 8 | 0.50 | 2015 |
Efficient Algorithms under Asymmetric Read and Write Costs | 1 | 0.34 | 2015 |
Ray Specialized Contraction on Bounding Volume Hierarchies | 3 | 0.39 | 2015 |
A Top-Down Parallel Semisort | 5 | 0.38 | 2015 |