| 2022 | A Fully-Distributed Scalable Peer-to-Peer Protocol for Byzantine-Resilient Distributed Hash Tables. John Augustine, Soumyottam Chatterjee, Gopal Pandurangan |
| 2022 | A NUMA-Aware Recoverable Mutex Lock. Ahmed Fahmy, Wojciech M. Golab |
| 2022 | Achieving Sublinear Complexity under Constant T in T-interval Dynamic Networks. Ruomu Hou, Irvan Jahja, Yucheng Sun, Jiyan Wu, Haifeng Yu |
| 2022 | Adaptive Massively Parallel Algorithms for Cut Problems. MohammadTaghi Hajiaghayi, Marina Knittel, Jan Olkowski, Hamed Saleh |
| 2022 | Approximate Dynamic Balanced Graph Partitioning. Harald Räcke, Stefan Schmid, Ruslan Zabrodin |
| 2022 | Automatic HBM Management: Models and Algorithms. Daniel DeLayo, Kenny Zhang, Kunal Agrawal, Michael A. Bender, Jonathan W. Berry, Rathish Das, Benjamin Moseley, Cynthia A. Phillips |
| 2022 | Average Awake Complexity of MIS and Matching. Mohsen Ghaffari, Julian Portmann |
| 2022 | Balanced Allocations in Batches: Simplified and Generalized. Dimitrios Los, Thomas Sauerwald |
| 2022 | Balancing Flow Time and Energy Consumption. Sami Davies, Samir Khuller, Shirley Zhang |
| 2022 | Bamboo Trimming Revisited: Simple Algorithms Can Do Well Too. John Kuszmaul |
| 2022 | Brief Announcement: A Parallel (Δ, Γ)-Stepping Algorithm for the Constrained Shortest Path Problem. Tayebeh Bahreini, Nathan Fisher, Daniel Grosu |
| 2022 | Brief Announcement: Composable Dynamic Secure Emulation. Pierre Civit, Maria Potop-Butucaru |
| 2022 | Brief Announcement: Distributed Lightweight Spanner Construction for Unit Ball Graphs in Doubling Metrics. David Eppstein, Hadi Khodabandeh |
| 2022 | Brief Announcement: Fast(er) Construction of Round-optimal n-Block Broadcast Schedules. Jesper Larsson Träff |
| 2022 | Brief Announcement: Faster Stencil Computations using Gaussian Approximations. Zafar Ahmad, Rezaul Chowdhury, Rathish Das, Pramod Ganapathi, Aaron Gregory, Yimin Zhu |
| 2022 | Brief Announcement: Nested Active-Time Scheduling. Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, Seeun William Umboh |
| 2022 | Brief Announcement: On the I/O Complexity of Sequential and Parallel Hybrid Integer Multiplication Algorithms. Lorenzo De Stefani |
| 2022 | Brief Announcement: Spatial Locality and Granularity Change in Caching. Nathan Beckmann, Phillip B. Gibbons, Charles McGuffey |
| 2022 | Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion. Thorsten Götte, Christian Scheideler |
| 2022 | Brief Announcement: Tight Bounds for Repeated Balls-into-Bins. Dimitrios Los, Thomas Sauerwald |
| 2022 | Brief Announcement: Tight Memory-Independent Parallel Matrix Multiplication Communication Lower Bounds. Hussam Al Daas, Grey Ballard, Laura Grigori, Suraj Kumar, Kathryn Rouse |
| 2022 | Brief Announcement: Towards a More Robust Algorithm for Flow Time Scheduling with Predictions. Tianming Zhao, Chunhao Li, Wei Li, Albert Y. Zomaya |
| 2022 | Competitive Algorithms for Block-Aware Caching. Christian Coester, Roie Levin, Joseph (Seffi) Naor, Ohad Talmon |
| 2022 | Contention Resolution for Coded Radio Networks. Michael A. Bender, Seth Gilbert, Fabian Kuhn, John Kuszmaul, Muriel Médard |
| 2022 | Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates. Marcel Bezdrighin, Michael Elkin, Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Václav Rozhon |
| 2022 | Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs. Taisuke Izumi, Naoki Kitamura, Takamasa Naruse, Gregory Schwartzman |
| 2022 | HybriDS: Cache-Conscious Concurrent Data Structures for Near-Memory Processing Architectures. Jiwon Choe, Andrew Crotty, Tali Moreshet, Maurice Herlihy, R. Iris Bahar |
| 2022 | I/O-Optimal Algorithms for Symmetric Linear Algebra Kernels. Olivier Beaumont, Lionel Eyraud-Dubois, Julien Langou, Mathieu Vérité |
| 2022 | Keynote Talk: Algorithm Improvement: How Fast Has It Been and How Much Farther Can It Go? Neil C. Thompson |
| 2022 | Keynote Talk: Large Scale Parallel Sparse Matrix Streaming Graph/Network Analysis. Jeremy Kepner |
| 2022 | Many Sequential Iterative Algorithms Can Be Parallel and (Nearly) Work-efficient. Zheqi Shen, Zijin Wan, Yan Gu, Yihan Sun |
| 2022 | Massively Parallel Algorithms for b-Matching. Mohsen Ghaffari, Christoph Grunau, Slobodan Mitrovic |
| 2022 | Online Parallel Paging with Optimal Makespan. Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, Michele Scquizzato |
| 2022 | PREP-UC: A Practical Replicated Persistent Universal Construction. Gaetano C. Coccimiglio, Trevor Alexander Brown, Srivatsan Ravi |
| 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 | Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering. Tom Tseng, Laxman Dhulipala, Julian Shun |
| 2022 | Parallel Cover Trees and their Applications. Yan Gu, Zachary Napier, Yihan Sun, Letong Wang |
| 2022 | Parallel Shortest Paths with Negative Edge Weights. Nairen Cao, Jeremy T. Fineman, Katina Russell |
| 2022 | Performance Analysis and Modelling of Concurrent Multi-access Data Structures. Adones Rukundo, Aras Atalar, Philippas Tsigas |
| 2022 | Permutation Predictions for Non-Clairvoyant Scheduling. Alexander Lindermayr, Nicole Megow |
| 2022 | Preparing for Disaster: Leveraging Precomputation to Efficiently Repair Graph Structures Upon Failures. Calvin Newport, Nitin H. Vaidya, Alex Weaver |
| 2022 | Robust and Optimal Contention Resolution without Collision Detection. Yonggang Jiang, Chaodong Zheng |
| 2022 | SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022 Kunal Agrawal, I-Ting Angelina Lee |
| 2022 | Scalable Fine-Grained Parallel Cycle Enumeration Algorithms. Jovan Blanusa, Paolo Ienne, Kubilay Atasu |
| 2022 | Sparse Matrix Multiplication in the Low-Bandwidth Model. Chetan Gupta, Juho Hirvonen, Janne H. Korhonen, Jan Studený, Jukka Suomela |
| 2022 | The Energy Complexity of Las Vegas Leader Election. Yi-Jun Chang, Shunhua Jiang |
| 2022 | The k-Server with Preferences Problem. Jannik Castenow, Björn Feldkord, Till Knollmann, Manuel Malatyali, Friedhelm Meyer auf der Heide |
| 2022 | wCQ: A Fast Wait-Free Queue with Bounded Memory Usage. Ruslan Nikolaev, Binoy Ravindran |