Table of Contents

• Simple Local Computation Algorithms for the General Lovász Local LemmaDimitris Achlioptas, Themis Gouleakis, Fotis Iliopoulos. 1-10 [doi]
• Faster Deterministic All Pairs Shortest Paths in Congest ModelUdit Agarwal, Vijaya Ramachandran. 11-21 [doi]
• Contention Resolution with Message DeadlinesKunal Agrawal, Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Maxwell Young. 23-35 [doi]
• Memory Tagging: Minimalist Synchronization for Scalable Concurrent Data StructuresDan Alistarh, Trevor Brown 0001, Nandini Singhal. 37-49 [doi]
• Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window ModelDaniel Anderson, Guy E. Blelloch, Kanat Tangwongsan. 51-61 [doi]
• Closing the Gap Between Cache-oblivious and Cache-adaptive AnalysisMichael A. Bender, Rezaul Alam Chowdhury, Rathish Das, Rob Johnson, William Kuszmaul, Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, Helen Xu. 63-73 [doi]
• Optimal Resource Allocation for Elastic and Inelastic JobsBenjamin Berg, Mor Harchol-Balter, Benjamin Moseley, Weina Wang, Justin Whitehouse. 75-87 [doi]
• Optimal Parallel Algorithms in the Binary-Forking ModelGuy E. Blelloch, Jeremy T. Fineman, Yan Gu 0001, Yihan Sun 0001. 89-102 [doi]
• Randomized Incremental Convex Hull is Highly ParallelGuy E. Blelloch, Yan Gu, Julian Shun, Yihan Sun. 103-115 [doi]
• Almost Universal Anonymous Rendezvous in the PlaneSébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit. 117-127 [doi]
• The Online Multi-Commodity Facility Location ProblemJannik Castenow, Björn Feldkord, Till Knollmann, Manuel Malatyali, Friedhelm Meyer auf der Heide. 129-139 [doi]
• Unconditional Lower Bounds for Adaptive Massively Parallel ComputationMoses Charikar, Weiyun Ma, Li-Yang Tan. 141-151 [doi]
• On the Hardness of Massively Parallel ComputationKai-Min Chung, Kuan-Yi Ho, Xiaorui Sun. 153-162 [doi]
• Parallel Load Balancing on Constrained Client-Server TopologiesAndrea E. F. Clementi, Emanuele Natale, Isabella Ziccardi. 163-173 [doi]
• Graph Sparsification for Derandomizing Massively Parallel Computation with Low SpaceArtur Czumaj, Peter Davies, Merav Parter. 175-185 [doi]
• How to Manage High-Bandwidth Memory AutomaticallyRathish Das, Kunal Agrawal, Michael A. Bender, Jonathan W. Berry, Benjamin Moseley, Cynthia A. Phillips. 187-199 [doi]
• Self-Stabilizing Task Allocation In Spite of NoiseAnna R. Dornhaus, Nancy A. Lynch, Frederik Mallmann-Trenn, Dominik Pajak, Tsvetomira Radeva. 201-211 [doi]
• Constant-Length Labelling Schemes for Faster Deterministic Radio BroadcastFaith Ellen, Seth Gilbert. 213-222 [doi]
• Time- and Space-Optimal Discrete Clock Synchronization in the Beeping ModelMichael Feldmann 0001, Ardalan Khazraei, Christian Scheideler. 223-233 [doi]
• Predicate Detection to Solve Combinatorial Optimization ProblemsVijay K. Garg. 235-245 [doi]
• Efficient Local Medium AccessPawel Garncarek, Tomasz Jurdzinski, Dariusz R. Kowalski. 247-257 [doi]
• A Massively Parallel Algorithm for Minimum Weight Vertex CoverMohsen Ghaffari, Ce Jin, Daan Nilis. 259-268 [doi]
• Parallel Planar Subgraph Isomorphism and Vertex ConnectivityLukas Gianinazzi, Torsten Hoefler. 269-280 [doi]
• The Recoverable Consensus HierarchyWojciech Golab. 281-291 [doi]
• Bandwidth Optimized Parallel Algorithms for Sparse Matrix-Matrix Multiplication using Propagation BlockingZhixiang Gu, Jose Moreira, David Edelsohn, Ariful Azad. 293-303 [doi]
• Scheduling Flows on a Switch to Optimize Response TimesHamidreza Jahanjou, Rajmohan Rajaraman, David Stalfa. 305-315 [doi]
• Sublinear Algorithms in T-interval Dynamic NetworksIrvan Jahja, Haifeng Yu. 317-327 [doi]
• Spectral Lower Bounds on the I/O Complexity of Computation GraphsSaachi Jain, Matei Zaharia. 329-338 [doi]
• Commitment and Slack for Online Load MaximizationSamin Jamalabadi, Chris Schwiegelshohn, Uwe Schwiegelshohn. 339-348 [doi]
• Approximation Algorithms for Scheduling with Class ConstraintsKlaus Jansen, Alexandra Lassota, Marten Maack. 349-357 [doi]
• Connected Components on a PRAM in Log Diameter TimeSixue Cliff Liu, Robert E. Tarjan, Peilin Zhong. 359-369 [doi]
• Fast Byzantine Agreement for Permissioned Distributed LedgersThomas Locher. 371-382 [doi]
• The Append Memory Model: Why BlockDAGs Excel BlockchainsDarya Melnyk, Roger Wattenhofer. 383-393 [doi]
• A Unified Sparsification Approach for Matching Problems in Graphs of Bounded Neighborhood IndependenceLazar Milenkovic, Shay Solomon. 395-406 [doi]
• Deterministic Leader Election in Anonymous Radio NetworksAvery Miller, Andrzej Pelc, Ram Narayan Yadav. 407-417 [doi]
• On the Hardness of Red-Blue Pebble GamesPál András Papp, Roger Wattenhofer. 419-429 [doi]
• Non-Linear Ski RentalBoaz Patt-Shamir, Evyatar Yadai. 431-440 [doi]
• pTrans: A Scalable Algorithm for Reservation Guarantees in Distributed SystemsYuhan Peng, Peter Varman. 441-452 [doi]
• Functional FaultsGali Sheffi, Erez Petrank. 453-463 [doi]
• Priority Scheduling for Interactive ApplicationsKyle Singer, Noah Goldstein, Stefan K. Muller, Kunal Agrawal, I-Ting Angelina Lee, Umut A. Acar. 465-477 [doi]
• Communication vs Synchronisation in Parallel String ComparisonAlexander Tiskin. 479-489 [doi]
• Reconstructing Binary Trees in ParallelRamtin Afshar, Michael T. Goodrich, Pedro Matias, Martha C. Osegueda. 491-492 [doi]
• Green Paging and Parallel PagingKunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, Michele Scquizzato. 493-495 [doi]
• Provable Neuromorphic Advantages for Computing Shortest PathsJames B. Aimone, Yang Ho, Ojas Parekh, Cynthia A. Phillips, Ali Pinar, William Severa, Yipu Wang. 497-499 [doi]
• A LOCAL Constant Approximation Factor Algorithm for Minimum Dominating Set of Certain Planar GraphsSharareh Alipour, Amir Jafari. 501-502 [doi]
• Tracking in Order to Recover - Detectable Recovery of Lock-Free Data StructuresHagit Attiya, Ohad Ben-Baruch, Panagiota Fatourou, Danny Hendler, Eleftherios Kosmas. 503-505 [doi]
• ParlayLib - A Toolkit for Parallel Algorithms on Shared-Memory Multicore MachinesGuy E. Blelloch, Daniel Anderson, Laxman Dhulipala. 507-509 [doi]
• Improved Work Span Tradeoff for Single Source Reachability and Approximate Shortest PathsNairen Cao, Jeremy T. Fineman, Katina Russell. 511-513 [doi]
• A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed upJannik Castenow, Peter Kling, Till Knollmann, Friedhelm Meyer auf der Heide. 515-517 [doi]
• A Computational Model for Tensor Core UnitsRezaul Chowdhury, Francesco Silvestri 0001, Flavio Vella. 519-521 [doi]
• Communication-Optimal Tilings for Projective Nested Loops with Arbitrary BoundsGrace Dinh, James Demmel. 523-525 [doi]
• Efficient Distributed Algorithms for the K-Nearest Neighbors ProblemReza Fathi, Anisur Rahaman Molla, Gopal Pandurangan. 527-529 [doi]
• How Fast Can You Update Your MST?Seth Gilbert, Lawrence Er Lu Li. 531-533 [doi]
• A Queueing Network-Based Distributed Laplacian SolverIqra Altaf Gillani, Amitabha Bagchi. 535-537 [doi]
• A Closer Look at Quantum Distributed ConsensusWojciech Golab, Hao Tan. 539-541 [doi]
• Communication-Efficient Weighted Reservoir Sampling from Fully Distributed Data StreamsLorenz Hübschle-Schneider, Peter Sanders 0001. 543-545 [doi]
• Multicore Paging Algorithms Cannot Be CompetitiveShahin Kamali, Helen Xu. 547-549 [doi]
• Cache-Efficient Parallel-Partition Algorithms using Exclusive-Read-and-Write MemoryWilliam Kuszmaul, Alek Westover. 551-553 [doi]
• Towards Lockfree Persistent HomologyDmitriy Morozov, Arnur Nigmetov. 555-557 [doi]
• Sparse Tensor TranspositionsSuzanne Mueller, Peter Ahrens, Stephen Chou, Fredrik Kjolstad, Saman P. Amarasinghe. 559-561 [doi]
• Network Partitioning and Avoidable ContentionYishai Oltchik, Oded Schwartz. 563-565 [doi]
• On the Limits of Parallelizing Convolutional Neural Networks on GPUsBehnam Pourghassemi, Chenghao Zhang, Joo Hwan Lee, Aparna Chandramowlishwaran. 567-569 [doi]
• Efficient Concurrent Range Queries in B+-trees using RCU-HTMDimitrios Siakavaras, Panagiotis Billis, Konstantinos Nikas, Georgios I. Goumas, Nectarios Koziris. 571-573 [doi]
• Balanced Partitioning of Several Cache-Oblivious AlgorithmsYuan Tang. 575-577 [doi]
• Feasibility of Cross-Chain Payment with Success GuaranteesRob van Glabbeek, Vincent Gramoli, Pierre Tholoniat. 579-581 [doi]
• Benchmarking Recoverable Mutex LocksJeffrey Xiao, Zheng Zhang, Wojciech Golab. 583-585 [doi]
• Giving Future(s) to Transactional MemoryJingna Zeng, Seif Haridi, Shady Issa, Paolo Romano 0002, Luís E. T. Rodrigues. 587-589 [doi]
• Communication Lower Bounds of Convolutions in CNNsXiaoyang Zhang, Junmin Xiao, Guangming Tan. 591-593 [doi]