| 2026 | CleanANN: Efficient and Robust Full Dynamism in Graph-based Approximate Nearest Neighbor Search. | Ziyu Zhang, Yuanhao Wei, Joshua Engels, Julian Shun |
| 2026 | Brief Announcement: PRESERVE: Prefetching Model Weights and KV-Cache in Distributed LLM Serving. | Ahmet Caner Yzgler, Jiawei Zhuang, Lukas Cavigelli |
| 2026 | Scheduler Augmentation: A Lightweight, Customizable, Low-Cost Profiling Technique for Fork-Join Parallel Programs. | Sam Westrick, Darshan Dinesh Kumar, Seong-Heon Jung |
| 2026 | Tight Latency Guarantees for Weighted Caching with Delayed Hits. | Tomer Tsachor, Joseph (Seffi) Naor |
| 2026 | Keynote Talk: Highly Asynchronous Concurrency in Data Structures. | Robert E. Tarjan |
| 2026 | Keynote Talk: Parallel Algorithm Engineering Reconsidered. | Peter Sanders |
| 2026 | Near-Optimal Bounds for Adversarial Wake-up in Distributed Networks. | Peter Robinson, Ming Ming Tan |
| 2026 | Brief Announcement: Asynchronous Dispersion with Optimal Time Complexity. | Debasish Pattanayak, Ajay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla, Gokarna Sharma |
| 2026 | Brief Announcement: Direction-Incentivized Spectral Partitioning for Acyclic Graphs. | Dimosthenis Pasadakis, Raphael S. Steiner, Pl Andrs Papp, Toni Bhnlein, Albert-Jan Nicholas Yzelman |
| 2026 | Brief Announcement: Byzantine Generals with Stuttering Madness. | Bo Pan, Maria Potop-Butucaru |
| 2026 | A Practical Parallel Algorithm for Expander Decompositions. | Robin Mnk |
| 2026 | Fast and Theoretically Efficient Batch-Parallel Link-Cut Trees, Euler Tour Trees, and Treaps. | Quinten De Man, Laxman Dhulipala |
| 2026 | Towards Reliable Broadcast with Optimal Communication and Round Complexity. | Thomas Locher, Victor Shoup |
| 2026 | Asynchronous Verifiable Information Dispersal with Low Space and Communication Complexity. | Thomas Locher, Yvonne-Anne Pignolet |
| 2026 | Online Span Minimization for Flexible Uniform Jobs. | Mozhengfu Liu, Samir Khuller, Xueyan Tang |
| 2026 | Deterministic Fault-Tolerant Local Load Balancing and its Applications against Adaptive Adversaries. | Dariusz Rafal Kowalski, Jan Olkowski |
| 2026 | Brief Announcement: Energy-Time Trajectories: A Tool to Understand Complex Parallel Efficiency. | Peter Michael Kogge |
| 2026 | KDB: A Scalable Persistent Key-Value Store with Atomic Batches and Snapshots. | Tadeusz Kobus, Maciej Kokocinski, Krzysztof Kortas, Pawel T. Wojciechowski |
| 2026 | Efficient Parallel (Δ + 1)-Edge-Coloring. | Ariel Khuzman, Michael Elkin |
| 2026 | uSTM: A Lightweight and Efficient STM Supporting General Types and Deferred Aborts. | Zachary Kent, Guy E. Blelloch, Andr Costa |
| 2026 | Non-Clairvoyant Scheduling for Processing-in-Memory. | Hongbo Kang, Yiwei Zhao, Kunal Agrawal, Yongwei Wu, Phillip B. Gibbons |
| 2026 | Faster EPTAS for Scheduling on Uniform Machines. | Klaus Jansen, Bjrn Schumacher, Roberto Solis-Oba |
| 2026 | Reducing Off-Chip Prefetch Request Latency of LLC Hardware Prefetchers via Neural Prediction. | Zhengwei Huang, Wei Guo, Yongwen Wang |
| 2026 | Near-Optimal Parallel Approximate Counting via Sampling. | David G. Harris, Vladimir Kolmogorov, Hongyang Liu, Yitong Yin, Yiyao Zhang |
| 2026 | Brief Announcement: An I/O-Efficient Parallel FFT for Heterogeneous Architectures via a Single Global Exchange. | Shina Guo, Weiguo Gao, Yuan Tang |