Hovering your mouse over the title of a talk will typically display its abstract, and clicking on an author's name in the program below will take you to a page containing information about that author, which is typically the author's homepage, if one is available. Links to the papers in the ACM Digital Library will be added once they become available.
Click here to explore the Correlation Heat Map of the program, which may provide some insight into how closely related the papers are in terms of their content and research topics.
| Monday, July 6: Workshops and Tutorials | |||||
| 09:00 - 10:00 | Student Spotlight Workshop 2026: Session 1 (Joint with PODC) | ||||
| Naama Ben-David (Technion), Hanna Komlós (Max Planck Institute for Informatics) | |||||
| 10:00 - 10:30 | Coffee | ||||
| 10:30 - 12:30 | Student Spotlight Workshop 2026: Session 2 (Joint with PODC) | ||||
| Naama Ben-David (Technion), Hanna Komlós (Max Planck Institute for Informatics) | |||||
| 12:30 - 14:00 | Lunch | ||||
| 14:00 - 15:00 | Parallel Spatial Data Structures | Grassroots Computing: Session 1 (Joint with PODC) | |||
| Yan Gu (University of California, Riverside), Ziyang Men (University of California, Riverside), Yihan Sun (University of California, Riverside) | Idit Keidarl (Technion), Andrew Lewis-Pye (London School of Economics and Political Science), Ehud Shapiro (Weizmann Institute of Science) | ||||
| 15:00 - 15:30 | Coffee | ||||
| 15:30 - 17:30 | Grassroots Computing: Session 2 (Joint with PODC) | Student Spotlight Workshop 2026: Poster Session (Joint with PODC) | |||
| Idit Keidarl (Technion), Andrew Lewis-Pye (London School of Economics and Political Science), Ehud Shapiro (Weizmann Institute of Science) | Naama Ben-David (Technion), Hanna Komlós (Max Planck Institute for Informatics) | ||||
|
Tuesday, July 7: Conference Day 1
Venue: Queens Building Lecture Theatre ( Locate )
| ||
| 08:35 - 08:40 | Opening Remarks | |
| 08:40 - 10:00 | Session 1: Scheduling Algorithms | |
| 08:40 | Faster EPTAS for Scheduling on Uniform Machines | |
| Klaus Jansen (Kiel University), Björn Schumacher (Kiel University), Roberto Solis-Oba (Western University) | ||
| 09:00 | Lossless Robustification of Packet Scheduling Algorithms | |
| Yossi Azar (Tel Aviv University), Or Vardi (Tel Aviv University) | ||
| 09:20 | Improved Approximation Algorithms for Parallel Task Scheduling and Multiple Cluster Scheduling | |
| Bennet Edler (Kiel University), Klaus Jansen (Kiel University), Felix Ohnesorge (Kiel University), Lis Pirotton (Kiel University) | ||
| 09:40 | Online Span Minimization for Flexible Uniform Jobs | |
| Mozhengfu Liu (Northwestern University), Samir Khuller (Northwestern University), Xueyan Tang (Nanyang Technological University) | ||
| 10:00 - 10:30 | Coffee | |
| 10:30 - 11:30 | Session 2: Parallel (Shared-Memory) Graph Algorithms | |
| 10:30 | A Practical Parallel Algorithm for Expander Decompositions | |
| Robin Münk (Technical University of Munich) | ||
| 10:50 | Efficient Parallel (Δ + 1)-Edge-Coloring | |
| Michael Elkin (Ben-Gurion University of the Negev), Ariel Khuzman (Ben-Gurion University of the Negev) | ||
| 11:10 | Parallel Spectral Graph Sparsification via Low Diameter Decompositions | |
| Yves Baumann (ETH Zurich), Gernot Zöcklein (ETH Zurich) | ||
| 11:30 - 11:40 | Short Break | |
| 11:40 - 12:20 | Session 3: Brief Announcements: Fault Tolerance, Dispersion, and Consensus | |
| 11:40 | Brief Announcement: Asynchronous Dispersion with Optimal Time Complexity | |
| Debasish Pattanayak (Indian Institute of Technology Indore), Ajay Kshemkalyani (University of Illinois at Chicago), Manish Kumar (Indian Institute of Technology Madras), Anisur Rahaman Molla (Indian Statistical Institute, Kolkata), Gokarna Sharma (Kent State University) | ||
| 11:50 | Brief Announcement: An Improved Lower Bound for Local Failover Routing on Directed Networks | |
| Erik van den Akker (TU Dortmund), Klaus-Tycho Foerster (TU Dortmund) | ||
| 12:00 | Brief Announcement: Byzantine Generals with Stuttering Madness | |
| Bo Pan (Sorbonne Université, CNRS, LIP6, Paris, France), Maria Potop-Butucaru (Sorbonne Université, CNRS, LIP6, Paris, France) | ||
| 12:10 | Brief Announcement: Discrete Incremental Voting - New Bounds for General Graphs and Expanders | |
| Petra Berenbrink (University of Hamburg), Colin Cooper (King's College London), Thorsten Götte (University of Hamburg), Lukas Hintze (University of Hamburg), Tomasz Radzik (King's College London) | ||
| 12:20 - 14:00 | Lunch | |
| 14:00 - 15:00 | Session 4: Concurrent Data Structures | |
| 14:00 | uSTM: A Lightweight and Efficient STM Supporting General Types and Deferred Aborts | |
| Zachary Kent (Carnegie Mellon University), Guy Blelloch (Carnegie Mellon University), André Costa (Carnegie Mellon University) | ||
| 14:20 | KDB: A Scalable Persistent Key-Value Store with Atomic Batches and Snapshots | |
| Tadeusz Kobus (Poznan University of Technology), Maciej Kokociński (Poznan University of Technology), Krzysztof Kortas (Poznan University of Technology), Paweł T. Wojciechowski (Poznan University of Technology) | ||
| 14:40 | Big Atomics: Non-Blocking Algorithms with a Direct Fast Path | |
| Daniel Anderson (Carnegie Mellon University), Guy Blelloch (Carnegie Mellon University), Zachary Kent (Carnegie Mellon University), Siddhartha Jayanti (Dartmouth College) | ||
| 15:00 - 15:05 | Short Break | |
| 15:05 - 16:05 | Session 5: Fault Tolerance in Distributed Systems | |
| 15:05 | Asynchronous Verifiable Information Dispersal with Low Space and Communication Complexity | |
| Thomas Locher (DFINITY), Yvonne-Anne Pignolet (DFINITY) | ||
| 15:25 | Towards Reliable Broadcast with Optimal Communication and Round Complexity | |
| Thomas Locher (DFINITY), Victor Shoup (Category Labs) | ||
| 15:45 | Deterministic Fault-Tolerant Local Load Balancing and its Applications against Adaptive Adversaries | |
| Dariusz R. Kowalski (Augusta University), Jan Olkowski (Independent Researcher) | ||
| 16:05 - 16:25 | Coffee | |
| 16:25 - 17:35 | Session 6: PODC/SPAA Joint Keynote Talk 1 | |
| 16:25 | Keynote Talk: Parallel Algorithm Engineering Reconsidered | |
| Peter Sanders (Karlsruhe Institute of Technology) | ||
| 17:35 - 17:45 | Short Break | |
| 17:45 - 19:15 | SPAA Business Meeting | |
|
Wednesday, July 8: Conference Day 2
Venue: Queens Building Lecture Theatre ( Locate )
|
||
| 08:40 - 10:00 | Session 1: Parallel and (More) Concurrent Data Structures | |
| 08:40 | Parallel Metric Skip Lists and Nearest Neighbor Search | |
| Xiangyun Ding (University of California, Riverside), Rohin Garg (Massachusetts Institute of Technology), Yan Gu (University of California, Riverside), Yihan Sun (University of California, Riverside) | ||
| 09:00 | Fast Concurrent Primitives Despite Contention | |
| Michael A. Bender (Stony Brook University), Guy Blelloch (Carnegie Mellon University), Martin Farach-Colton (New York University), Yang Hu (Tsinghua University), Rob Johnson (VMware Research), Rotem Oshman (Tel-Aviv University and New York University), Renfei Zhou (Carnegie Mellon University) | ||
| 09:20 | Fast and Theoretically Efficient Batch-Parallel Link-Cut Trees, Euler Tour Trees, and Treaps | |
| Quinten De Man (University of Maryland), Laxman Dhulipala (University of Maryland) | ||
| 09:40 | CleanANN: Efficient and Robust Full Dynamism in Graph-based Approximate Nearest Neighbor Search | |
| Ziyu Zhang (Massachusetts Institute of Technology), Yuanhao Wei (University of British Columbia), Joshua Engels (Massachusetts Institute of Technology), Julian Shun (Massachusetts Institute of Technology) | ||
| 10:00 - 10:25 | Coffee | |
| 10:25 - 11:25 | Session 2: Energy-Efficient Computing | |
| 10:25 | Exponential Energy Savings in Local Distributed Graph Algorithms | |
| Mohsen Ghaffari (Massachusetts Institute of Technology), Zi Song Yeoh (Boston University) | ||
| 10:45 | Energy-Efficient Aggregation and Minimum-Degree Spanning Trees in Radio Networks | |
| Yi-Jun Chang (National University of Singapore), Yang Ze Guan (National University of Singapore) | ||
| 11:05 | Minimizing Total Flow Time in the Online Active-Time Scheduling Model | |
| Susanne Albers (Technische Universität München), Gorsha Wessel van der Heijden (Technische Universität München) | ||
| 11:25 - 11:30 | Short Break | |
| 11:30 - 12:20 | Session 3: Brief Announcements: Performance Modeling, Analysis, and Optimization | |
| 11:30 | Brief Announcement: An Automatic Framework for High Performance Alternative Basis Fast Matrix Multiplication | |
| Niv Bruker (Hebrew University of Jerusalem), Oded Schwarz (Hebrew University of Jerusalem), Noa Vaknin (Hebrew University of Jerusalem) | ||
| 11:40 | Brief Announcement: An I/O-Efficient Parallel FFT for Heterogeneous Architectures via a Single Global Exchange | |
| Shina Guo (College of Computer Science and Artificial Intelligence, Fudan University), Weiguo Gao (School of Mathematics, School of Data Science, Fudan University), Yuan Tang (College of Computer Science and Artificial Intelligence, Fudan University) | ||
| 11:50 | Brief Announcement: PRESERVE: Prefetching Model Weights and KV-Cache in Distributed LLM Serving | |
| Ahmet Caner Yüzügüler (Huawei Research Zurich), Jiawei Zhuang (Huawei Research Zurich), Lukas Cavigelli (Huawei Research Zurich) | ||
| 12:00 | Brief Announcement: Tiered Memory Computation | |
| Marcos K. Aguilera (NVIDIA), Naama Ben-David (Technion), N. Efe Çekirge (Dartmouth College), Siddhartha Jayanti (Dartmouth College) | ||
| 12:10 | Brief Announcement: Energy-Time Trajectories: A Tool to Understand Complex Parallel Efficiency | |
| Peter M. Kogge (University of Notre Dame) | ||
| 12:20 - 14:10 | Lunch | |
| 14:10 - 15:30 | Session 4: Distributed Graph Algorithms | |
| 14:10 | Distributed Dominating Set With Optimal Rounds and Message Size in Bounded Arboricity Graphs | |
| Sharareh Alipour (Tehran Institute for Advanced Studies (TeIAS), Khatam University), Ermiya Farokhnejad (University of Warwick) | ||
| 14:30 | Time-, Message- and Memory-Optimal Distributed Minimum Spanning Tree and Partwise Aggregation | |
| Michael Elkin (Ben-Gurion University of the Negev), Tanya Goldenfeld (Ben-Gurion University of the Negev) | ||
| 14:50 | Near-Optimal Bounds for Adversarial Wake-up in Distributed Networks | |
| Peter Robinson (Augusta University), Ming Ming Tan (Augusta University) | ||
| 15:10 | Deterministic Distance Approximation in MPC via Improved Hitting Sets | |
| Kyungjin Cho (TU Graz), Michal Dory (University of Haifa), Yannic Maus (TU Graz), Tijn de Vos (TU Graz) | ||
| 15:30 - 16:00 | Coffee | |
| 16:00 - 17:00 | Session 5: Paging and PIM Scheduling | |
| 16:00 | Tight Latency Guarantees for Weighted Caching with Delayed Hits | |
| Joseph (Seffi) Naor (Technion), Tomer Tsachor (Technion) | ||
| 16:20 | Non-Clairvoyant Scheduling for Processing-in-Memory | |
| Hongbo Kang (Tsinghua University), Yiwei Zhao (Carnegie Mellon University), Kunal Agrawal (Washington University in St. Louis), Yongwei Wu (Tsinghua University), Phillip B. Gibbons (Carnegie Mellon University) | ||
| 16:40 | The Local/Global Disk Problem: How to Use Shared High-Bandwidth Storage Economically | |
| Michael A. Bender (Stony Brook University), Philip Bille (DTU Compute), Martin Farach-Colton (New York University), Jeremy Fineman (Georgetown University), Michael Goodrich (University of California, Irvine), Hanna Komlós (Max Planck Institute for Informatics), Inge Li Gørtz (DTU Compute), Bradley C. Kuszmaul (RelationalAI), William Kuszmaul (Carnegie Mellon University), Rose Silver (Carnegie Mellon University), Todd Veldhuizen (RelationalAI), Renfei Zhou (Carnegie Mellon University) | ||
| 17:00 - 19:30 | Long Break | |
| 19:30 - 21:30 | Banquet | |
|
Thursday, July 9: Conference Day 3
Venue: Queens Building Lecture Theatre ( Locate )
|
||
| 08:40 - 10:00 | Session 1: Performance Analysis and Optimization for Modern Computing Systems | |
| 08:40 | Reducing Off-Chip Prefetch Request Latency of LLC Hardware Prefetchers via Neural Prediction | |
| Zhengwei Huang (NUDT, Changsha, China), Wei Guo (NUDT, Changsha, China), Yongwen Wang (NUDT, Changsha, China) | ||
| 09:00 | PaHiS: A Hierarchical Synchronous Parallel Model for Irregular Workloads | |
| Petros Anastasiadis (Computing Systems Laboratory, Huawei Technologies, Zurich, Switzerland), Denis Jelovina (Computing Systems Laboratory, Huawei Technologies, Zurich, Switzerland), Albert-Jan N. Yzelman (Computing Systems Laboratory, Huawei Technologies, Zurich, Switzerland) | ||
| 09:20 | Design Tradeoffs in Backend Organization in Out-Of-Order RISC-V Processors | |
| Esther Alonso (University of Cantabria), Pablo Abad (University of Cantabria), Pablo Prieto (University of Cantabria), Valentin Puente (University of Cantabria) | ||
| 09:40 | Scheduler Augmentation: A Lightweight, Customizable, Low-Cost Profiling Technique for Fork-Join Parallel Programs | |
| Sam Westrick (New York University), Darshan Dinesh Kumar (New York University), Seong-Heon Jung (New York University) | ||
| 10:00 - 10:30 | Coffee | |
| 10:30 - 11:30 | Session 2: SPAA Parallel Computing Award Talk | |
| 10:30 | Keynote Talk: Lessons Learned from Four Decades of Parallel Computing | |
| Phillip Gibbons (Carnegie Mellon University) | ||
| 11:30 - 11:40 | Short Break | |
| 11:40 - 12:20 | Session 3: Brief Announcements: Concurrency, Partitioning, and Scheduling | |
| 11:40 | Brief Announcement: QPID: A Scalable, Strict Concurrent Priority Queue | |
| Olivia Grimes (Lehigh University), Matthew Rodriguez (Commonwealth University - Bloomsburg), Ahmed Hassan (Lehigh University), Michael Spear (Lehigh University), Roberto Palmieri (Lehigh University) | ||
| 11:50 | Brief Announcement: Recyclable Optimistic-Traversal Data Structures | |
| Md Amit Hasan Arovi (The Pennsylvania State University), Ruslan Nikolaev (The Pennsylvania State University) | ||
| 12:00 | Brief Announcement: Direction-incentivized Spectral Partitioning for Acyclic Graphs | |
| Dimosthenis Pasadakis (Università della Svizzera italiana (USI)), Raphael S. Steiner (Huawei Research Center Zurich, Computing Systems Lab), Pál András Papp (Huawei Research Center Zurich, Computing Systems Lab), Toni Böhnlein (Huawei Research Center Zurich, Computing Systems Lab), Albert-Jan N. Yzelman (Huawei Research Center Zurich, Computing Systems Lab) | ||
| 12:10 | Brief Announcement: Scheduling Problems with Constrained Rejections | |
| Sami Davies (UC Berkeley and Relational AI), Venkatesan Guruswami (Simons Institute and UC Berkeley), Xuandi Ren (UC Berkeley) | ||
| 12:20 - 14:00 | Lunch | |
| 14:00 - 15:00 | Session 4: More Distributed Algorithms | |
| 14:00 | Non-Uniform Content-Oblivious Leader Election on Oriented Asynchronous Rings | |
| Jérémie Chalopin (CNRS, Aix-Marseille Université), Yi-Jun Chang (National University of Singapore), Lyuting Chen (National University of Singapore), Giuseppe Antonio Di Luna (University of Rome - Sapienza), Haoran Zhou (National University of Singapore) | ||
| 14:20 | Universal Deterministic Symmetry Breaking Between Anonymous Agents in Networks | |
| Bibhuti Das (Université du Québec en Outaouais, Canada), Andrzej Pelc (Université du Québec en Outaouais, Canada) | ||
| 14:40 | Composable Coresets for Fair Diversity Maximization | |
| Ali Ahmadvand (Sharif University of Technology), Mohammad Ansari (Sharif University of Technology), Mobin Razavi (Sharif University of Technology), Hamid Zarrabi-Zadeh (Sharif University of Technology) | ||
| 15:00 - 15:15 | Short Break | |
| 15:15 - 16:15 | Session 5: Lower Bounds and Optimality | |
| 15:15 | Cell-Probe Lower Bounds for Data Structures in CRCW PRAM |
|
| Peyman Afshani (Aarhus University), Magnus Christian Ring Merrild (Aarhus University) | ||
| 15:35 | Communication Lower Bounds and Algorithms for Sketching with Random Dense Matrices | |
| Hussam Al Daas (Rutherford Appleton Laboratory), Grey Ballard (Wake Forest University), Laura Grigori (École Polytechnique Fédérale de Lausanne), Md Taufique Hussain (Wake Forest University), Suraj Kumar (INRIA Lyon), Mohammad Marufur Rahman (Wake Forest University), Kathryn Rouse (Inmar Intelligence) | ||
| 15:55 | Near-Optimal Parallel Approximate Counting via Sampling | |
| David G. Harris (University of Maryland), Vladimir Kolmogorov (Institute of Science and Technology Austria), Hongyang Liu (Nanjing University), Yitong Yin (Nanjing University), Yiyao Zhang (Nanjing University) | ||
| 16:15 - 16:45 | Coffee | |
| 16:45 - 17:55 | Session 6: PODC/SPAA Joint Keynote Talk 2 | |
| 16:25 | Keynote Talk: Highly Asynchronous Concurrency in Data Structures | |
| Robert Tarjan (Princeton University) | ||
| 17:55 - 18:00 | Closing Remarks | |