Table of Contents

• Expediting Hazard Pointers with Bounded RCU Critical SectionsJeonghyeon Kim, Jaehwang Jung, Jeehoon Kang. 1-13 [doi]
• ALock: Asymmetric Lock Primitive for RDMA SystemsAmanda Baran, Jacob Nelson-Slivon, Lewis Tseng, Roberto Palmieri. 15-26 [doi]
• When Is Parallelism Fearless and Zero-Cost with Rust?Javad Abdi 0002, Gilead Posluns, Guozheng Zhang, Boxuan Wang, Mark C. Jeffrey. 27-40 [doi]
• Efficient Parallel Reinforcement Learning Framework Using the Reactor ModelJacky Kwok, Marten Lohstroh, Edward A. Lee. 41-51 [doi]
• Parallel Best Arm Identification in Heterogeneous EnvironmentsNikolai Karpov, Qin Zhang. 53-64 [doi]
• Brief Announcement: Lock-free Learned Search Data StructureGaurav Bhardwaj, Bapi Chatterjee, Abhinav Sharma, Sathya Peri, Siddharth Nayak. 65-67 [doi]
• Brief Announcement: LIT: Lookup Interlocked Table for Range QueriesdePaul Miller, Ahmed Hassan, Roberto Palmieri. 69-71 [doi]
• Brief Announcement: A Fast Scalable Detectable Unrolled Lock-Based Linked ListAhmed Fahmy, Wojciech Golab. 73-75 [doi]
• Scheduling Out-Trees Online to Optimize Maximum FlowKunal Agrawal, Benjamin Moseley, Heather Newman, Kirk Pruhs. 77-88 [doi]
• Optimizing Dynamic Data Center Provisioning through Speed Scaling: A Primal-Dual PerspectiveXiaosong Chen, Huanle Xu, Chengzhong Xu 0001. 89-100 [doi]
• Scheduling Jobs with Work-Inefficient Parallel SolutionsWilliam Kuszmaul, Alek Westover. 101-111 [doi]
• Multi Bucket Queues: Efficient Concurrent Priority SchedulingGuozheng Zhang, Gilead Posluns, Mark C. Jeffrey. 113-124 [doi]
• A Nearly Quadratic Improvement for Memory ReallocationMartin Farach-Colton, William Kuszmaul, Nathan S. Sheffield, Alek Westover. 125-135 [doi]
• Brief Announcement: New Pruning Rules for Optimal Task Scheduling on Identical Parallel MachinesMatthew Akram, Dominik Schreiber. 137-139 [doi]
• Brief Announcement: Scheduling Jobs for Minimum Span: Improved Bounds and Learning-Augmented AlgorithmsMozhengfu Liu, Xueyan Tang. 141-143 [doi]
• An Optimal MPC Algorithm for Subunit-Monge Matrix Multiplication, with Applications to LISJaehyun Koo. 145-154 [doi]
• Distributed-Memory Randomized Algorithms for Sparse Tensor CP DecompositionVivek Bharadwaj, Osman Asif Malik, Riley Murray, Aydin Buluç, James Demmel. 155-168 [doi]
• Minimum Cost Loop Nests for Contraction of a Sparse Tensor with a Tensor NetworkRaghavendra Kanakagiri, Edgar Solomonik. 169-181 [doi]
• Tightening I/O Lower Bounds through the Hourglass Dependency PatternLionel Eyraud-Dubois, Guillaume Iooss, Julien Langou, Fabrice Rastello. 183-193 [doi]
• A Framework for Parallelizing Approximate Gaussian EliminationYves Baumann, Rasmus Kyng. 195-206 [doi]
• Fault-Tolerant Parallel Integer MultiplicationRoy Nissim, Oded Schwartz, Yuval Spiizer. 207-218 [doi]
• Parallel and (Nearly) Work-Efficient Dynamic ProgrammingXiangyun Ding, Yan Gu 0001, Yihan Sun 0001. 219-232 [doi]
• Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage ClusteringLaxman Dhulipala, Xiaojun Dong 0001, Kishen N. Gowda, Yan Gu 0001. 233-245 [doi]
• Deterministic and Low-Span Work-Efficient Parallel Batch-Dynamic TreesDaniel Anderson, Guy E. Blelloch. 247-258 [doi]
• The All Nearest Smaller Values Problem Revisited in Practice, Parallel and External MemoryNodari Sitchinava, Rolf Svenning. 259-268 [doi]
• Log Diameter Rounds MST Verification and Sensitivity in MPCSam Coy, Artur Czumaj, Gopinath Mishra, Anish Mukherjee 0001. 269-280 [doi]
• Brief Announcement: Work Stealing through Partial Asynchronous DelegationJiawei Wang, Yutao Liu, Ming Fu, Hermann Härtig, Haibo Chen 0001. 281-283 [doi]
• Brief Announcement: Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offsToni Böhnlein, Pál András Papp, Albert-Jan Nicholas Yzelman. 285-287 [doi]
• Brief Announcement: (Near) Zero-Overhead C++ Bindings for MPIDemian Hespe, Lukas Hübner, Florian Kurpicz, Peter Sanders 0001, Matthias Schimek, Daniel Seemaier, Tim Niklas Uhl. 289-291 [doi]
• Brief Announcement: Upper and Lower Bounds for Edit Distance in Space-Efficient MPCDebarati Das 0001, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha. 293-295 [doi]
• Brief Announcement: Tight bounds for Dynamic Bin Packing with PredictionsMozhengfu Liu, Xueyan Tang. 297-299 [doi]
• Brief Announcement: Suffix AnalysisCarter Luck, Charles McGuffey. 301-303 [doi]
• Brief Announcement: Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of SparsityChetan Gupta 0002, Janne H. Korhonen, Jan Studený, Jukka Suomela, Hossein Vahidi 0001. 305-307 [doi]
• Cost-Driven Data Replication with PredictionsTianyu Zuo, Xueyan Tang, Bu-Sung Lee. 309-320 [doi]
• Distributed Load Balancing in the Face of Reappearance DependenciesKunal Agrawal, William Kuszmaul, Zhe Wang, Jinhao Zhao. 321-330 [doi]
• Fast Broadcast in Highly Connected NetworksShashwat Chandra, Yi-Jun Chang, Michal Dory, Mohsen Ghaffari 0001, Dean Leitersdorf. 331-343 [doi]
• PolarStar: Expanding the Horizon of Diameter-3 NetworksKartik Lakhotia, Laura Monroe, Kelly Isham, Maciej Besta, Nils Blach, Torsten Hoefler, Fabrizio Petrini. 345-357 [doi]
• PC-oriented Prediction-based Runtime Power Management for GPGPU using Knowledge TransferLin Chen, Xiao Li, Shixi Chen, Fan Jiang, Chengeng Li, Wei Zhang, Jiang Xu 0001. 359-370 [doi]
• Brief Announcement: ROMe: Wait-free Objects for RDMAJacob Nelson-Slivon, Reilly Yankovich, Ahmed Hassan, Roberto Palmieri. 371-373 [doi]
• Brief Announcement: Scalable Distributed String SortingFlorian Kurpicz, Pascal Mehnert, Peter Sanders 0001, Matthias Schimek. 375-377 [doi]
• Brief Announcement: Racos: A Leaderless Erasure Coding State Machine ReplicationJonathan Zarnstorff, Lucas Lebow, Dillon Remuck, Colin Ruiz, Lewis Tseng. 379-381 [doi]
• Sparse Spanners with Small Distance and Congestion StretchesCostas Busch, Dariusz R. Kowalski, Peter Robinson 0002. 383-393 [doi]
• Connected Components in Linear Work and Near-Optimal TimeAlireza Farhadi 0001, Sixue Cliff Liu, Elaine Shi. 395-402 [doi]
• A Simpler and Parallelizable O(√log n)-approximation Algorithm for Sparsest CutVladimir Kolmogorov. 403-414 [doi]
• Massively Parallel Algorithms for Approximate Shortest PathsMichal Dory, Shaked Matar. 415-426 [doi]
• Parallel Dynamic Maximal MatchingMohsen Ghaffari 0001, Anton Trygub. 427-437 [doi]
• Brief Announcement: PASGAL: Parallel And Scalable Graph Algorithm LibraryXiaojun Dong 0001, Yan Gu 0001, Yihan Sun 0001, Letong Wang. 439-441 [doi]
• Brief Announcement: Distributed Unconstrained Local Search for Multilevel Graph PartitioningPeter Sanders 0001, Daniel Seemaier. 443-445 [doi]
• Brief Announcement: Minimizing the Weighted Average Shortest Path Length in Demand-Aware Networks via Matching AugmentationAleksander Figiel, Darya Melnyk, André Nichterlein, Arash Pourdamghani, Stefan Schmid 0001. 447-449 [doi]
• Stable Blockchain Sharding under Adversarial Transaction GenerationRamesh Adhikari, Costas Busch, Dariusz R. Kowalski. 451-461 [doi]
• Efficient Multi-Processor Scheduling in Increasingly Realistic ModelsPál András Papp, Georg Anegg, Aikaterini Karanasiou, Albert-Jan Nicholas Yzelman. 463-474 [doi]
• Brief Announcement: Root-to-Leaf Scheduling in Write-Optimized TreesChristopher Chung, William Jannen, Samuel McCauley, Bertrand Simon 0001. 475-477 [doi]
• Hardness and Tight Approximations of Demand Strip PackingKlaus Jansen, Malin Rau, Malte Tutas. 479-489 [doi]
• Online Load and Graph Balancing for Random Order InputsSungjin Im, Ravi Kumar 0001, Shi Li 0001, Aditya Petety, Manish Purohit. 491-497 [doi]