## Julian ShunPh.D. studentSchool of Computer Science Carnegie Mellon University Email ID: jshun Domain: cs.cmu.edu C.V. |

I am fortunate to be advised by Guy Blelloch. I am also fortunate to be supported by a Facebook Graduate Fellowship for 2013-2014.

- Julian Shun.

Fast Parallel Computation of Longest Common Prefixes.

To appear in Proceedings of the ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis (SC), 2014. - (by contribution) Julian Shun and Guy Blelloch.

A Simple Parallel Cartesian Tree Algorithm and its Application to Parallel Suffix Tree Construction

To appear in ACM Transactions on Parallel Computing (TOPC), 2014. (Earlier version appears in ALENEX 2011.) - (by contribution) Julian Shun and Guy Blelloch.

Phase-concurrent Hash Tables for Determinism

Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2014.

pdf - (by contribution) Julian Shun, Laxman Dhulipala and Guy Blelloch.

A Simple and Practical Linear-Work Parallel Algorithm for Connectivity

Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2014.

pdf Source code - (by contribution) Aapo Kyrola, Julian Shun and Guy Blelloch.

Beyond Synchronous: New Techniques for External Memory Graph Algorithms

Proceedings of the Symposium on Experimental Algorithms (SEA), 2014.

pdf - (by contribution) Julian Shun, Guy Blelloch, Jeremy Fineman and
Phillip Gibbons.

Reducing Contention Through Priority Updates

Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2013.

pdf - (by alphabetical order) Julian Shun and Fuyao Zhao.

Practical Parallel Lempel-Ziv Factorization

Proceedings of the IEEE Data Compression Conference (DCC), 2013.

pdf (updated version) pdf (proceedings version) Source code - (by contribution) Julian Shun and Guy Blelloch.

Ligra: A Lightweight Graph Processing Framework for Shared Memory

Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), 2013.

pdf Source code - (by contribution) Julian Shun, Guy Blelloch, Jeremy Fineman and
Phillip Gibbons.

Reducing Contention Through Priority Updates (Poster Paper)

Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), 2013.

pdf - (by alphabetical order) Guy Blelloch, Jeremy Fineman and Julian
Shun.

Greedy Sequential Maximal Independent Set and Matching are Parallel on Average

Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2012.

pdf - (by contribution) Julian Shun, Guy Blelloch, Jeremy Fineman,
Phillip Gibbons, Aapo Kyrola, Harsha Vardhan Simhadri and Kanat
Tangwongsan.

Brief Announcement: The Problem Based Benchmark Suite

Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2012.

pdf Website - (by alphabetical order) Guy Blelloch, Jeremy Fineman, Phillip
Gibbons and Julian Shun.

Internally Deterministic Parallel Algorithms Can Be Fast

Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), 2012.

pdf - (by alphabetical order) Guy Blelloch and Julian Shun.

A Simple Parallel Cartesian Tree Algorithm and its Application to Suffix Tree Construction

Proceedings of the SIAM Meeting on Algorithm Engineering and Experiments (ALENEX), 2011.

pdf (updated version) pdf (proceedings version) Source code - (by alphabetical order) David Aldous and Julian Shun.

Connected Spatial Networks over Random Points and a Route-Length Statistic

Statistical Science, Vol. 25, No. 3, pp. 275-288, 2010.

pdf

- Notes on simple analysis of parallel maximal independent set and maximal matching algorithms. pdf