Yan Gu

Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024

Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering.

[BibT_eX]

[DOI]

Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024

Brief Announcement: PASGAL: Parallel And Scalable Graph Algorithm Library.

[BibT_eX]

[DOI]

Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024

ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms.

[BibT_eX]

[DOI]

Magdalen Dobson Manohar

Harsha Vardhan Simhadri

Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2024

Parallel Integer Sort: Theory and Practice.

[BibT_eX]

[DOI]

Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2024

Teaching Parallel Algorithms Using the Binary-Forking Model.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2024

Fast and Space-Efficient Parallel Algorithms for Influence Maximization (Abstract).

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM Workshop on Highlights of Parallel Computing, 2024

Parallel Integer Sort: Theory and Practice (Abstract).

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM Workshop on Highlights of Parallel Computing, 2024

Efficient Parallel Output-Sensitive Edit Distance (Abstract).

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM Workshop on Highlights of Parallel Computing, 2024

2023

Fast and Space-Efficient Parallel Algorithms for Influence Maximization.

[BibT_eX]

[DOI]

Proc. VLDB Endow., November, 2023

Parallel Strong Connectivity Based on Faster Reachability.

[BibT_eX]

[DOI]

Proc. ACM Manag. Data, 2023

Scaling Graph-Based ANNS Algorithms to Billion-Size Datasets: A Comparative Analysis.

[BibT_eX]

[DOI]

Harsha Vardhan Simhadri

CoRR, 2023

PIM-trie: A Skew-resistant Trie for Processing-in-Memory.

[BibT_eX]

[DOI]

Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

High-Performance and Flexible Parallel Algorithms for Semisort and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Parallel Longest Increasing Subsequence and van Emde Boas Trees.

[BibT_eX]

[DOI]

Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Provably Fast and Space-Efficient Parallel Biconnectivity.

[BibT_eX]

[DOI]

Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2023

Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering (Abstract).

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM Workshop on Highlights of Parallel Computing, 2023

Parallel Strong Connectivity Based on Faster Reachability (Abstract).

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM Workshop on Highlights of Parallel Computing, 2023

PIM-tree: A Skew-resistant Index for Processing-in-Memory (Abstract).

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM Workshop on Highlights of Parallel Computing, 2023

Provably Fast and Space-Efficient Parallel Biconnectivity (Abstract).

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM Workshop on Highlights of Parallel Computing, 2023

Efficient Parallel Output-Sensitive Edit Distance.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

LuisaRender: A High-Performance Rendering Framework with Layered and Unified Interfaces on Stream Architectures.

[BibT_eX]

[DOI]

ACM Trans. Graph., 2022

PIM-tree: A Skew-resistant Index for Processing-in-Memory.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2022

A Work-Efficient Parallel Algorithm for Longest Increasing Subsequence.

[BibT_eX]

[DOI]

CoRR, 2022

Many Sequential Iterative Algorithms Can Be Parallel and (Nearly) Work-efficient.

[BibT_eX]

[DOI]

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

Parallel Cover Trees and their Applications.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the PPoPP '22: 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Seoul, Republic of Korea, April 2, 2022

PaC-trees: supporting parallel and compressed purely-functional collections.

[BibT_eX]

[DOI]

Proceedings of the PLDI '22: 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, San Diego, CA, USA, June 13, 2022

ParGeo: A Library for Parallel Computational Geometry.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Analysis of Work-Stealing and Parallel Cache Complexity.

[BibT_eX]

[DOI]

Zachary Napier

Proceedings of the 3rd Symposium on Algorithmic Principles of Computer Systems, 2022

2021

Write-efficient Algorithms.

[BibT_eX]

[DOI]

PhD thesis, 2021

GeoGraph: A Framework for Graph Processing on Geometric Data.

[BibT_eX]

[DOI]

ACM SIGOPS Oper. Syst. Rev., 2021

ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor Chain.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2021

The Processing-in-Memory Model.

[BibT_eX]

[DOI]

Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths.

[BibT_eX]

[DOI]

Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering.

[BibT_eX]

[DOI]

Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

A Parallel Batch-Dynamic Data Structure for the Closest Pair Problem.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Computational Geometry, 2021

Parallel In-Place Algorithms: Theory and Practice.

[BibT_eX]

[DOI]

Omar Obeya

Julian Shun

Proceedings of the 2nd Symposium on Algorithmic Principles of Computer Systems, 2021

The Read-Only Semi-External Model.

[BibT_eX]

[DOI]

Proceedings of the 2nd Symposium on Algorithmic Principles of Computer Systems, 2021

2020

Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2020

Parallelism in Randomized Incremental Algorithms.

[BibT_eX]

[DOI]

J. ACM, 2020

Randomized Incremental Convex Hull is Highly Parallel.

[BibT_eX]

[DOI]

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Optimal Parallel Algorithms in the Binary-Forking Model.

[BibT_eX]

[DOI]

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Theoretically-Efficient and Practical Parallel DBSCAN.

[BibT_eX]

[DOI]

Yiqiu Wang

Julian Shun

Proceedings of the 2020 International Conference on Management of Data, 2020

Improved Parallel Cache-Oblivious Algorithms for Dynamic Programming [Extend Abstract].

[BibT_eX]

[DOI]

Proceedings of the 1st Symposium on Algorithmic Principles of Computer Systems, 2020

2019

Semi-Asymmetric Parallel Graph Algorithms for NVRAMs.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Improved Parallel Cache-Oblivious Algorithms for Dynamic Programming and Linear Algebra.

[BibT_eX]

[DOI]

CoRR, 2018

The Parallel Persistent Memory Model.

[BibT_eX]

[DOI]

Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry.

[BibT_eX]

[DOI]

Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Survey: Computational Models for Asymmetric Read and Write Costs.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium Workshops, 2018

Implicit Decomposition for Write-Efficient Connectivity Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

Algorithmic Building Blocks for Asymmetric Memories.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

Efficient Construction of Probabilistic Tree Embeddings.

[BibT_eX]

[DOI]

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

A New Efficient Construction on Probabilistic Tree Embeddings.

[BibT_eX]

[DOI]

CoRR, 2016

Parallel Shortest Paths Using Radius Stepping.

[BibT_eX]

[DOI]

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Parallel Algorithms for Asymmetric Read-Write Costs.

[BibT_eX]

[DOI]

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Efficient Algorithms with Asymmetric Read and Write Costs.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

Efficient Algorithms under Asymmetric Read and Write Costs.

[BibT_eX]

[DOI]

CoRR, 2015

Ray Specialized Contraction on Bounding Volume Hierarchies.

[BibT_eX]

[DOI]

Yong He

Comput. Graph. Forum, 2015

A Top-Down Parallel Semisort.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Sorting with Asymmetric Read and Write Costs.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

Extending the graphics pipeline with adaptive, multi-rate shading.

[BibT_eX]

[DOI]

Yong He

Kayvon Fatahalian

ACM Trans. Graph., 2014

Cascading A*: a Parallel Approach to Approximate Heuristic Search.

[BibT_eX]

[DOI]