Abstract is missing.
- SPAA'21 Panel Paper: Architecture-Friendly Algorithms versus Algorithm-Friendly ArchitecturesGuy E. Blelloch, William J. Dally, Margaret Martonosi, Uzi Vishkin, Katherine A. Yelick. 1-7 [doi]
- Fast Stencil Computations using Fast Fourier TransformsZafar Ahmad, Rezaul Chowdhury, Rathish Das, Pramod Ganapathi, Aaron Gregory, Yimin Zhu. 8-21 [doi]
- Low-Span Parallel Algorithms for the Binary-Forking ModelZafar Ahmad, Rezaul Chowdhury, Rathish Das, Pramod Ganapathi, Aaron Gregory, Mohammad Mahdi Javanmard. 22-34 [doi]
- Provable Advantages for Graph Algorithms in Spiking Neural NetworksJames B. Aimone, Yang Ho, Ojas Parekh, Cynthia A. Phillips, Ali Pinar, William Severa, Yipu Wang. 35-47 [doi]
- Algorithms for Right-Sizing Heterogeneous Data CentersSusanne Albers, Jens Quedenfeld. 48-58 [doi]
- Efficient Parallel Self-Adjusting ComputationDaniel Anderson, Guy E. Blelloch, Anubhav Baweja, Umut A. Acar. 59-70 [doi]
- n) Work and Low DepthDaniel Anderson, Guy E. Blelloch. 71-82 [doi]
- Speed Scaling with Explorable UncertaintyEvripidis Bampis, Konstantinos Dogeas, Alexander V. Kononov, Giorgio Lucarelli, Fanny Pascual. 83-93 [doi]
- Efficient Online Weighted Multi-Level PagingNikhil Bansal, Joseph (Seffi) Naor, Ohad Talmon. 94-104 [doi]
- Paging and the Address-Translation ProblemMichael 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. 105-117 [doi]
- Massively Parallel Algorithms for Distance Approximation and SpannersAmartya Shankha Biswas, Michal Dory, Mohsen Ghaffari, Slobodan Mitrovic, Yasamin Nazari. 118-128 [doi]
- Efficient Load-Balancing through Distributed Token DroppingSebastian Brandt 0002, Barbara Keller, Joel Rybicki, Jukka Suomela, Jara Uitto. 129-139 [doi]
- Finding Subgraphs in Highly Dynamic NetworksKeren Censor Hillel, Victor I. Kolobov, Gregory Schwartzman. 140-150 [doi]
- On Sparsity Awareness in Distributed ComputationsKeren Censor Hillel, Dean Leitersdorf, Volodymyr Polosukhin. 151-161 [doi]
- Near-Optimal Time-Energy Trade-Offs for Deterministic Leader ElectionYi-Jun Chang, Ran Duan, Shunhua Jiang. 162-172 [doi]
- Hemlock: Compact and Scalable Mutual ExclusionDave Dice, Alex Kogan. 173-183 [doi]
- Efficient Stepping Algorithms and Implementations for Parallel Shortest PathsXiaojun Dong, Yan Gu 0001, Yihan Sun 0001, Yunming Zhang. 184-197 [doi]
- Deterministic PRAM Approximate Shortest Paths in Polylogarithmic Time and Slightly Super-Linear WorkMichael Elkin, Shaked Matar. 198-207 [doi]
- A Scalable Concurrent Algorithm for Dynamic ConnectivityAlexander Fedorov, Nikita Koval, Dan Alistarh. 208-220 [doi]
- Optimal Virtual Network Embeddings for Tree TopologiesAleksander Figiel, Leon Kellerhals, Rolf Niedermeier, Matthias Rost, Stefan Schmid 0001, Philipp Zschoche. 221-231 [doi]
- Efficiency and Stability in Euclidean Network DesignWilhelm Friedemann, Tobias Friedrich 0001, Hans Gawendowicz, Pascal Lenzner, Anna Melnichenko, Jannik Peters 0001, Daniel Stephan, Michael Vaichenker. 232-242 [doi]
- Parallel Algorithms for Finding Large Cliques in Sparse GraphsLukas Gianinazzi, Maciej Besta, Yannick Schaffner, Torsten Hoefler. 243-253 [doi]
- On the Complexity of Load Balancing in Dynamic NetworksSeth Gilbert, Uri Meir, Ami Paz, Gregory Schwartzman. 254-264 [doi]
- Four Shades of Deterministic Leader Election in Anonymous NetworksBarun Gorain, Avery Miller, Andrzej Pelc. 265-274 [doi]
- String Matching with Wildcards in the Massively Parallel Computation ModelMohammadTaghi Hajiaghayi, Hamed Saleh, Saeed Seddighin, Xiaorui Sun. 275-284 [doi]
- Non-Clairvoyant Scheduling with PredictionsSungjin Im, Ravi Kumar 0001, Mahshid Montazer Qaem, Manish Purohit. 285-294 [doi]
- The Processing-in-Memory ModelHongbo Kang, Phillip B. Gibbons, Guy E. Blelloch, Laxman Dhulipala, Yan Gu 0001, Charles McGuffey. 295-306 [doi]
- Supervised Average Consensus in Anonymous Dynamic NetworksDariusz R. Kowalski, Miguel A. Mosteiro. 307-317 [doi]
- Scheduling Opportunistic Links in Two-Tiered Reconfigurable DatacentersJanardhan Kulkarni, Stefan Schmid 0001, Pawel Schmidt. 318-327 [doi]
- Pebbles, Graphs, and a Pinch of Combinatorics: Towards Tight I/O Lower Bounds for Statically Analyzable ProgramsGrzegorz Kwasniewski, Tal Ben-Nun, Lukas Gianinazzi, Alexandru Calotoiu, Timo Schneider, Alexandros Nikolaos Ziogas, Maciej Besta, Torsten Hoefler. 328-339 [doi]
- Analysis of Busy-Time Scheduling on Heterogeneous MachinesMozhengfu Liu, Xueyan Tang. 340-350 [doi]
- Work-Optimal Parallel Minimum Cuts for Non-Sparse GraphsAndrés López-Martínez, Sagnik Mukhopadhyay, Danupon Nanongkai. 351-361 [doi]
- Distributed Graph Coloring Made EasyYannic Maus. 362-372 [doi]
- Data Oblivious Algorithms for MulticoresVijaya Ramachandran, Elaine Shi. 373-384 [doi]
- Durable Queues: The Second AmendmentGal Sela 0001, Erez Petrank. 385-397 [doi]
- Efficient Parallel Determinacy Race Detection for Structured FuturesYifan Xu 0007, Kunal Agrawal, I-Ting Angelina Lee. 398-409 [doi]
- Parallel Network Mapping AlgorithmsRamtin Afshar, Michael T. Goodrich, Pedro Matias, Martha C. Osegueda. 410-413 [doi]
- Block-Granularity-Aware CachingNathan Beckmann, Phillip B. Gibbons, Charles McGuffey. 414-416 [doi]
- Network Scaffolding for Efficient Stabilization of the Chord Overlay NetworkAndrew Berns. 417-419 [doi]
- Min-Max Gathering of Oblivious RobotsSubhash Bhagat, Anisur Rahaman Molla. 420-422 [doi]
- PHPRX: An Efficient Hash Table for Persistent MemoryDiego Cepeda, Wojciech M. Golab. 423-425 [doi]
- A Scalable Recoverable Skip List for Persistent MemorySakib Chowdhury, Wojciech M. Golab. 426-428 [doi]
- Toward Self-Adjusting Networks for the Matching ModelEvgeniy Feder, Ichha Rathod, Punit Shyamsukha, Robert Sama, Vitaly Aksenov, Iosif Salem, Stefan Schmid 0001. 429-431 [doi]
- Deterministic Size Discovery and Topology Recognition in Radio Networks with Short LabelsAdam Ganczorz, Tomasz Jurdzinski, Mateusz Lewko, Andrzej Pelc. 432-434 [doi]
- BALM: QoS-Aware Memory Bandwidth Partitioning for Multi-Socket Cloud NodesDavid Gureya, Vladimir Vlassov, João Barreto 0001. 435-438 [doi]
- Efficient Distributed Algorithms for Convolutional Neural NetworksRui Li 0033, Yufan Xu, Aravind Sukumaran-Rajam, Atanas Rountev, P. Sadayappan. 439-442 [doi]
- VBR: Version Based ReclamationGali Sheffi, Maurice Herlihy, Erez Petrank. 443-445 [doi]
- Semantic Conflict Detection for Transactional Data Structure LibrariesYaodong Sheng, Ahmed Hassan, Michael Spear. 446-448 [doi]
- Efficient Access History for Race DetectionYifan Xu 0007, Anchengcheng Zhou, Grace Q. Yin, Kunal Agrawal, I-Ting Angelina Lee, Tao B. Schardl. 449-451 [doi]