| 2026 | Brief Announcement: QPID: A Scalable, Strict Concurrent Priority Queue. | Olivia Grimes, Matthew Rodriguez, Ahmed Hassan, Michael F. Spear, Roberto Palmieri |
| 2026 | Keynote Talk: Lessons Learned from Four Decades of Parallel Computing. | Phillip B. Gibbons |
| 2026 | Exponential Energy Savings in Local Distributed Graph Algorithms. | Mohsen Ghaffari, Zi Song Yeoh |
| 2026 | Time-, Message- and Memory-Efficient Distributed Minimum Spanning Tree and Partwise Aggregation. | Michael Elkin, Tanya Goldenfeld |
| 2026 | Improved Approximation Algorithms for Parallel Task Scheduling and Multiple Cluster Scheduling. | Bennet Edler, Klaus Jansen, Felix Ohnesorge, Lis Pirotton |
| 2026 | Parallel Metric Skip Lists and Nearest Neighbor Search. | Xiangyun Ding, Rohin Garg, Yan Gu, Yihan Sun |
| 2026 | Brief Announcement: Scheduling Problems with Constrained Rejections. | Sami Davies, Venkatesan Guruswami, Xuandi Ren |
| 2026 | Universal Deterministic Symmetry Breaking Between Anonymous Agents in Networks. | Bibhuti Das, Andrzej Pelc |
| 2026 | Communication Lower Bounds and Algorithms for Sketching with Random Dense Matrices. | Hussam Al Daas, Grey Ballard, Laura Grigori, Md Taufique Hussain, Suraj Kumar, Mohammad Marufur Rahman, Kathryn Rouse |
| 2026 | Deterministic Distance Approximation in MPC via Improved Hitting Sets. | Kyungjin Cho, Michal Dory, Yannic Maus, Tijn de Vos |
| 2026 | Energy-Efficient Aggregation and Minimum-Degree Spanning Trees in Radio Networks. | Yi-Jun Chang, Yang Ze Guan |
| 2026 | Non-Uniform Content-Oblivious Leader Election on Oriented Asynchronous Rings. | Jrmie Chalopin, Yi-Jun Chang, Lyuting Chen, Giuseppe Antonio Di Luna, Haoran Zhou |
| 2026 | Brief Announcement: An Automatic Framework for High Performance Alternative Basis Fast Matrix Multiplication. | Niv Bruker, Oded Schwartz, Noa Vaknin |
| 2026 | Brief Announcement: Discrete Incremental Voting - New Bounds for General Graphs and Expanders. | Petra Berenbrink, Colin Cooper, Thorsten Gtte, Lukas Hintze, Tomasz Radzik |
| 2026 | Fast Concurrent Primitives Despite Contention. | Michael A. Bender, Guy E. Blelloch, Martin Farach-Colton, Yang Hu, Rob Johnson, Rotem Oshman, Renfei Zhou |
| 2026 | The Local/Global Disk Problem: How to Use Shared High-Bandwidth Storage Economically. | Michael A. Bender, Philip Bille, Martn Farach-Colton, Jeremy T. Fineman, Inge Li Grtz, Michael T. Goodrich, Hanna Komls, Bradley C. Kuszmaul, William Kuszmaul, Rose Silver, Todd Veldhuizen, Renfei Zhou |
| 2026 | Parallel Spectral Graph Sparsification via Low Diameter Decompositions. | Yves Baumann, Gernot Zcklein |
| 2026 | Lossless Robustification of Packet Scheduling Algorithms. | Yossi Azar, Or Vardi |
| 2026 | Brief Announcement: Recyclable Optimistic-Traversal Data Structures. | Md Amit Hasan Arovi, Ruslan Nikolaev |
| 2026 | Big Atomics: Non-Blocking Algorithms with a Direct Fast Path. | Daniel Anderson, Guy E. Blelloch, Zachary Kent, Siddhartha Jayanti |
| 2026 | PaHiS: A Hierarchical Synchronous Parallel Model for Irregular Workloads. | Petros Anastasiadis, Denis Jelovina, Albert-Jan Nicholas Yzelman |
| 2026 | Design Tradeoffs in Backend Organization in Out-Of-Order RISC-V Processors. | Esther Alonso, Pablo Prieto, Pablo Abad, Valentin Puente |
| 2026 | Distributed Dominating Set With Optimal Rounds and Message Size in Bounded Arboricity Graphs. | Sharareh Alipour, Ermiya Farokhnejad |
| 2026 | Minimizing Total Flow Time in the Online Active-Time Scheduling Model. | Susanne Albers, Gorsha Wessel van der Heijden |
| 2026 | Brief Announcement: An improved lower bound for local failover routing on directed networks. | Erik van den Akker, Klaus-Tycho Foerster |