## Julian Shun 信哲文Assistant ProfessorDouglas T. Ross Career Development Professor of Software Technology Electrical Engineering and Computer Science Massachusetts Institute of Technology Office: 32-G736 Phone: (617) 258-0669 Email: jshun at mit.edu Address C.V. |

I am an assistant professor at MIT in the EECS department. Prior to that, I was a Miller Research Fellow at UC Berkeley working with Michael Mahoney. I obtained my Ph.D. from Carnegie Mellon University, and was advised by Guy Blelloch.

- Shared Memory Parallelism Can Be Simple, Fast, and Scalable, Carnegie Mellon University, 2015.
**Winner of the ACM Doctoral Dissertation Award****and the CMU SCS Doctoral Dissertation Award**

Revised version available from ACM Digital Library and ACM Books.

- Laxman Dhulipala, Guy Blelloch, and Julian Shun

Julienne: A Framework for Parallel Graph Algorithms using Work-efficient Bucketing

Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 293-304, 2017. - Julian Shun, Farbod Roosta-Khorasani, Kimon Fountoulakis, and Michael Mahoney

Parallel Local Graph Clustering

Proceedings of the VLDB Endowment, 9(12), pp. 1041-1052, 2016. - Julian Shun

An Evaluation of Parallel Eccentricity Estimation Algorithms on Undirected Real-World Graphs

Proceedings of the ACM Conference on Knowledge Discovery and Data Mining (KDD), pp. 1095-1104, 2015. - Julian Shun, Laxman Dhulipala,
and Guy
Blelloch

Smaller and Faster: Parallel Processing of Compressed Graphs with Ligra+

Proceedings of the IEEE Data Compression Conference (DCC), pp. 403-412, 2015. - 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), pp. 135-146, 2013.

Webpage for Ligra/Ligra+ Source code

- Yunming Zhang, Mengjiao Yang, Riyadh Baghdadi, Shoaib Kamil, Julian Shun, and Saman Amarasinghe

GraphIt: A High-Performance Graph DSL

Proceedings of Object-Oriented Programming, Systems, Languages & Applications (OOPSLA), pp. 121:1-121:30, 2018.

Website - Laxman Dhulipala, Guy Blelloch, and Julian Shun

Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable

Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 393-404, 2018.**Best Paper Award**

Source code -
Niklas Baumstark, Guy Blelloch, and Julian Shun

Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm

Proceedings of the European Symposium on Algorithms (ESA), pp. 106-117, 2015. - Julian Shun and Kanat Tangwongsan

Multicore Triangle Computations Without Tuning

Proceedings of the IEEE International Conference on Data Engineering (ICDE), pp. 149-160, 2015.

Source code - 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), pp. 143-153, 2014.

Source code - Aapo Kyrola, Julian Shun, and Guy Blelloch

Beyond Synchronous: New Techniques for External Memory Graph Algorithms

Proceedings of the International Symposium on Experimental Algorithms (SEA), pp. 123-137, 2014.

- Julian Shun

Improved Parallel Construction of Wavelet Trees and Rank/Select Structures

Proceedings of the IEEE Data Compression Conference (DCC), pp. 92-101, 2017. - Julian Labeit, Julian Shun,
and Guy
Blelloch

Parallel lightweight wavelet tree, suffix array and FM-index construction

Journal of Discrete Algorithms, 2017.**Special issue of DCC 2016**

Source code - Julian Shun

Parallel Wavelet Tree Construction

Proceedings of the IEEE Data Compression Conference (DCC), pp. 63-72, 2015.**Awarded the Capocelli Prize for Best Student-Authored Paper**

Source code - Julian Shun

Fast Parallel Computation of Longest Common Prefixes

Proceedings of the ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis (SC), pp. 387-398, 2014. - Julian Shun and Guy Blelloch

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

ACM Transactions on Parallel Computing (TOPC), Vol. 1 Issue 1, Article No. 8, 2014.

Source code - Julian Shun and Fuyao Zhao (joint first author)

Practical Parallel Lempel-Ziv Factorization

Proceedings of the IEEE Data Compression Conference (DCC), pp. 123-132, 2013.

Source code

- Guy Blelloch, Yan Gu, Julian Shun, and Yihan Sun

Parallelism in Randomized Incremental Algorithms

Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 467-478, 2016. - Julian Shun, Yan Gu, Guy Blelloch, Jeremy Fineman, and Phillip Gibbons

Sequential Random Permutation, List Contraction and Tree Contraction are Highly Parallel

Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 431-448, 2015. - Julian Shun and Guy Blelloch

Phase-concurrent Hash Tables for Determinism

Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 96-107, 2014. - 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), pp. 152-163, 2013. - 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), pp. 308-317, 2012.

MIS Source Code Maximal Matching Source Code - 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), pp. 181-192, 2012.

Website

- Guy Blelloch, Phillip Gibbons, Yan Gu, Charles McGuffey, and Julian Shun

The Parallel Persistent Memory Model

Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 247-258, 2018. - Guy Blelloch, Yan Gu, Julian Shun, and Yihan Sun

Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry

Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 235-246, 2018. - Naama Ben-David, Guy Blelloch, Jeremy Fineman, Phillip Gibbons, Yan Gu, Charles McGuffey, and Julian Shun

Implicit Decomposition for Write-Efficient Connectivity Algorithms

Proceedings of the IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 711-722, 2018. - Guy Blelloch, Jeremy Fineman, Phillip Gibbons, Yan Gu, and Julian Shun

Efficient Algorithms with Asymmetric Read and Write Costs

Proceedings of the European Symposium on Algorithms (ESA), pp. 14:1-14:18, 2016. - Naama Ben-David, Guy Blelloch, Jeremy Fineman, Phillip Gibbons, Yan Gu, Charles McGuffey, and Julian Shun

Parallel Algorithms for Asymmetric Read-Write Costs

Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 145-156, 2016. - Guy Blelloch, Jeremy Fineman, Phillip Gibbons, Yan Gu, and Julian Shun

Sorting with Asymmetric Read and Write Costs

Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 1-12, 2015.

- Yan Gu,
Julian Shun, Yihan Sun,
and Guy
Blelloch

A Top-Down Parallel Semisort

Proceedings of the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 24-34, 2015.

- Julian Shun, Guy Blelloch, Jeremy Fineman,
Phillip Gibbons, Aapo Kyrola, Vardhan Simhadri, and Kanat Tangwongsan

Brief Announcement: The Problem Based Benchmark Suite

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

Website