List of Accepted Papers:

  • Letong Wang, Xiaojun Dong, Yan Gu and Yihan Sun. Parallel Strong Connectivity Basedon Faster Reachability
  • Xiaojun Dong, Letong Wang, Yan Gu and Yihan Sun. Provably Fast and Space-EfficientParallel Biconnectivity
  • Nairen Cao, Jeremy Fineman and Katina Russell. Efficient Construction of Directed Hopsets and Parallel Single-source Shortest Paths
  • Ananth Hari and Uzi Vishkin. Empirical Challenge for NC Theory
  • Yihao Huang, Shangdi Yu and Julian Shun. Faster Parallel Exact Density Peaks Clustering
  • Mahbod Afarin, Chao Gao, Shafiur Rahman, Nael Abu-Ghazaleh and Rajiv Gupta. CommonGraph: Graph Analytics on Evolving Data
  • Brian Wheatman and Randal Burns. Streaming Sparse Graphs Using Efficient Dynamic Sets
  • Jessica Shi, Laxman Dhulipala and Julian Shun. Theoretically and Practically Efficient Parallel Nucleus Decomposition
  • Yiqiu Wang, Shangdi Yu, Yan Gu and Julian Shun. Fast Parallel Algorithms for Euclidean Minimum Spanning Treeand Hierarchical Spatial Clustering
  • Stefan K Muller. Static Prediction of Parallel Computation Graphs
  • Daniel Anderson, Guy Blelloch and Yuanhao Wei. Smarter Atomic Smart Pointers: Safe and Efficient Concurrent Memory Management
  • Xizhe Yin, Zhijia Zhao and Rajiv Gupta. Taming Misaligned Graph Traversalsin Concurrent Graph Processing
  • Hongbo Kang, Yiwei Zhao, Guy E. Blelloch, Laxman Dhulipala, Yan Gu, Charles McGuffey and Phillip B.Gibbons. PIM-tree: A Skew-resistant Index for Processing-in-Memory
  • Meghana Madhyastha and Randal Burns. BLOCKSET (Block-AlignedSerialized Trees): ReducingInference Latency for Tree-Ensemble Deployment
  • Toluwanimi O. Odemuyiwa, Hadi Asghari-Moghaddam, Michael Pellauer, Kartik Hegde, Po-An Tsai, Neal C.Crago, Aamer Jaleel, John D. Owens, Edgar Solomonik, Joel S. Emer and Christopher W. Fletcher. Accelerating Sparse Data Orchestration via Dynamic Reflexive Tiling
  • Magdalen Dobson and Guy Blelloch. Parallel Nearest Neighbors in Low Dimensions with Batch Updates