Publications - Parallel Randomized Incremental Algorithms

You can also find my publication list on Google Scholar and DBLP.

[Back to full publication list]

• 2023:
  [7] Parallel Longest Increasing Subsequence and van Emde Boas Trees
  Yan Gu, Ziyang Men, Zheqi Shen, Yihan Sun, and Zijin Wan
  
  SPAA
   ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2023
  
  Parallel incremental algorithm for LIS
  Conference paper  Full version (arXiv)  
• 2022:
  [6] Many Sequential Iterative Algorithms Can Be Parallel and (Nearly) Work-efficient
  Zheqi Shen, Zijin Wan, Yan Gu, and Yihan Sun
  
  SPAA
   ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2022
  
  Parallel incremental algorithm for greedy and DP algorithms
  Conference paper  Full version (arXiv)  
• 2020:
  [5] Randomized Incremental Convex Hull is Highly Parallel
  Guy E. Blelloch, Yan Gu, Julian Shun and Yihan Sun
  
  SPAA
   ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2020.
  
  Parallel incremental algorithm for convex hull
  Conference paper  Video  
• [4] Parallelism in Randomized Incremental Algorithms
  Guy E. Blelloch, Yan Gu, Julian Shun, and Yihan Sun
  
  JACM
   Journal of the ACM (JACM)
  
  Parallel incremental algorithms for sorting, Delaunay triangulation, closest pair, smallest enclosing disk, SCC, LE list
  Conference paper  Journal paper  
• 2018:
  [3] Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry
  Guy E. Blelloch, Yan Gu, Julian Shun and Yihan Sun
  
  SPAA
   ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2018
  
  Parallel incremental algorithm on Delaunay triangulation
  Conference paper  Full version (arXiv)  
• 2016:
  [2] Parallelism in Randomized Incremental Algorithms
  Guy Blelloch, Yan Gu, Julian Shun and Yihan Sun
  
  SPAA
   ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016.
  
  Parallel incremental algorithms for sorting, Delaunay triangulation, closest pair, smallest enclosing disk, SCC, LE list
  Conference paper  Full version (arXiv)  
• 2015:
  [1] Sequential Random Permutation, List Contraction and Tree Contraction are Highly Parallel
  Julian Shun, Yan Gu, Guy Blelloch, Jeremy T. Fineman, and Phillip B. Gibbons.
  
  SODA
   ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 431-448, 2015
  
  Work-efficient polylog-span algorithms for random permutation, list/tree contraction
  Conference paper