Back to authors
Julian Shun
- Author ID
- 20061
- ORCID
-
-
- Links
-
(found by gpt-5.2 on feb 8th, 2026)
- Most Frequent Institution
- Massachusetts Institute of Technology
- Pagerank
- 0.089908713
- Overall Rank
- 733 | 96.49%
- 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,600 |
Parallel Local Graph Clustering |
2016 |
VLDB |
6.9285467e-05 |
| 4,488 |
Parallel Index-Based Structural Graph Clustering and Its Approximation |
2021 |
SIGMOD |
6.139905e-05 |
| 5,417 |
Theoretically-Efficient and Practical Parallel DBSCAN |
2020 |
SIGMOD |
5.5162242e-05 |
| 6,297 |
Chiller: Contention-centric Transaction Execution and Data Partitioning for Modern Networks |
2020 |
SIGMOD |
5.1192861e-05 |
| 6,882 |
Theoretically and Practically Efficient Parallel Nucleus Decomposition |
2022 |
VLDB |
4.8923998e-05 |
| 7,874 |
ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms |
2021 |
VLDB |
4.6263724e-05 |
| 9,861 |
Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs |
2020 |
VLDB |
4.2642656e-05 |
| 10,734 |
Practical and Accurate Local Edge Differentially Private Graph Algorithms |
2025 |
VLDB |
4.1905499e-05 |
| 10,883 |
The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering |
2025 |
VLDB |
4.1905499e-05 |
| 10,886 |
Towards Scalable and Practical Batch-Dynamic Connectivity |
2025 |
VLDB |
4.1905499e-05 |
| 10,950 |
Parallel Algorithms for Hierarchical Nucleus Decomposition |
2024 |
SIGMOD |
4.1905499e-05 |
| 11,385 |
ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor Chain |
2022 |
VLDB |
4.1905499e-05 |
| 11,481 |
Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering* |
2021 |
SIGMOD |
4.1905499e-05 |
Frequent Co-authors
Co-authored at least 5 papers.