Expediting Hazard Pointers with Bounded Critical Sections Jeonghyeon Kim, Jaehwang Jung, Jeehoon Kang (KAIST)
Sparse Spanners with Small Distance and Congestion Stretches Costas Busch (Augusta University); Dariusz Kowalski (Augusta University, Augusta, Georgia); Peter Robinson (Augusta University)
Scheduling Out-Trees Online to Optimize Maximum Flow Kunal Agrawal (Washington University at Saint Louis); Benjamin Moseley, Heather Newman (Carnegie Mellon Univeristy); Kirk Pruhs (University of Pittsburgh)
Optimizing Dynamic Data Center Provisioning through Speed Scaling: A Primal-Dual Perspective Xiaosong Chen, Huanle Xu (University of Macau, Macau SAR, China); ChengZhong Xu (University of Macau)
Parallel Best Arm Identification in Heterogeneous Environments Nikolai Karpov, Qin Zhang (Indiana University Bloomington)
Parallel and (Nearly) Work-Efficient Dynamic Programming Xiangyun Ding, Yan Gu, Yihan Sun (University of California, Riverside)
Fast Broadcast in Highly Connected Networks Shashwat Chandra, Yi-Jun Chang (National University of Singapore); Michal Dory (University of Haifa); Mohsen Ghaffari (Massachusetts Institute of Technology); Dean Leitersdorf (National University of Singapore)
Scheduling Jobs with Work-Inefficient Parallel Solutions Alek Westover (MIT); William Kuszmaul (Harvard)
Fault-Tolerant Parallel Integer Multiplication Roy Nissim, Oded Schwartz, Yuval Spiizer (The Hebrew University of Jerusalem)
The Multi Bucket Queue Guozheng Zhang, Gilead Posluns, Mark C Jeffrey (University of Toronto)
Connected Components in Linear Work and Near-Optimal Time S Cliff Liu, Elaine Shi, Alireza Farhadi (Carnegie Mellon University)
Cost-Driven Data Replication with Predictions Tianyu Zuo, Xueyan Tang, Bu Sung Lee (Nanyang Technological University)
A Nearly Quadratic Improvement for Memory Reallocation Alek Westover (MIT); William Kuszmaul (Harvard); Nathan S Sheffield (MIT); Martin Farach-Colton (NYU)
When Is Parallelism Fearless and Zero-Cost with Rust? Javad Abdi (Cerebras); Gilead Posluns, Guozheng Zhang (University of Toronto); Boxuan Wang (Columbia University); Mark C Jeffrey (University of Toronto)
Efficient Parallel Reinforcement Learning Framework using the Reactor Model Jacky Kwok, Marten Lohstroh, Edward A Lee (University of California, Berkeley)
Distributed Load Balancing in the Face of Reappearance Dependencies Kunal Agrawal (Washington University in St Louis); William Kuszmaul (Harvard University); Zhe Wang (FoundationDB); Jinhao Zhao (Washington University in St Louis)
A simpler and parallelizable O(sqrt(log n))-approximation algorithm for Sparsest Cut Vladimir Kolmogorov (Institute of Science and Technology Austria)
Hardness and Tight Approximations of Demand Strip Packing Klaus Jansen (Kiel University); Malin Rau (University of Hamburg); Malte Tutas (Kiel University)
Efficient Multi-Processor Scheduling in Increasingly Realistic Models Pál András Papp, Georg Anegg, Aikaterini Karanasiou, Albert-Jan N Yzelman (Huawei Zürich Research Center)
Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering Laxman Dhulipala (University of Maryland, College Park); Xiaojun Dong (University of California Riverside); Kishen N Gowda (University of Maryland, College Park); Yan Gu (University of California, Riverside)
Optimal MPC Algorithm for Subunit-Monge Matrix Multiplication, with Applications on LIS Jaehyun Koo (MIT)
PolarStar: Expanding the Horizon of Diameter-3 Networks Kartik Lakhotia (Intel); Laura Monroe (Los Alamos National Lab); Kelly Isham (Colgate University); Maciej Besta, Nils Blach, Torsten Hoefler (ETH Zurich); Fabrizio Petrini (Intel)
Deterministic and Low Span Work-efficient Parallel Batch-dynamic Trees Daniel Anderson, Guy E Blelloch (Carnegie Mellon University)
ALock: Asymmetric Lock Primitive for RDMA Systems Amanda Baran, Jacob Nelson-Slivon (Lehigh University); Lewis Tseng (Clark Univeristy); Roberto Palmieri (Lehigh University)
Massively Parallel Algorithms for Approximate Shortest Paths Michal Dory (University of Haifa); Shaked Matar (Ben-Gurion University of the Negev)
The All Nearest Smaller Values Problem Revisited in Practice, Parallel and External Memory Nodari Sitchinava (University of Hawaii at Manoa); Rolf Svenning (Aarhus University)
Distributed-Memory Randomized Algorithms for Sparse Tensor CP Decomposition Vivek Bharadwaj (UC Berkeley); Osman Asif Malik (Lawrence Berkeley National Lab); Riley Murray (Lawrence Berkeley and Sandia National Labs); Aydin Buluc (Lawrence Berkeley National Laboratory); James Demmel (Computer Science Division, UC Berkeley)
PC-oriented Prediction-based Runtime Power Management for GPGPU using Knowledge Transfer Lin Chen, Xiao Li, Shixi Chen, Fan Jiang, Chengeng Li, Wei Zhang (The Hong Kong University of Science and Technology); Jiang Xu (The Hong Kong University of Science and Technology(GZ))
Parallel Dynamic Maximal Matching Mohsen Ghaffari, Anton Trygub (MIT)
Online Load and Graph Balancing for Random Order Inputs Sungjin Im (University of California Merced); Ravi Kumar (Google Research); Shi Li (Nanjing University); Aditya Petety (University of California Merced); Manish Purohit (Google Research)
Log Diameter Rounds MST Verification and Sensitivity in MPC Sam Coy, Artur Czumaj (University of Warwick); Gopinath Mishra (National University of Singapore); Anish Mukherjee (University of Warwick)
Minimum Cost Loop Nests for Contraction of a Sparse Tensor with a Tensor Network Raghavendra Kanakagiri (IIT Tirupati); Edgar Solomonik (University of Illinois at Urbana-Champaign)
Tightening I/O lower bounds through the hourglass dependency pattern Lionel Eyraud-Dubois (Inria); Guillaume Iooss (INRIA); Julien Langou (University of Colorado Denver); Fabrice Rastello (INRIA)
A Framework for Parallelizing Approximate Gaussian Elimination Yves Baumann, Rasmus Kyng (ETH Zurich)
Brief Announcement:
Scalable Distributed String Sorting Florian Kurpicz, Pascal Mehnert, Peter Sanders, Matthias Schimek (Karlsruhe Institute of Technology)
Brief Announcement: Distributed Unconstrained Local Search for Multilevel Graph Partitioning Peter Sanders, Daniel Seemaier (Karlsruhe Institute of Technology)
PASGAL: Parallel And Scalable Graph Algorithm Library Xiaojun Dong (University of California Riverside); Yan Gu, Yihan Sun (University of California, Riverside); Letong Wang (University of California Riverside)
Brief Announcement: Suffix Analysis Carter Luck, Charles McGuffey (Reed College)
Brief Announcement: (Near) Zero-overhead C++ Bindings for MPI Demian Hespe (unaffiliated); Lukas Hübner, Florian Kurpicz, Peter Sanders, Matthias Schimek, Daniel Seemaier, Tim Niklas Uhl (Karlsruhe Institute of Technology)
PadWS: Work Stealing through Partial Asynchronous Delegation Jiawei Wang (Huawei Dresden Research Center, Huawei Central Software Institute, Technische Universität Dresden); Yutao Liu (Huawei Dresden Research Center, Huawei Central Software Institute); Ming Fu (Huawei Central Software Institute); Hermann Härtig (Technische Universitat Dresden); Haibo Chen (Huawei Central Software Institute, Shanghai Jiao Tong University)
ROMe: Wait-free Objects for RDMA Jacob Nelson-Slivon, Reilly Yankovich, Ahmed Hassan, Roberto Palmieri (Lehigh University)
Scheduling Jobs for Minimum Span: Improved Bounds and Learning-Augmented Algorithms Mozhengfu Liu (Northwestern University); Xueyan Tang (Nanyang Technological University)
Root-to-Leaf Scheduling in Write-Optimized Trees Christopher Chung (Independent Researcher); William Jannen, Samuel McCauley (Williams College); Bertrand Simon (IN2P3 Computing Center, CNRS, Villeurbanne, France.)
Upper and Lower Bounds for Edit Distance in Space-Efficient MPC Debarati Das (Pennsylvania State University); Jacob Gilbert, MohammadTaghi Hajiaghayi (University of Maryland); Tomasz Kociumaka (Max Planck Institute for Informatics); Barna Saha (University of California San Diego)
LIT: Lookup Interlocked Table for Range Queries dePaul Miller, Ahmed Hassan, Roberto Palmieri (Lehigh University)
Lock-free Learned Search Data Structure Gaurav Bhardwaj (Department of Computer Science Engineering, Indian Institute of Technology Hyderabad, India); Bapi Chatterjee, Abhinav Sharma (Department of Computer Science Engineering, Indraprastha Institute of Information Technology Delhi, India); Sathya Peri (Department of Computer Science Engineering, Indian Institute of Technology Hyderabad, India); Siddharth Nayak (Department of Computer Science Engineering, Indraprastha Institute of Information Technology Delhi, India)
New Pruning Rules for Optimal Task Scheduling on Identical Parallel Machines Matthew Akram, Dominik Schreiber (Karlsruhe Institute of Technology)
Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offs (full paper only) Toni Böhnlein, Pál András Papp, Albert-Jan N Yzelman (Huawei Zurich Research Center)
Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity Chetan Gupta (IIT Roorkee); Janne H Korhonen (unaffiliated); Jan Studený, Jukka Suomela, Hossein Vahidi (Aalto University)
Tight bounds for Dynamic Bin Packing with Predictions Mozhengfu Liu (Northwestern University); Xueyan Tang (Nanyang Technological University)
DULL: A Fast Scalable Detectable Unrolled Lock-Based Linked List Ahmed (Fahmy); Wojciech (Golab)
Brief Announcement: Racos: a Leaderless Erasure Coding State Machine Replication Jonathan Zarnstorff, Lucas Lebow (Unaffiliated); Dillon Remuck, Colin Ruiz, Lewis Tseng (Clark University)