Julian Shun

Orcid: 0000-0001-6163-6625

Affiliations:
  • Massachusetts Institute of Technology, MA, USA


According to our database1, Julian Shun authored at least 90 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Parallel Algorithms for Hierarchical Nucleus Decomposition.
Proc. ACM Manag. Data, February, 2024

Approximate Nearest Neighbor Search with Window Filters.
CoRR, 2024

Kairos: Efficient Temporal Graph Analytics on a Single Machine.
CoRR, 2024

Parallel k-Core Decomposition with Batched Updates and Asynchronous Reads.
Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2024

2023
Introduction to the Special Issue for SPAA'21.
ACM Trans. Parallel Comput., December, 2023

PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search.
CoRR, 2023

Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive Graphs.
CoRR, 2023

Parallel Filtered Graphs for Hierarchical Clustering.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering (Abstract).
Proceedings of the 2023 ACM Workshop on Highlights of Parallel Computing, 2023

Theoretically and Practically Efficient Parallel Nucleus Decomposition (Abstract).
Proceedings of the 2023 ACM Workshop on Highlights of Parallel Computing, 2023

Faster Parallel Exact Density Peaks Clustering (Abstract).
Proceedings of the 2023 ACM Workshop on Highlights of Parallel Computing, 2023

ParSwarm: A C++ Framework for Evaluating Distributed Algorithms for Robot Swarms.
Proceedings of the 5th workshop on Advanced tools, 2023

Efficient Algorithms for Parallel Bi-core Decomposition.
Proceedings of the 2023 Symposium on Algorithmic Principles of Computer Systems, 2023

Faster Parallel Exact Density Peaks Clustering.
Proceedings of the SIAM Conference on Applied and Computational Discrete Algorithms, 2023

2022
Parallel Five-cycle Counting Algorithms.
ACM J. Exp. Algorithmics, 2022

Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering.
Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

Parallel Batch-Dynamic Algorithms for k-Core Decomposition and Related Graph Problems.
Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

ParGeo: a library for parallel computational geometry.
Proceedings of the PPoPP '22: 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Seoul, Republic of Korea, April 2, 2022

Differential Privacy from Locally Adjustable Graph Algorithms: k-Core Decomposition, Low Out-Degree Ordering, and Densest Subgraphs.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

ParGeo: A Library for Parallel Computational Geometry.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Parallel Algorithms for Butterfly Computations.
Proceedings of the Massive Graph Analytics, 2022

2021
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable.
ACM Trans. Parallel Comput., 2021

GeoGraph: A Framework for Graph Processing on Geometric Data.
ACM SIGOPS Oper. Syst. Rev., 2021

Chiller: Contention-centric Transaction Execution and Data Partitioning for Modern Networks.
SIGMOD Rec., 2021

ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor Chain.
Proc. VLDB Endow., 2021

Theoretically and Practically Efficient Parallel Nucleus Decomposition.
Proc. VLDB Endow., 2021

Parallel Batch-Dynamic kd-Trees.
CoRR, 2021

Parallel Batch-Dynamic k-Core Decomposition.
CoRR, 2021

Fast Arrays: Atomic Arrays with Constant Time Initialization.
Proceedings of the 35th International Symposium on Distributed Computing, 2021

Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering.
Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

Parallel Index-Based Structural Graph Clustering and Its Approximation.
Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

Taming the Zoo: The Unified GraphIt Compiler Framework for Novel Architectures.
Proceedings of the 48th ACM/IEEE Annual International Symposium on Computer Architecture, 2021

A Parallel Batch-Dynamic Data Structure for the Closest Pair Problem.
Proceedings of the 37th International Symposium on Computational Geometry, 2021

Compiling Graph Applications for GPU s with GraphIt.
Proceedings of the IEEE/ACM International Symposium on Code Generation and Optimization, 2021

Parallel In-Place Algorithms: Theory and Practice.
Proceedings of the 2nd Symposium on Algorithmic Principles of Computer Systems, 2021

Parallel Batch-Dynamic <i>k</i>-Clique Counting.
Proceedings of the 2nd Symposium on Algorithmic Principles of Computer Systems, 2021

The Read-Only Semi-External Model.
Proceedings of the 2nd Symposium on Algorithmic Principles of Computer Systems, 2021

Parallel Clique Counting and Peeling Algorithms.
Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms, 2021

2020
Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs.
Proc. VLDB Endow., 2020

ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms.
Proc. VLDB Endow., 2020

Parallelism in Randomized Incremental Algorithms.
J. ACM, 2020

