Office: 32-G724, Massachusetts Institute of Technology




I will be joining the University of California, Riverside (UCR) as an Assistant Professor from Jan. 2020. I'm looking for self-motivated Ph.D. students. If you are interested, please contact me via email and attach your CV.



I am currently a postdoc associate at MIT CSAIL from January 2019, working with Julian Shun. Before that, I finished my PhD also at Carnegie Mellon University, advised by Guy Blelloch. My personal webpages are also available on [dblp] and [Google Scholar]. You can find my [CV] here.


Prior to coming to CMU, I received my Bachelor degree in Computer Science at Tsinghua University in 2012.


My current research interest is design efficient (usually parallel) algorithms for large-scale data with good performance in practice.



This is the link to my lovely wife's homepage.


Ph.D. Thesis

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.


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.

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.


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.

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.




Publicity chair of ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2019-present

Program Committee:

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.





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.


Flag Counter