| 2021 | A Scalable Concurrent Algorithm for Dynamic Connectivity. Alexander Fedorov, Nikita Koval, Dan Alistarh |
| 2021 | A Scalable Recoverable Skip List for Persistent Memory. Sakib Chowdhury, Wojciech M. Golab |
| 2021 | Algorithms for Right-Sizing Heterogeneous Data Centers. Susanne Albers, Jens Quedenfeld |
| 2021 | Analysis of Busy-Time Scheduling on Heterogeneous Machines. Mozhengfu Liu, Xueyan Tang |
| 2021 | BALM: QoS-Aware Memory Bandwidth Partitioning for Multi-Socket Cloud Nodes. David Gureya, Vladimir Vlassov, João Barreto |
| 2021 | Block-Granularity-Aware Caching. Nathan Beckmann, Phillip B. Gibbons, Charles McGuffey |
| 2021 | Data Oblivious Algorithms for Multicores. Vijaya Ramachandran, Elaine Shi |
| 2021 | Deterministic PRAM Approximate Shortest Paths in Polylogarithmic Time and Slightly Super-Linear Work. Michael Elkin, Shaked Matar |
| 2021 | Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels. Adam Ganczorz, Tomasz Jurdzinski, Mateusz Lewko, Andrzej Pelc |
| 2021 | Distributed Graph Coloring Made Easy. Yannic Maus |
| 2021 | Durable Queues: The Second Amendment. Gal Sela, Erez Petrank |
| 2021 | Efficiency and Stability in Euclidean Network Design. Wilhelm Friedemann, Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, Anna Melnichenko, Jannik Peters, Daniel Stephan, Michael Vaichenker |
| 2021 | Efficient Access History for Race Detection. Yifan Xu, Anchengcheng Zhou, Grace Q. Yin, Kunal Agrawal, I-Ting Angelina Lee, Tao B. Schardl |
| 2021 | Efficient Distributed Algorithms for Convolutional Neural Networks. Rui Li, Yufan Xu, Aravind Sukumaran-Rajam, Atanas Rountev, P. Sadayappan |
| 2021 | Efficient Load-Balancing through Distributed Token Dropping. Sebastian Brandt, Barbara Keller, Joel Rybicki, Jukka Suomela, Jara Uitto |
| 2021 | Efficient Online Weighted Multi-Level Paging. Nikhil Bansal, Joseph (Seffi) Naor, Ohad Talmon |
| 2021 | Efficient Parallel Determinacy Race Detection for Structured Futures. Yifan Xu, Kunal Agrawal, I-Ting Angelina Lee |
| 2021 | Efficient Parallel Self-Adjusting Computation. Daniel Anderson, Guy E. Blelloch, Anubhav Baweja, Umut A. Acar |
| 2021 | Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths. Xiaojun Dong, Yan Gu, Yihan Sun, Yunming Zhang |
| 2021 | Fast Stencil Computations using Fast Fourier Transforms. Zafar Ahmad, Rezaul Chowdhury, Rathish Das, Pramod Ganapathi, Aaron Gregory, Yimin Zhu |
| 2021 | Finding Subgraphs in Highly Dynamic Networks. Keren Censor-Hillel, Victor I. Kolobov, Gregory Schwartzman |
| 2021 | Four Shades of Deterministic Leader Election in Anonymous Networks. Barun Gorain, Avery Miller, Andrzej Pelc |
| 2021 | Hemlock: Compact and Scalable Mutual Exclusion. Dave Dice, Alex Kogan |
| 2021 | Low-Span Parallel Algorithms for the Binary-Forking Model. Zafar Ahmad, Rezaul Chowdhury, Rathish Das, Pramod Ganapathi, Aaron Gregory, Mohammad Mahdi Javanmard |
| 2021 | Massively Parallel Algorithms for Distance Approximation and Spanners. Amartya Shankha Biswas, Michal Dory, Mohsen Ghaffari, Slobodan Mitrovic, Yasamin Nazari |
| 2021 | Min-Max Gathering of Oblivious Robots. Subhash Bhagat, Anisur Rahaman Molla |
| 2021 | Near-Optimal Time-Energy Trade-Offs for Deterministic Leader Election. Yi-Jun Chang, Ran Duan, Shunhua Jiang |
| 2021 | Network Scaffolding for Efficient Stabilization of the Chord Overlay Network. Andrew Berns |
| 2021 | Non-Clairvoyant Scheduling with Predictions. Sungjin Im, Ravi Kumar, Mahshid Montazer Qaem, Manish Purohit |
| 2021 | On Sparsity Awareness in Distributed Computations. Keren Censor-Hillel, Dean Leitersdorf, Volodymyr Polosukhin |
| 2021 | On the Complexity of Load Balancing in Dynamic Networks. Seth Gilbert, Uri Meir, Ami Paz, Gregory Schwartzman |
| 2021 | Optimal Virtual Network Embeddings for Tree Topologies. Aleksander Figiel, Leon Kellerhals, Rolf Niedermeier, Matthias Rost, Stefan Schmid, Philipp Zschoche |
| 2021 | PHPRX: An Efficient Hash Table for Persistent Memory. Diego Cepeda, Wojciech M. Golab |
| 2021 | Paging and the Address-Translation Problem. Michael A. Bender, Abhishek Bhattacharjee, Alex Conway, Martin Farach-Colton, Rob Johnson, Sudarsun Kannan, William Kuszmaul, Nirjhar Mukherjee, Donald E. Porter, Guido Tagliavini, Janet Vorobyeva, Evan West |
| 2021 | Parallel Algorithms for Finding Large Cliques in Sparse Graphs. Lukas Gianinazzi, Maciej Besta, Yannick Schaffner, Torsten Hoefler |
| 2021 | Parallel Minimum Cuts in Daniel Anderson, Guy E. Blelloch |
| 2021 | Parallel Network Mapping Algorithms. Ramtin Afshar, Michael T. Goodrich, Pedro Matias, Martha C. Osegueda |
| 2021 | Pebbles, Graphs, and a Pinch of Combinatorics: Towards Tight I/O Lower Bounds for Statically Analyzable Programs. Grzegorz Kwasniewski, Tal Ben-Nun, Lukas Gianinazzi, Alexandru Calotoiu, Timo Schneider, Alexandros Nikolaos Ziogas, Maciej Besta, Torsten Hoefler |
| 2021 | Provable Advantages for Graph Algorithms in Spiking Neural Networks. James B. Aimone, Yang Ho, Ojas Parekh, Cynthia A. Phillips, Ali Pinar, William Severa, Yipu Wang |
| 2021 | SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, 6-8 July, 2021 Kunal Agrawal, Yossi Azar |
| 2021 | SPAA'21 Panel Paper: Architecture-Friendly Algorithms versus Algorithm-Friendly Architectures. Guy E. Blelloch, William J. Dally, Margaret Martonosi, Uzi Vishkin, Katherine A. Yelick |
| 2021 | Scheduling Opportunistic Links in Two-Tiered Reconfigurable Datacenters. Janardhan Kulkarni, Stefan Schmid, Pawel Schmidt |
| 2021 | Semantic Conflict Detection for Transactional Data Structure Libraries. Yaodong Sheng, Ahmed Hassan, Michael F. Spear |
| 2021 | Speed Scaling with Explorable Uncertainty. Evripidis Bampis, Konstantinos Dogeas, Alexander V. Kononov, Giorgio Lucarelli, Fanny Pascual |
| 2021 | String Matching with Wildcards in the Massively Parallel Computation Model. MohammadTaghi Hajiaghayi, Hamed Saleh, Saeed Seddighin, Xiaorui Sun |
| 2021 | Supervised Average Consensus in Anonymous Dynamic Networks. Dariusz R. Kowalski, Miguel A. Mosteiro |
| 2021 | The Processing-in-Memory Model. Hongbo Kang, Phillip B. Gibbons, Guy E. Blelloch, Laxman Dhulipala, Yan Gu, Charles McGuffey |
| 2021 | Toward Self-Adjusting Networks for the Matching Model. Evgeniy Feder, Ichha Rathod, Punit Shyamsukha, Robert Sama, Vitaly Aksenov, Iosif Salem, Stefan Schmid |
| 2021 | VBR: Version Based Reclamation. Gali Sheffi, Maurice Herlihy, Erez Petrank |
| 2021 | Work-Optimal Parallel Minimum Cuts for Non-Sparse Graphs. Andrés López-Martínez, Sagnik Mukhopadhyay, Danupon Nanongkai |