Improved parallel construction of wavelet trees and rank/select structures.
Inf. Comput., 2020

Compliation Techniques for Graphs Algorithms on GPUs.
CoRR, 2020

Parallel Batch-Dynamic k-Clique Counting.
CoRR, 2020

Randomized Incremental Convex Hull is Highly Parallel.
Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Theoretically-Efficient and Practical Parallel DBSCAN.
Proceedings of the 2020 International Conference on Management of Data, 2020

The Graph Based Benchmark Suite (GBBS).
Proceedings of the GRADES-NDA'20: Proceedings of the 3rd Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA), 2020

Practical parallel hypergraph algorithms.
Proceedings of the PPoPP '20: 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2020

Kaskade: Graph Views for Efficient Graph Analytics.
Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

Optimizing ordered graph algorithms with GraphIt.
Proceedings of the CGO '20: 18th ACM/IEEE International Symposium on Code Generation and Optimization, 2020

Parallel Algorithms for Butterfly Computations.
Proceedings of the 1st Symposium on Algorithmic Principles of Computer Systems, 2020

Exploring the Design Space of Static and Incremental Graph Connectivity Algorithms on GPUs.
Proceedings of the PACT '20: International Conference on Parallel Architectures and Compilation Techniques, 2020

2019
Variational perspective on local graph clustering.
Math. Program., 2019

PriorityGraph: A Unified Programming Model for Optimizing Ordered Graph Algorithms.
CoRR, 2019

Semi-Asymmetric Parallel Graph Algorithms for NVRAMs.
CoRR, 2019

Theoretically-Efficient and Practical Parallel In-Place Radix Sorting.
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

LiTM: A Lightweight Deterministic Software Transactional Memory System.
Proceedings of the 10th International Workshop on Programming Models and Applications for Multicores and Manycores, 2019

Low-latency graph streaming using compressed purely-functional trees.
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019

2018
GraphIt: a high-performance graph DSL.
Proc. ACM Program. Lang., 2018

Chiller: Contention-centric Transaction Execution and Data Partitioning for Fast Networks.
CoRR, 2018

GraphIt - A High-Performance DSL for Graph Analytics.
CoRR, 2018

The Parallel Persistent Memory Model.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Implicit Decomposition for Write-Efficient Connectivity Algorithms.
Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

2017
Parallel lightweight wavelet tree, suffix array and FM-index construction.
J. Discrete Algorithms, 2017

Julienne: A Framework for Parallel Graph Algorithms using Work-efficient Bucketing.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

2016
Parallel Local Graph Clustering.
Proc. VLDB Endow., 2016

Parallel Algorithms for Asymmetric Read-Write Costs.
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Efficient Algorithms with Asymmetric Read and Write Costs.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015
Efficient Algorithms under Asymmetric Read and Write Costs.
CoRR, 2015

A Top-Down Parallel Semisort.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Sorting with Asymmetric Read and Write Costs.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Sequential Random Permutation, List Contraction and Tree Contraction are Highly Parallel.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

An Evaluation of Parallel Eccentricity Estimation Algorithms on Undirected Real-World Graphs.
Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015

Multicore triangle computations without tuning.
Proceedings of the 31st IEEE International Conference on Data Engineering, 2015

Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm.
Proceedings of the Algorithms - ESA 2015, 2015

Smaller and Faster: Parallel Processing of Compressed Graphs with Ligra+.
Proceedings of the 2015 Data Compression Conference, 2015

Parallel Wavelet Tree Construction.
Proceedings of the 2015 Data Compression Conference, 2015

2014
A simple parallel cartesian tree algorithm and its application to parallel suffix tree construction.
ACM Trans. Parallel Comput., 2014

Beyond Synchronous: New Techniques for External-Memory Graph Connectivity and Minimum Spanning Forest.
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

A simple and practical linear-work parallel algorithm for connectivity.
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

Phase-concurrent hash tables for determinism.
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

Fast Parallel Computation of Longest Common Prefixes.
Proceedings of the International Conference for High Performance Computing, 2014

2013
Reducing contention through priority updates.
Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2013

Ligra: a lightweight graph processing framework for shared memory.
Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2013

Practical Parallel Lempel-Ziv Factorization.
Proceedings of the 2013 Data Compression Conference, 2013

2012
Brief announcement: the problem based benchmark suite.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Greedy sequential maximal independent set and matching are parallel on average.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Internally deterministic parallel algorithms can be fast.
Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2012

2011
A Simple Parallel Cartesian Tree Algorithm and its Application to Suffix Tree Construction.
Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments, 2011


  Loading...