default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID32nd SPAA 2020: Virtual Event, USA
- Christian Scheideler, Michael Spear:
SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020. ACM 2020, ISBN 978-1-4503-6935-0
Full Papers
- Dimitris Achlioptas, Themis Gouleakis, Fotis Iliopoulos:
Simple Local Computation Algorithms for the General Lovász Local Lemma. 1-10 - Udit Agarwal, Vijaya Ramachandran:
Faster Deterministic All Pairs Shortest Paths in Congest Model. 11-21 - Kunal Agrawal, Michael A. Bender, Jeremy T. Fineman, Seth Gilbert
, Maxwell Young:
Contention Resolution with Message Deadlines. 23-35 - Dan Alistarh, Trevor Brown, Nandini Singhal:
Memory Tagging: Minimalist Synchronization for Scalable Concurrent Data Structures. 37-49 - Daniel Anderson, Guy E. Blelloch, Kanat Tangwongsan:
Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window Model. 51-61 - Michael A. Bender, Rezaul Alam Chowdhury, Rathish Das, Rob Johnson, William Kuszmaul, Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, Helen Xu:
Closing the Gap Between Cache-oblivious and Cache-adaptive Analysis. 63-73 - Benjamin Berg, Mor Harchol-Balter, Benjamin Moseley, Weina Wang, Justin Whitehouse:
Optimal Resource Allocation for Elastic and Inelastic Jobs. 75-87 - Guy E. Blelloch, Jeremy T. Fineman, Yan Gu, Yihan Sun:
Optimal Parallel Algorithms in the Binary-Forking Model. 89-102 - Guy E. Blelloch, Yan Gu, Julian Shun, Yihan Sun:
Randomized Incremental Convex Hull is Highly Parallel. 103-115 - Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit:
Almost Universal Anonymous Rendezvous in the Plane. 117-127 - Jannik Castenow, Björn Feldkord, Till Knollmann, Manuel Malatyali, Friedhelm Meyer auf der Heide:
The Online Multi-Commodity Facility Location Problem. 129-139 - Moses Charikar, Weiyun Ma, Li-Yang Tan:
Unconditional Lower Bounds for Adaptive Massively Parallel Computation. 141-151 - Kai-Min Chung, Kuan-Yi Ho, Xiaorui Sun:
On the Hardness of Massively Parallel Computation. 153-162 - Andrea Clementi, Emanuele Natale, Isabella Ziccardi:
Parallel Load Balancing on Constrained Client-Server Topologies. 163-173 - Artur Czumaj, Peter Davies, Merav Parter:
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space. 175-185 - Rathish Das, Kunal Agrawal, Michael A. Bender, Jonathan W. Berry, Benjamin Moseley, Cynthia A. Phillips:
How to Manage High-Bandwidth Memory Automatically. 187-199 - Anna R. Dornhaus, Nancy A. Lynch, Frederik Mallmann-Trenn, Dominik Pajak, Tsvetomira Radeva:
Self-Stabilizing Task Allocation In Spite of Noise. 201-211 - Faith Ellen, Seth Gilbert:
Constant-Length Labelling Schemes for Faster Deterministic Radio Broadcast. 213-222 - Michael Feldmann, Ardalan Khazraei, Christian Scheideler:
Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model. 223-233 - Vijay K. Garg:
Predicate Detection to Solve Combinatorial Optimization Problems. 235-245 - Pawel Garncarek, Tomasz Jurdzinski, Dariusz R. Kowalski:
Efficient Local Medium Access. 247-257 - Mohsen Ghaffari, Ce Jin, Daan Nilis:
A Massively Parallel Algorithm for Minimum Weight Vertex Cover. 259-268 - Lukas Gianinazzi, Torsten Hoefler:
Parallel Planar Subgraph Isomorphism and Vertex Connectivity. 269-280 - Wojciech M. Golab:
The Recoverable Consensus Hierarchy. 281-291 - Zhixiang Gu, Jose Moreira, David Edelsohn, Ariful Azad:
Bandwidth Optimized Parallel Algorithms for Sparse Matrix-Matrix Multiplication using Propagation Blocking. 293-303 - Hamidreza Jahanjou, Rajmohan Rajaraman, David Stalfa:
Scheduling Flows on a Switch to Optimize Response Times. 305-315 - Irvan Jahja, Haifeng Yu:
Sublinear Algorithms in T-interval Dynamic Networks. 317-327 - Saachi Jain, Matei Zaharia:
Spectral Lower Bounds on the I/O Complexity of Computation Graphs. 329-338 - Samin Jamalabadi, Chris Schwiegelshohn, Uwe Schwiegelshohn:
Commitment and Slack for Online Load Maximization. 339-348 - Klaus Jansen, Alexandra Lassota, Marten Maack:
Approximation Algorithms for Scheduling with Class Constraints. 349-357 - Sixue Cliff Liu, Robert E. Tarjan, Peilin Zhong:
Connected Components on a PRAM in Log Diameter Time. 359-369 - Thomas Locher:
Fast Byzantine Agreement for Permissioned Distributed Ledgers. 371-382 - Darya Melnyk, Roger Wattenhofer:
The Append Memory Model: Why BlockDAGs Excel Blockchains. 383-393 - Lazar Milenkovic, Shay Solomon:
A Unified Sparsification Approach for Matching Problems in Graphs of Bounded Neighborhood Independence. 395-406 - Avery Miller, Andrzej Pelc, Ram Narayan Yadav:
Deterministic Leader Election in Anonymous Radio Networks. 407-417 - Pál András Papp, Roger Wattenhofer:
On the Hardness of Red-Blue Pebble Games. 419-429 - Boaz Patt-Shamir, Evyatar Yadai:
Non-Linear Ski Rental. 431-440 - Yuhan Peng, Peter J. Varman:
pTrans: A Scalable Algorithm for Reservation Guarantees in Distributed Systems. 441-452 - Gali Sheffi, Erez Petrank:
Functional Faults. 453-463 - Kyle Singer, Noah Goldstein, Stefan K. Muller, Kunal Agrawal, I-Ting Angelina Lee, Umut A. Acar:
Priority Scheduling for Interactive Applications. 465-477 - Alexander Tiskin:
Communication vs Synchronisation in Parallel String Comparison. 479-489
Brief Announcements
- Ramtin Afshar, Michael T. Goodrich, Pedro Matias, Martha C. Osegueda:
Reconstructing Binary Trees in Parallel. 491-492 - Kunal Agrawal, Michael A. Bender, Rathish Das, William Kuszmaul, Enoch Peserico, Michele Scquizzato:
Green Paging and Parallel Paging. 493-495 - James B. Aimone, Yang Ho, Ojas Parekh, Cynthia A. Phillips, Ali Pinar, William Severa, Yipu Wang:
Provable Neuromorphic Advantages for Computing Shortest Paths. 497-499 - Sharareh Alipour, Amir Jafari:
A LOCAL Constant Approximation Factor Algorithm for Minimum Dominating Set of Certain Planar Graphs. 501-502 - Hagit Attiya, Ohad Ben-Baruch, Panagiota Fatourou, Danny Hendler, Eleftherios Kosmas:
Tracking in Order to Recover - Detectable Recovery of Lock-Free Data Structures. 503-505 - Guy E. Blelloch, Daniel Anderson, Laxman Dhulipala:
ParlayLib - A Toolkit for Parallel Algorithms on Shared-Memory Multicore Machines. 507-509 - Nairen Cao, Jeremy T. Fineman, Katina Russell:
Improved Work Span Tradeoff for Single Source Reachability and Approximate Shortest Paths. 511-513 - Jannik Castenow, Peter Kling, Till Knollmann, Friedhelm Meyer auf der Heide:
A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up. 515-517 - Rezaul Chowdhury, Francesco Silvestri, Flavio Vella:
A Computational Model for Tensor Core Units. 519-521 - Grace Dinh, James Demmel:
Communication-Optimal Tilings for Projective Nested Loops with Arbitrary Bounds. 523-525 - Reza Fathi, Anisur Rahaman Molla, Gopal Pandurangan:
Efficient Distributed Algorithms for the K-Nearest Neighbors Problem. 527-529 - Seth Gilbert, Lawrence Er Lu Li:
How Fast Can You Update Your MST? 531-533 - Iqra Altaf Gillani, Amitabha Bagchi:
A Queueing Network-Based Distributed Laplacian Solver. 535-537 - Wojciech M. Golab, Hao Tan:
A Closer Look at Quantum Distributed Consensus. 539-541 - Lorenz Hübschle-Schneider, Peter Sanders:
Communication-Efficient Weighted Reservoir Sampling from Fully Distributed Data Streams. 543-545 - Shahin Kamali, Helen Xu:
Multicore Paging Algorithms Cannot Be Competitive. 547-549 - William Kuszmaul, Alek Westover:
Cache-Efficient Parallel-Partition Algorithms using Exclusive-Read-and-Write Memory. 551-553 - Dmitriy Morozov, Arnur Nigmetov:
Towards Lockfree Persistent Homology. 555-557 - Suzanne Mueller, Willow Ahrens, Stephen Chou, Fredrik Kjolstad, Saman P. Amarasinghe:
Sparse Tensor Transpositions. 559-561 - Yishai Oltchik, Oded Schwartz:
Network Partitioning and Avoidable Contention. 563-565 - Behnam Pourghassemi, Chenghao Zhang, Joo Hwan Lee, Aparna Chandramowlishwaran:
On the Limits of Parallelizing Convolutional Neural Networks on GPUs. 567-569 - Dimitrios Siakavaras, Panagiotis Billis, Konstantinos Nikas, Georgios I. Goumas, Nectarios Koziris:
Efficient Concurrent Range Queries in B+-trees using RCU-HTM. 571-573 - Yuan Tang:
Balanced Partitioning of Several Cache-Oblivious Algorithms. 575-577 - Rob van Glabbeek, Vincent Gramoli, Pierre Tholoniat:
Feasibility of Cross-Chain Payment with Success Guarantees. 579-581 - Jeffrey Xiao, Zheng Zhang, Wojciech M. Golab:
Benchmarking Recoverable Mutex Locks. 583-585 - Jingna Zeng, Seif Haridi, Shady Issa, Paolo Romano, Luís E. T. Rodrigues:
Giving Future(s) to Transactional Memory. 587-589 - Xiaoyang Zhang, Junmin Xiao, Guangming Tan:
Communication Lower Bounds of Convolutions in CNNs. 591-593
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-02-07 23:58 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:
