default search action
33rd SPAA 2021: Virtual Event, USA
- Kunal Agrawal, Yossi Azar:
SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, 6-8 July, 2021. ACM 2021, ISBN 978-1-4503-8070-6
Panel
- Guy E. Blelloch, William J. Dally, Margaret Martonosi, Uzi Vishkin, Katherine A. Yelick
:
SPAA'21 Panel Paper: Architecture-Friendly Algorithms versus Algorithm-Friendly Architectures. 1-7
Paper Presentations
- Zafar Ahmad
Fast Stencil Computations using Fast Fourier Transforms. 8-21 - Zafar Ahmad
Low-Span Parallel Algorithms for the Binary-Forking Model. 22-34 - James B. Aimone
Provable Advantages for Graph Algorithms in Spiking Neural Networks. 35-47 - Susanne Albers, Jens Quedenfeld:
Algorithms for Right-Sizing Heterogeneous Data Centers. 48-58 - Daniel Anderson, Guy E. Blelloch, Anubhav Baweja, Umut A. Acar:
Efficient Parallel Self-Adjusting Computation. 59-70 - Daniel Anderson, Guy E. Blelloch:
Parallel Minimum Cuts in O(m log2n) Work and Low Depth. 71-82 - Evripidis Bampis, Konstantinos Dogeas, Alexander V. Kononov, Giorgio Lucarelli, Fanny Pascual:
Speed Scaling with Explorable Uncertainty. 83-93 - Nikhil Bansal, Joseph (Seffi) Naor, Ohad Talmon:
Efficient Online Weighted Multi-Level Paging. 94-104 - Michael A. Bender, Abhishek Bhattacharjee, Alex Conway, Martin Farach-Colton, Rob Johnson, Sudarsun Kannan, William Kuszmaul, Nirjhar Mukherjee, Donald E. Porter
Paging and the Address-Translation Problem. 105-117 - Amartya Shankha Biswas, Michal Dory, Mohsen Ghaffari, Slobodan Mitrovic, Yasamin Nazari
Massively Parallel Algorithms for Distance Approximation and Spanners. 118-128 - Sebastian Brandt
Efficient Load-Balancing through Distributed Token Dropping. 129-139 - Keren Censor-Hillel, Victor I. Kolobov, Gregory Schwartzman:
Finding Subgraphs in Highly Dynamic Networks. 140-150 - Keren Censor-Hillel, Dean Leitersdorf, Volodymyr Polosukhin:
On Sparsity Awareness in Distributed Computations. 151-161 - Yi-Jun Chang
Near-Optimal Time-Energy Trade-Offs for Deterministic Leader Election. 162-172 - Dave Dice, Alex Kogan:
Hemlock: Compact and Scalable Mutual Exclusion. 173-183 - Xiaojun Dong
Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths. 184-197 - Michael Elkin, Shaked Matar:
Deterministic PRAM Approximate Shortest Paths in Polylogarithmic Time and Slightly Super-Linear Work. 198-207 - Alexander Fedorov
A Scalable Concurrent Algorithm for Dynamic Connectivity. 208-220 - Aleksander Figiel, Leon Kellerhals, Rolf Niedermeier, Matthias Rost, Stefan Schmid
Optimal Virtual Network Embeddings for Tree Topologies. 221-231 - Wilhelm Friedemann, Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, Anna Melnichenko, Jannik Peters, Daniel Stephan, Michael Vaichenker:
Efficiency and Stability in Euclidean Network Design. 232-242 - Lukas Gianinazzi
Parallel Algorithms for Finding Large Cliques in Sparse Graphs. 243-253 - Seth Gilbert
On the Complexity of Load Balancing in Dynamic Networks. 254-264 - Barun Gorain, Avery Miller
Four Shades of Deterministic Leader Election in Anonymous Networks. 265-274 - MohammadTaghi Hajiaghayi, Hamed Saleh, Saeed Seddighin, Xiaorui Sun:
String Matching with Wildcards in the Massively Parallel Computation Model. 275-284 - Sungjin Im, Ravi Kumar, Mahshid Montazer Qaem, Manish Purohit:
Non-Clairvoyant Scheduling with Predictions. 285-294 - Hongbo Kang
The Processing-in-Memory Model. 295-306 - Dariusz R. Kowalski, Miguel A. Mosteiro:
Supervised Average Consensus in Anonymous Dynamic Networks. 307-317 - Janardhan Kulkarni, Stefan Schmid
Scheduling Opportunistic Links in Two-Tiered Reconfigurable Datacenters. 318-327 - Grzegorz Kwasniewski, Tal Ben-Nun, Lukas Gianinazzi
Pebbles, Graphs, and a Pinch of Combinatorics: Towards Tight I/O Lower Bounds for Statically Analyzable Programs. 328-339 - Mozhengfu Liu, Xueyan Tang:
Analysis of Busy-Time Scheduling on Heterogeneous Machines. 340-350 - Andrés López-Martínez, Sagnik Mukhopadhyay
Work-Optimal Parallel Minimum Cuts for Non-Sparse Graphs. 351-361 - Yannic Maus:
Distributed Graph Coloring Made Easy. 362-372 - Vijaya Ramachandran, Elaine Shi:
Data Oblivious Algorithms for Multicores. 373-384 - Gal Sela
Durable Queues: The Second Amendment. 385-397 - Yifan Xu, Kunal Agrawal, I-Ting Angelina Lee:
Efficient Parallel Determinacy Race Detection for Structured Futures. 398-409
Brief Announcements
- Ramtin Afshar, Michael T. Goodrich
Parallel Network Mapping Algorithms. 410-413 - Nathan Beckmann, Phillip B. Gibbons, Charles McGuffey:
Block-Granularity-Aware Caching. 414-416 - Andrew Berns:
Network Scaffolding for Efficient Stabilization of the Chord Overlay Network. 417-419 - Subhash Bhagat
Min-Max Gathering of Oblivious Robots. 420-422 - Diego Cepeda, Wojciech M. Golab:
PHPRX: An Efficient Hash Table for Persistent Memory. 423-425 - Sakib Chowdhury, Wojciech M. Golab:
A Scalable Recoverable Skip List for Persistent Memory. 426-428 - Evgeniy Feder, Ichha Rathod, Punit Shyamsukha, Robert Sama, Vitaly Aksenov
Toward Self-Adjusting Networks for the Matching Model. 429-431 - Adam Ganczorz, Tomasz Jurdzinski, Mateusz Lewko, Andrzej Pelc:
Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels. 432-434 - David Gureya, Vladimir Vlassov, João Barreto
BALM: QoS-Aware Memory Bandwidth Partitioning for Multi-Socket Cloud Nodes. 435-438 - Rui Li
Efficient Distributed Algorithms for Convolutional Neural Networks. 439-442 - Gali Sheffi, Maurice Herlihy, Erez Petrank:
VBR: Version Based Reclamation. 443-445 - Yaodong Sheng, Ahmed Hassan, Michael F. Spear
Semantic Conflict Detection for Transactional Data Structure Libraries. 446-448 - Yifan Xu, Anchengcheng Zhou, Grace Q. Yin, Kunal Agrawal, I-Ting Angelina Lee, Tao B. Schardl:
Efficient Access History for Race Detection. 449-451
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 2025-03-11 19:48 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: