| 2024 | A Simpler and Parallelizable O(√log n)-approximation Algorithm for Sparsest Cut. | Vladimir Kolmogorov |
| 2024 | Expediting Hazard Pointers with Bounded RCU Critical Sections. | Jeonghyeon Kim, Jaehwang Jung, Jeehoon Kang |
| 2024 | Parallel Best Arm Identification in Heterogeneous Environments. | Nikolai Karpov, Qin Zhang |
| 2024 | Minimum Cost Loop Nests for Contraction of a Sparse Tensor with a Tensor Network. | Raghavendra Kanakagiri, Edgar Solomonik |
| 2024 | Hardness and Tight Approximations of Demand Strip Packing. | Klaus Jansen, Malin Rau, Malte Tutas |
| 2024 | Online Load and Graph Balancing for Random Order Inputs. | Sungjin Im, Ravi Kumar, Shi Li, Aditya Petety, Manish Purohit |
| 2024 | Brief Announcement: (Near) Zero-Overhead C++ Bindings for MPI. | Demian Hespe, Lukas Hbner, Florian Kurpicz, Peter Sanders, Matthias Schimek, Daniel Seemaier, Tim Niklas Uhl |
| 2024 | Brief Announcement: Minimizing the Weighted Average Shortest Path Length in Demand-Aware Networks via Matching Augmentation. | Aleksander Figiel, Darya Melnyk, Andr Nichterlein, Arash Pourdamghani, Stefan Schmid |
| 2024 | A Nearly Quadratic Improvement for Memory Reallocation. | Martin Farach-Colton, William Kuszmaul, Nathan S. Sheffield, Alek Westover |
| 2024 | Brief Announcement: A Fast Scalable Detectable Unrolled Lock-Based Linked List. | Ahmed Fahmy, Wojciech Golab |
| 2024 | Tightening I/O Lower Bounds through the Hourglass Dependency Pattern. | Lionel Eyraud-Dubois, Guillaume Iooss, Julien Langou, Fabrice Rastello |
| 2024 | Massively Parallel Algorithms for Approximate Shortest Paths. | Michal Dory, Shaked Matar |
| 2024 | Parallel and (Nearly) Work-Efficient Dynamic Programming. | Xiangyun Ding, Yan Gu, Yihan Sun |
| 2024 | Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering. | Laxman Dhulipala, Xiaojun Dong, Kishen N. Gowda, Yan Gu |
| 2024 | Log Diameter Rounds MST Verification and Sensitivity in MPC. | Sam Coy, Artur Czumaj, Gopinath Mishra, Anish Mukherjee |
| 2024 | Brief Announcement: Root-to-Leaf Scheduling in Write-Optimized Trees. | Christopher Chung, William Jannen, Samuel McCauley, Bertrand Simon |
| 2024 | Optimizing Dynamic Data Center Provisioning through Speed Scaling: A Primal-Dual Perspective. | Xiaosong Chen, Huanle Xu, ChengZhong Xu |
| 2024 | PC-oriented Prediction-based Runtime Power Management for GPGPU using Knowledge Transfer. | Lin Chen, Xiao Li, Shixi Chen, Fan Jiang, Chengeng Li, Wei Zhang, Jiang Xu |
| 2024 | Fast Broadcast in Highly Connected Networks. | Shashwat Chandra, Yi-Jun Chang, Michal Dory, Mohsen Ghaffari, Dean Leitersdorf |
| 2024 | Sparse Spanners with Small Distance and Congestion Stretches. | Costas Busch, Dariusz R. Kowalski, Peter Robinson |
| 2024 | Brief Announcement: Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offs. | Toni Bhnlein, Pl Andrs Papp, Albert-Jan Nicholas Yzelman |
| 2024 | Brief Announcement: Lock-free Learned Search Data Structure. | Gaurav Bhardwaj, Bapi Chatterjee, Abhinav Sharma, Sathya Peri, Siddharth Nayak |
| 2024 | Distributed-Memory Randomized Algorithms for Sparse Tensor CP Decomposition. | Vivek Bharadwaj, Osman Asif Malik, Riley Murray, Aydin Bulu, James Demmel |
| 2024 | A Framework for Parallelizing Approximate Gaussian Elimination. | Yves Baumann, Rasmus Kyng |
| 2024 | ALock: Asymmetric Lock Primitive for RDMA Systems. | Amanda Baran, Jacob Nelson-Slivon, Lewis Tseng, Roberto Palmieri |