Julian Shun
Ph.D. student
School of Computer Science
Carnegie Mellon University
Email ID: jshun     Domain: cs.cmu.edu
Resume


Publications ( [*] indicates that the author list is ordered by contribution; otherwise the author list is ordered alphabetically)

  • [*] Julian Shun, Guy Blelloch, Jeremy Fineman and Phillip Gibbons. Reducing Contention Through Priority Updates.
  • Julian Shun and Fuyao Zhao. Practical Parallel Lempel-Ziv Factorization, Proceedings of IEEE Data Compression Conference (DCC), 2013. pdf Code

  • [*] Julian Shun and Guy Blelloch. Ligra: A Lightweight Graph Processing Framework for Shared Memory, Proceedings of ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), 2013. pdf Code

  • Guy Blelloch, Jeremy Fineman and Julian Shun. Greedy Sequential Maximal Independent Set and Matching are Parallel on Average, Proceedings of ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2012. pdf

  • [*] Julian Shun, Guy Blelloch, Jeremy Fineman, Phillip Gibbons, Aapo Kyrola, Harsha Vardhan Simhadri and Kanat Tongwongsan. Brief Announcement: The Problem Based Benchmark Suite, Proceedings of ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2012. pdf Website

  • Guy Blelloch, Jeremy Fineman, Phillip Gibbons and Julian Shun. Internally Deterministic Parallel Algorithms Can Be Fast, Proceedings of ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), 2012. pdf

  • Guy Blelloch and Julian Shun. A Simple Parallel Cartesian Tree Algorithm and its Application to Suffix Tree Construction, Proceedings of SIAM Workshop on Algorithm Engineering and Experiments (ALENEX) 2011. pdf (proceedings version) pdf (updated version) Code

  • 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

    Other

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