default search action
34th SPAA 2022: Philadelphia, PA, USA
- Kunal Agrawal, I-Ting Angelina Lee:
SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022. ACM 2022, ISBN 978-1-4503-9146-7
Session 1: Distributed Computing on Graphs
- Marcel Bezdrighin, Michael Elkin, Mohsen Ghaffari, Christoph Grunau
, Bernhard Haeupler, Saeed Ilchi, Václav Rozhon:
Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates. 1-10 - Taisuke Izumi, Naoki Kitamura, Takamasa Naruse, Gregory Schwartzman:
Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs. 11-22 - MohammadTaghi Hajiaghayi, Marina Knittel, Jan Olkowski, Hamed Saleh:
Adaptive Massively Parallel Algorithms for Cut Problems. 23-33 - Mohsen Ghaffari, Christoph Grunau
Massively Parallel Algorithms for b-Matching. 35-44 - Mohsen Ghaffari, Julian Portmann:
Average Awake Complexity of MIS and Matching. 45-55 - David Eppstein, Hadi Khodabandeh:
Brief Announcement: Distributed Lightweight Spanner Construction for Unit Ball Graphs in Doubling Metrics. 57-59
Keynote Talk I
- Jeremy Kepner:
Keynote Talk: Large Scale Parallel Sparse Matrix Streaming Graph/Network Analysis. 61
Session 2: Distributed Algorithms
- Calvin Newport, Nitin H. Vaidya, Alex Weaver:
Preparing for Disaster: Leveraging Precomputation to Efficiently Repair Graph Structures Upon Failures. 63-74 - Yi-Jun Chang
The Energy Complexity of Las Vegas Leader Election. 75-86 - John Augustine, Soumyottam Chatterjee
A Fully-Distributed Scalable Peer-to-Peer Protocol for Byzantine-Resilient Distributed Hash Tables. 87-98 - Thorsten Götte, Christian Scheideler:
Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion. 99-101 - Pierre Civit
Brief Announcement: Composable Dynamic Secure Emulation. 103-105
Session 3: Networks and Communications
- Yonggang Jiang, Chaodong Zheng:
Robust and Optimal Contention Resolution without Collision Detection. 107-118 - Michael A. Bender, Seth Gilbert
Contention Resolution for Coded Radio Networks. 119-130 - Ruomu Hou, Irvan Jahja, Yucheng Sun, Jiyan Wu, Haifeng Yu:
Achieving Sublinear Complexity under Constant T in T-interval Dynamic Networks. 131-141 - Jesper Larsson Träff:
Brief Announcement: Fast(er) Construction of Round-optimal n-Block Broadcast Schedules. 143-146
Session 4: Cache and Memory
- Daniel DeLayo
Automatic HBM Management: Models and Algorithms. 147-159 - Christian Coester
Competitive Algorithms for Block-Aware Caching. 161-172 - Nathan Beckmann, Phillip B. Gibbons, Charles McGuffey:
Brief Announcement: Spatial Locality and Granularity Change in Caching. 173-175
Session 5: Best Paper Session
- Nairen Cao, Jeremy T. Fineman, Katina Russell:
Parallel Shortest Paths with Negative Edge Weights. 177-190 - Quanquan C. Liu, Jessica Shi, Shangdi Yu
Parallel Batch-Dynamic Algorithms for k-Core Decomposition and Related Graph Problems. 191-204 - Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, Michele Scquizzato:
Online Parallel Paging with Optimal Makespan. 205-216 - Gaetano C. Coccimiglio, Trevor Alexander Brown, Srivatsan Ravi
PREP-UC: A Practical Replicated Persistent Universal Construction. 217-229
Keynote Talk II
- Neil C. Thompson:
Keynote Talk: Algorithm Improvement: How Fast Has It Been and How Much Farther Can It Go? 231
Session 6: Parallel Algorithms and Data Structures
- Tom Tseng
Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering. 233-245 - Jovan Blanusa
Scalable Fine-Grained Parallel Cycle Enumeration Algorithms. 247-258 - Yan Gu, Zachary Napier, Yihan Sun, Letong Wang:
Parallel Cover Trees and their Applications. 259-272 - Zheqi Shen, Zijin Wan, Yan Gu, Yihan Sun
Many Sequential Iterative Algorithms Can Be Parallel and (Nearly) Work-efficient. 273-286 - Tayebeh Bahreini, Nathan Fisher, Daniel Grosu:
Brief Announcement: A Parallel (Δ, Γ)-Stepping Algorithm for the Constrained Shortest Path Problem. 287-289 - Zafar Ahmad, Rezaul Chowdhury, Rathish Das, Pramod Ganapathi, Aaron Gregory, Yimin Zhu
Brief Announcement: Faster Stencil Computations using Gaussian Approximations. 291-293
Session 7: Concurrency and Synchronization
- Ahmed Fahmy, Wojciech M. Golab:
A NUMA-Aware Recoverable Mutex Lock. 295-305 - Ruslan Nikolaev
wCQ: A Fast Wait-Free Queue with Bounded Memory Usage. 307-319 - Jiwon Choe, Andrew Crotty, Tali Moreshet, Maurice Herlihy, R. Iris Bahar
HybriDS: Cache-Conscious Concurrent Data Structures for Near-Memory Processing Architectures. 321-332 - Adones Rukundo, Aras Atalar, Philippas Tsigas:
Performance Analysis and Modelling of Concurrent Multi-access Data Structures. 333-344
Session 8: Scheduling
- Jannik Castenow, Björn Feldkord, Till Knollmann, Manuel Malatyali, Friedhelm Meyer auf der Heide:
The k-Server with Preferences Problem. 345-356 - Alexander Lindermayr
Permutation Predictions for Non-Clairvoyant Scheduling. 357-368 - Sami Davies, Samir Khuller, Shirley Zhang:
Balancing Flow Time and Energy Consumption. 369-380 - Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, Seeun William Umboh
Brief Announcement: Nested Active-Time Scheduling. 381-383 - Tianming Zhao
Brief Announcement: Towards a More Robust Algorithm for Flow Time Scheduling with Predictions. 385-388
Session 9: More Scheduling
- Dimitrios Los
Balanced Allocations in Batches: Simplified and Generalized. 389-399 - Harald Räcke, Stefan Schmid
Approximate Dynamic Balanced Graph Partitioning. 401-409 - John Kuszmaul:
Bamboo Trimming Revisited: Simple Algorithms Can Do Well Too. 411-417 - Dimitrios Los
Brief Announcement: Tight Bounds for Repeated Balls-into-Bins. 419-421
Session 10: Matrix-Based Algorithms and I/O Bounds
- Olivier Beaumont, Lionel Eyraud-Dubois, Julien Langou
I/O-Optimal Algorithms for Symmetric Linear Algebra Kernels. 423-433 - Chetan Gupta
Sparse Matrix Multiplication in the Low-Bandwidth Model. 435-444 - Hussam Al Daas, Grey Ballard, Laura Grigori, Suraj Kumar, Kathryn Rouse
Brief Announcement: Tight Memory-Independent Parallel Matrix Multiplication Communication Lower Bounds. 445-448 - Lorenzo De Stefani:
Brief Announcement: On the I/O Complexity of Sequential and Parallel Hybrid Integer Multiplication Algorithms. 449-452
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-17 20:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: