Back to authors
Julian Shun
- Author ID
- 20057
- ORCID
-
-
- Links
-
(found by gpt-5.2 on feb 8th, 2026)
- Most Frequent Institution
- Massachusetts Institute of Technology
- Pagerank
- 0.089942922
- Overall Rank
- 712 | 96.65%
- Paper Count
- 13
Affiliation Timeline
Incoming Non-self Citations Over Time
Total yearly non-self incoming citations across all papers by this author.
Publications by Paper Pagerank
Showing 13 of 13 publications.
| Rank |
Title |
Year |
Venue |
Pagerank |
| 3,597 |
Parallel Local Graph Clustering |
2016 |
VLDB |
6.9345175e-05 |
| 4,485 |
Parallel Index-Based Structural Graph Clustering and Its Approximation |
2021 |
SIGMOD |
6.1458149e-05 |
| 5,417 |
Theoretically-Efficient and Practical Parallel DBSCAN |
2020 |
SIGMOD |
5.5194222e-05 |
| 6,317 |
Chiller: Contention-centric Transaction Execution and Data Partitioning for Modern Networks |
2020 |
SIGMOD |
5.1140356e-05 |
| 6,880 |
Theoretically and Practically Efficient Parallel Nucleus Decomposition |
2022 |
VLDB |
4.8970985e-05 |
| 7,871 |
ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms |
2021 |
VLDB |
4.6308128e-05 |
| 9,862 |
Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs |
2020 |
VLDB |
4.2683554e-05 |
| 10,727 |
Practical and Accurate Local Edge Differentially Private Graph Algorithms |
2025 |
VLDB |
4.1945683e-05 |
| 10,879 |
The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering |
2025 |
VLDB |
4.1945683e-05 |
| 10,882 |
Towards Scalable and Practical Batch-Dynamic Connectivity |
2025 |
VLDB |
4.1945683e-05 |
| 10,947 |
Parallel Algorithms for Hierarchical Nucleus Decomposition |
2024 |
SIGMOD |
4.1945683e-05 |
| 11,383 |
ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor Chain |
2022 |
VLDB |
4.1945683e-05 |
| 11,477 |
Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering* |
2021 |
SIGMOD |
4.1945683e-05 |
Frequent Co-authors
Co-authored at least 5 papers.