Parallelism in Sequential Algorithms
[Back to full publication list]
- 2022:[6] Many Sequential Iterative Algorithms Can Be Parallel and (Nearly) Work-efficient
Zheqi Shen, Zijin Wan, Yan Gu, and Yihan Sun
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2022Parallelizing sequential algorithms for LIS, activity selection, Huffman tree, MIS, and Dijkstra's algorithm.Paper ArXiV Slides - 2020:[5] Randomized Incremental Convex Hull is Highly Parallel
Guy E. Blelloch, Yan Gu, Julian Shun, and Yihan Sun
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2020Parallel incremental algorithm for convex hullPaper Video -
[4]
Parallelism in Randomized Incremental Algorithms
Guy E. Blelloch, Yan Gu, Julian Shun, and Yihan Sun
Journal of the ACM (JACM), 2020Parallel incremental algorithms for sorting, Delaunay triangulation, closest pair, smallest enclosing disk, SCC, LE listPaper - 2018:[3] Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry
Guy E. Blelloch, Yan Gu, Yihan Sun, and Julian Shun
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2018Parallel randomized incremental algorithm on Delaunay triangulationPaper ArXiV - 2016:[2] Parallelism in Randomized Incremental Algorithms
Guy E. Blelloch, Yan Gu, Julian Shun, and Yihan Sun
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016Parallel randomized incremental algorithms for sorting, Delaunay triangulation, closest pair, smallest enclosing disk, SCC, LE listPaper ArXiV - 2015:[1] Sequential Random Permutation, List Contraction and Tree Contraction are Highly Parallel
Julian Shun, Yan Gu, Guy E. Blelloch, Jeremy T. Fineman, and Phillip B. Gibbons
ACM-SIAM Symposium on Discrete Algorithms (SODA), 2015Work-efficient polylog-span algorithms for random permutation, list/tree contractionPaper