Accepted Papers

Parallel Longest Increasing Subsequence and van Emde Boas Trees
Yan Gu, Ziyang Men, Zheqi Shen, Yihan Sun, Zijin Wan

A Skew-Resistant Trie for Processing-in-Memory
Hongbo Kang, Yiwei Zhao, Guy E. Blelloch, Laxman Dhulipala, Yan Gu, Charles McGuffey, Phillip B. Gibbons

High-Performance and Flexible Parallel Algorithms for Semisort and Related Problems
Xiaojun Dong, Yunshu Wu, Zhongqi Wang, Laxman Dhulipala, Yan Gu, Yihan Sun

Parallel Memory-Independent Communication Bounds for SYRK
Hussam Al Daas, Grey Ballard, Laura Grigori, Suraj Kumar, Kathryn Rouse

In-network Allreduce with Multiple Spanning Trees on PolarFly
Kartik Lakhotia, Kelly Isham, Laura Monroe, Maciej Besta, Torsten Hoefler, Fabrizio Petrini

Quancurrent: A Concurrent Quantiles Sketch
Shaked Elias-Zada, Arik Rinberg, Idit Keidar

On Parallel k-Center Clustering
Sam Coy, Artur Czumaj, Gopinath Mishra

Optimal Round and Sample-Size Complexity for Partitioning in Parallel Sorting
Wentao Yang, Vipul Harsh, Edgar Solomonik

Almost Optimal Massively Parallel Algorithms for $k$-Center Clustering and Diversity Maximization
Alireza Haqi, Hamid Zarrabi-Zadeh

Nearly optimal parallel algorithms for longest increasing subsequence
Nairen Cao, Shang-En Huang, Hsin-Hao Su

Transactional Composition of Nonblocking Data Structures
Wentao Cai, Haosen Wen, Michael L. Scott

A Tight Characterization of Fast Failover Routing: Resiliency to Two Link Failures is Possible
Wenkai Dai, Klaus-Tycho Foerster, Stefan Schmid

Deterministic Massively Parallel Symmetry Breaking for Sparse Graphs
Jeff Giliberti, Manuela Fischer, Christoph Grunau

Provably-Efficient and Internally-Deterministic Parallel Union-Find
Dan Alistarh, Alexander Fedorov, Diba Hashemi, Giorgi Nadiradze

Multiplying 2 x 2 Sub-Blocks Using 4 Multiplications
Yoav Moran, Oded Schwartz

An Associativity Threshold Phenomenon in Set-Associative Caches
Michael A. Bender, Rathish Das, Martin Farach-Colton, Guido Tagliavini

Increment-and-Freeze: Every Cache, Everywhere, All of the Time
Michael Bender, Daniel DeLayo, Bradley Kuszmaul, William Kuszmaul, Evan West

Distributed Multi-writer Multi-reader Atomic Register with Optimistically Fast Read and Write
Lewis Tseng, Neo Zhou, Cole Dumas, Tigran Bantikyan, Roberto Palmieri

Partitioning Hypergraphs is Hard: Models, Inapproximability, and Applications
Pal Andras Papp, Georg Anegg, A. N. Yzelman

Balanced Allocation in Batches: The Tower of Two Choices
Dimitrios Los, Thomas Sauerwald

Releasing Memory with Optimistic Access: A Hybrid Approach to Memory Reclamation and Allocation in Lock-Free Programs
Pedro Moreno, Ricardo Rocha

Location-Sensitive String Problems in MPC
Jacob Gilbert, Mohammad TaghiHajiaghayi, Hamed Saleh, Saeed Seddighin

Protecting Locks Against Unbalanced Unlock()
Vivek Shahare, Milind Chabbi, Nikhil Hegde

An Efficient Scheduler for Interactive Task-Parallel Applications
Kyle Singer, Kunal Agrawal, I-Ting Angelina Lee

Optimal Parallel Sorting with Comparison Errors
Michael Goodrich, Riko Jacob

Nearly Work-Efficient Parallel DFS in Undirected Graphs
Mohsen Ghaffari, Christoph Grunau, Jiahao Qu

Coloring Fast with Broadcasts
Maxime Flin, Mohsen Ghaffari, Magnus M. Halldorsson, Fabian Kuhn, Alexandre Nolin

Massively Parallel Tree Embeddings for High Dimensional Spaces
AmirMohsen Ahanchi, Alexandr Andoni, MohammadTaghi Hajiaghayi, Marina Knittel, Peilin Zhong

Polylog-Competitive Algorithms for Dynamic Balanced Graph Partitioning for Ring Demands
Harald Racke, Stefan Schmid, Ruslan Zabrodin

Fast dynamic programming in trees in the MPC model
Chetan Gupta, Rustam Latypov, Yannic Maus, Shreyas Pai, Simo Sarkka, Jan Studeny, Jukka Suomela, Jara Uitto, Hossein Vahidi

Efficient Synchronization-Light Work Stealing
Rafael Custodio, Herve Paulino, Guilherme Rito

A Time and Space Efficient Lock with Dynamic Joining under System-wide Failures
Prasad Jayanti, Siddhartha Jayanti, Anup Joshi

A Simple and Efficient Parallel Laplacian Solver
Yibin Zhao, Sushant Sachdeva

Applying Hazard Pointers to More Concurrent Data Structures
Jaehwang Jung, Janggun Lee, Jeonghyeon Kim, Jeehoon Kang

Adaptive Massively Parallel Connectivity in Optimal Space
Jakub Lacki, Rustam Latypov, Yannic Maus, Jara Uitto

Quadratic Speedups in Parallel Sampling from Determinantal Distributions
Nima Anari, Callum Burgess, Kevin Tian, Thuy-Duong Vuong

Multidimensional Approximate Agreement with Asynchronous Fallback
Diana Ghinea, Chen-Da Liu-Zhang, Roger Wattenhofer

Brief Announcement: Regular and Dyck Languages in MPC
Jacob Gilbert, MohammadTaghi Hajiaghayi

Brief Announcement: On Solving Recoverable Mutual Exclusion Under System-Wide Failures
Sahil Dhoked, Wojciech Golab, Neeraj Mittal
Brief Announcement: A Parallel Architecture for Dynamic Approximate Membership
Guy Even, Gabriel Marques Domingues, Parham Toutian

Brief Announcement: DeepZoning: Accelerate CNN Inference with Zoning Graph at Dynamic Granularity
Ruilong Ma, Xiang Yang, Qi Qi, Jingyu Wang, Jing Wang, Xin Wang

Brief Announcement: Optimized GPU-accelerated Feature Extraction for ORB-SLAM Systems
Filippo Muzzini, Nicola Capodieci, Roberto Cavicchioli, Benjamin Rouxel

Brief Announcement: is the problem-based benchmark suite fearless with Rust?
Javad Abdi, Guowei Zhang, Mark C. Jeffrey

Brief Announcement: Dynamic Vector Bin Packing for Online Resource Allocation in the Cloud
Aniket Murhekar, David Arbour, Tung Mai, Anup B. Rao

Brief Announcement: Streaming Balanced Clustering
Hossein Esfandiari, Vahab Mirrokni, Peilin Zhong

Brief Announcement: Communication Optimal Sparse LU factorization for Planar Matrices
Piyush Sao, Xiaoye S. Li

Brief Announcement: List Defective Colorings: Distributed Algorithms and Applications
Marc Fuchs, Fabian Kuhn