| 2023 | Are Parallel Algorithms Ready for Prime Time? | Guy E. Blelloch |
| 2023 | Increment - and - Freeze: Every Cache, Everywhere, All of the Time. | Michael A. Bender, Daniel DeLayo, Bradley C. Kuszmaul, William Kuszmaul, Evan West |
| 2023 | An Associativity Threshold Phenomenon in Set-Associative Caches. | Michael A. Bender, Rathish Das, Martin Farach-Colton, Guido Tagliavini |
| 2023 | Quadratic Speedups in Parallel Sampling from Determinantal Distributions. | Nima Anari, Callum Burgess, Kevin Tian, Thuy-Duong Vuong |
| 2023 | Massively Parallel Tree Embeddings for High Dimensional Spaces. | AmirMohsen Ahanchi, Alexandr Andoni, MohammadTaghi Hajiaghayi, Marina Knittel, Peilin Zhong |
| 2023 | Brief Announcement: Is the Problem-Based Benchmark Suite Fearless with Rust? | Javad Abdi, Guowei Zhang, Mark C. Jeffrey |
| 2023 | Transactional Composition of Nonblocking Data Structures. | Wentao Cai, Haosen Wen, Michael L. Scott |
| 2023 | Fast Dynamic Programming in Trees in the MPC Model. | Chetan Gupta, Rustam Latypov, Yannic Maus, Shreyas Pai, Simo Srkk, Jan Studen, Jukka Suomela, Jara Uitto, Hossein Vahidi |
| 2023 | High-Performance and Flexible Parallel Algorithms for Semisort and Related Problems. | Xiaojun Dong, Yunshu Wu, Zhongqi Wang, Laxman Dhulipala, Yan Gu, Yihan Sun |
| 2023 | Parallel Longest Increasing Subsequence and van Emde Boas Trees. | Yan Gu, Ziyang Men, Zheqi Shen, Yihan Sun, Zijin Wan |
| 2023 | Nearly Work-Efficient Parallel DFS in Undirected Graphs. | Mohsen Ghaffari, Christoph Grunau, Jiahao Qu |
| 2022 | Brief Announcement: Towards a More Robust Algorithm for Flow Time Scheduling with Predictions. | Tianming Zhao, Chunhao Li, Wei Li, Albert Y. Zomaya |
| 2022 | Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering. | Tom Tseng, Laxman Dhulipala, Julian Shun |
| 2022 | Brief Announcement: Fast(er) Construction of Round-optimal n-Block Broadcast Schedules. | Jesper Larsson Trff |
| 2022 | Keynote Talk: Algorithm Improvement: How Fast Has It Been and How Much Farther Can It Go? | Neil C. Thompson |
| 2022 | Brief Announcement: On the I/O Complexity of Sequential and Parallel Hybrid Integer Multiplication Algorithms. | Lorenzo De Stefani |
| 2022 | Many Sequential Iterative Algorithms Can Be Parallel and (Nearly) Work-efficient. | Zheqi Shen, Zijin Wan, Yan Gu, Yihan Sun |
| 2022 | Performance Analysis and Modelling of Concurrent Multi-access Data Structures. | Adones Rukundo, Aras Atalar, Philippas Tsigas |
| 2022 | Approximate Dynamic Balanced Graph Partitioning. | Harald Rcke, Stefan Schmid, Ruslan Zabrodin |
| 2022 | Preparing for Disaster: Leveraging Precomputation to Efficiently Repair Graph Structures Upon Failures. | Calvin Newport, Nitin H. Vaidya, Alex Weaver |
| 2022 | Balanced Allocations in Batches: Simplified and Generalized. | Dimitrios Los, Thomas Sauerwald |
| 2022 | Brief Announcement: Tight Bounds for Repeated Balls-into-Bins. | Dimitrios Los, Thomas Sauerwald |
| 2022 | Parallel Batch-Dynamic Algorithms for k-Core Decomposition and Related Graph Problems. | Quanquan C. Liu, Jessica Shi, Shangdi Yu, Laxman Dhulipala, Julian Shun |
| 2022 | Permutation Predictions for Non-Clairvoyant Scheduling. | Alexander Lindermayr, Nicole Megow |
| 2022 | Bamboo Trimming Revisited: Simple Algorithms Can Do Well Too. | John Kuszmaul |