World's Best Scientists 2026 revealed!
Julian Shun

Julian Shun

D-Index & Metrics

Computer Science

D-Index
33
Citations
4358
World Ranking
12727
National Ranking
5134

Best Publications

  • Ligra: a lightweight graph processing framework for shared memory

    Julian Shun;Guy E. Blelloch

  • Brief announcement: the problem based benchmark suite

    Julian Shun;Guy E. Blelloch;Jeremy T. Fineman;Phillip B. Gibbons

  • Ligra

    Unknown

  • GraphIt: a high-performance graph DSL

    Yunming Zhang;Mengjiao Yang;Riyadh Baghdadi;Shoaib Kamil

  • Internally deterministic parallel algorithms can be fast

    Guy E. Blelloch;Jeremy T. Fineman;Phillip B. Gibbons;Julian Shun

  • Multicore triangle computations without tuning

    Julian Shun;Kanat Tangwongsan

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

    Julian Shun;Laxman Dhulipala;Guy E. Blelloch

  • Greedy sequential maximal independent set and matching are parallel on average

    Guy E. Blelloch;Jeremy T. Fineman;Julian Shun

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

    Laxman Dhulipala;Guy Blelloch;Julian Shun

  • Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable

    Laxman Dhulipala;Guy E. Blelloch;Julian Shun

  • Sorting with Asymmetric Read and Write Costs

    Guy E. Blelloch;Jeremy T. Fineman;Phillip B. Gibbons;Yan Gu

  • A simple and practical linear-work parallel algorithm for connectivity

    Julian Shun;Laxman Dhulipala;Guy Blelloch

  • Parallel local graph clustering

    Julian Shun;Farbod Roosta-Khorasani;Kimon Fountoulakis;Michael W. Mahoney

  • Theoretically-Efficient and Practical Parallel DBSCAN

    Yiqiu Wang;Yan Gu;Julian Shun

  • Ligra: A Lightweight Graph Processing Framework for Shared Memory

    Unknown

  • Phase-concurrent hash tables for determinism

    Julian Shun;Guy E. Blelloch

  • Parallel Algorithms for Butterfly Computations

    Jessica Shi;Julian Shun

  • Parallel Algorithms for Asymmetric Read-Write Costs

    Naama Ben-David;Guy E. Blelloch;Jeremy T. Fineman;Phillip B. Gibbons

  • Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable

    Laxman Dhulipala;Guy E. Blelloch;Julian Shun

  • A simple parallel cartesian tree algorithm and its application to parallel suffix tree construction

    Julian Shun;Guy E. Blelloch

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Recently Published Articles