|
Selected Publications
Papers on this page are categorized in different topics. Paper list in reverse chronological order can be found here.
Algorithm papers
Algorithms with Asymmetric Read and Write Costs
These papers tried to understand and develop efficient algorithms for the upcoming non-volatile main-memory (NVM) with asymmetric read and write costs. This includes modified computational models, new algorithms, new techniques to support efficient computation, etc.
Algorithmic Building Blocks for Asymmetric Memories.
With Yihan Sun and Guy Blelloch.
European Symposium on Algorithms (ESA), 2018.
Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry.
With Guy Blelloch, Julian Shun and Yihan Sun.
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2018.
[Conference version] [Full version]
The Parallel Persistent Memory Model.
With Guy Blelloch, Phillip B. Gibbons, Charles McGuffey and Julian Shun.
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2018.
[Conference version] [Full version]
Implicit Decomposition for Write-Efficient Connectivity Algorithms.
With Naama Ben-David, Guy Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Charles McGuffey and Julian Shun.
IEEE International Parallel & Distributed Processing Symposium (IPDPS), 2018.
[Conference version] [Full version]
Parallel Algorithms with Asymmetric Read and Write Costs.
With Naama Ben-David, Guy Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Charles McGuffey and Julian Shun.
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016.
Efficient Algorithms with Asymmetric Read and Write Costs.
With Guy Blelloch, Jeremy T. Fineman, Phillip B. Gibbons and Julian Shun.
European Symposium on Algorithms (ESA), 2016.
[Conference version] [arXiv version]
Sorting with Asymmetric Read and Write Costs.
With Guy Blelloch, Jeremy T. Fineman, Phillip B. Gibbons and Julian Shun.
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2015.
[Conference version] [arXiv version](<-read this)
Parallel Algorithms
These papers developed efficient parallel algorithms for fundamental problems or parallel primitives (e.g. sorting, shortest-paths, convex hull, Delauney triangulation, SCC, random permutation, list/tree contraction). All of these new algorithms are highly practical, and with better or matching bounds comparing to previous theoretical approaches.
Improved Parallel Cache-Oblivious Algorithms for Dynamic Programming.
With Guy Blelloch.
ACM-SIAM Algorithmic Principles of Computer Systems (APoCS), 2020.
Theoretically-Efficient and Practical Parallel DBSCAN.
With Yiqiu Wang and Julian Shun.
ACM International Conference on Management of Data (SIGMOD), 2020.
To appear.
Parallelism in Randomized Incremental Algorithms.
With Guy Blelloch, Julian Shun and Yihan Sun.
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016.
Parallel Shortest-Paths Using Radius Stepping.
With Guy Blelloch, Yihan Sun and Kanat Tangwongsan.
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016.
A Top-Down Parallel Semisort.
With Julian Shun, Yihan Sun and Guy Blelloch.
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2015.
Sequential Random Permutation, List Contraction and Tree Contraction are Highly Parallel.
With Julian Shun, Guy Blelloch, Jeremy T. Fineman and Phillip B. Gibbons.
ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 431-448, 2015.
Miscellaneous Topics
This is a random sample of topics that I occasionally looked into. They are standard sequential algorithms with the goal to minimize the time complexity.
Efficient Construction of Probabilistic Tree Embeddings.
With Guy Blelloch and Yihan Sun.
International Colloquium on Automata, Languages, and Programming (ICALP), 2017.
Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain.
With Danny Z. Chen, Jian Li and Haitao Wang.
SWAT 2012. Discrete & Computational Geometry, 2013, 50(2), pp. 374-408.
Graphics papers
I spent most of my time from 2010 to 2014 on computer graphics research (most of the algorithm papers are done starting from 2015).
BVH Construction
These papers discussed some interesting algorithmic improvements either to accelerate the construction or to improve the quality of the bounding volume hierarchy, which is one of the most commonly-used data structure in computer graphics. All these papers improved the state-of-the-art (or at publish time) techniques much.
Ray Specialized BVH Contraction.
With Yong He and Guy Blelloch.
Pacific Graphics 2015. Computer Graphics Forum 34(7), 309-318.
[Conference version] [Full version](<-read this) [Experiments]
Efficient BVH Construction via Approximate Agglomerative Clustering.
With Yong He, Kayvon Fatahalian and Guy Blelloch.
High Performance Graphics 2013, pp. 81-88.
[Project Page] [BibTex] [Paper] [Code]
Miscellaneous Topics
This is another random sample of the topics I worked on during my undergrad and guaduate time, including works on geometry modeling and processing, image processing, and architectual and compiling considerations on GPU rendering.
Extending the Graphics Pipeline with Adaptive, Multi-Rate Shading.
With Yong He and Kayvon Fatahalian.
SIGGRAPH 2014. ACM Trans. Graph. 33, 4, Article 142 (2014).
[Project Page] [Paper] [Video]
Mixed-Domain Edge-Aware Image Manipulation.
With Xian-Ying Li, Shi-Min Hu and Ralph R. Martin.
IEEE Transactions on Image Processing (TIP), 2013, 22(5), 1915-1925.
[Project Page] [BibTex] [Paper] [Code]
A Geometric Study of V-style Pop-ups: Theories and Algorithms.
With Xian-Ying Li, Tao Ju and Shi-Min Hu.
SIGGRAPH 2011. ACM Transactions on Graphics , 30(4): article 98.
[Project Page] [BibTex] [34.3M Paper] [1.8M Paper] [8.9M Video] [13.9M Slides]
Services
Publicity chair of ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2019-present
Program Committee:
IEEE International Parallel & Distributed Processing Symposium (IPDPS) 2020
ACM-SIAM Algorithmic Principles of Computer Systems (APoCS) 2020
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) 2019
IEEE International Parallel & Distributed Processing Symposium (IPDPS) 2019
Workshop on Advances in Parallel and Distributed Computational Models (APDCM) in IPDPS 2019
Big Graph Processing (BGP) in ICDCS 2017
Reviewer of SPAA, SODA, ESA, IPDPS, SIGGRAPH, Eurographics, Pacific Graphics, FUN with Algorithms.
Reviewer of TVCG (IEEE Transactions on Visualization and Computer Graphics), CAG (Computers & Graphics), JCGT (Journal of Computer Graphics Techniques), the Visual Computer, JOCO (Journal of Combinatorial Optimization).
Teaching assistant for 15-418/618: Parallel Computer Architecture and Programming (Summer 17).
Teaching assistant for 15-853: Algorithms in the "Real World" (Fall 15).
Teaching assistant for 15-295: Competition Programming and Problem Solving(Fall 13, Spring 14, Fall 14, Spring 15), co-coach for CMU ACM/ICPC team in 2013-2015.
Awards
2013 - Bronze Medal, North American Champion, ACM/ICPC 2012-2013 Programming Contest World Final, St. Petersburg.
2012 - Champion, ACM/ICPC 2012-2013 Programming Contest, East Central North America Regional, Youngstown.
2008 - Champion, ACM/ICPC 2008-2009 Programming Contest, Asia Regional, Harbin.
2007 - Gold Medal of the 24th National Olympiad in Informatics (NOI) of China, Fuzhou.
2012 - Graduated with honors in Computer Science (Tsinghua Univ).
2011 - Morgan Stanley Scholarship.
Page view since Sep 23, 2018.