SPAA 2019 Conference Program
The SPAA 2019 program is now available.
Highlights:
- SPAA Plenary Talk by Guy Even: Saturday, June 22, 11:20-12:30
- Business Meeting : Saturday, June 22, 18:00-20:00
- Turing Lecture: Sunday, June 23, 17:15-18:30
- FCRC Plenary Talk: Monday, June 24, 11:20-12:30
SPAA 2019 Accepted Papers
Regular Papers (in no particular order):
Linear-Size Hopsets with Small Hopbound, and Constant-Hopbound Hopsets in RNC
Almost logarithmic-time space optimal leader election in population protocols
Near Optimal Coflow Scheduling in Networks
The Price of Clustering in Bin-Packing with Applications to Bin-Packing with Delays
The Arvy Distributed Directory Protocol
Using Time to Break Symmetry: Universal Deterministic Anonymous Rendezvous
Blockchain Abstract Data Type
Histogram Sort with Sampling
Multiversion Concurrency with Bounded Delay and Precise Garbage Collection
Fast and Resource Competitive Broadcast in Multi-channel Radio Networks
Dely-Free Concurrency on Faulty Persistent Memory
Faster Matrix Multiplication via Sparse Decomposition
Distributed Transactional Systems Cannot Be Fast
Energy Efficient Adversarial Routing in Shared Channels
Concurrent Data Structures with Near-Data-Processing: An Architecture-Aware Implementation
An EPTAS for machine scheduling with bag-constraints.
Skeap & Seap: Scalable Distributed Priority Queues for constant and arbitrary Priorities
Constant-Length Labeling Schemes for Deterministic Radio Broadcast
Distributed Computation in Node-Capacitated Networks
Parallel Batch-Dynamic Graph Connectivity
Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries
Theoretically-Efficient and Practical Parallel In-Place Radix Sorting
Geometric Network Creation Games
Near-Linear Approximation Algorithms for Scheduling Problems with Batch Setup Times
Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers
Dynamic Algorithms for the Massively Parallel Computation Model
Parallel Balanced Allocations: The Heavily Loaded Case
The dispersion time of random walks on finite graphs (regular paper)
Improved MPC Algorithms for Edit Distance and Ulam Distance
NC Algorithms for Perfect Matching and Maximum Flow in One-Crossing-Minor-Free Graphs
Best-of-Three Voting in Dense Graphs
Massively Parallel Computation via Remote Memory Access
Data Races and the Discrete Resource-time Tradeoff Problem with Resource Reuse over Paths
The Dictionary Problem, Optimal Searching, and Asymptotic Distortions of the DAM Model
Brief Announcements (in no particular order):
Brief Announcement: Persistent Atomics for Implementing Durable Lock-Free Data Structures for Non-Volatile Memory
Brief Announcement: Ultra-Fast Asynchronous Randomized Rumor Spreading
Brief Announcement: Writeback Aware Caching
Brief Announcement: Work Efficient Parallel Graph Isomorphism
Brief Announcement: A Memory Optimized Architecture for Multi-Field Packet Classification
Brief Announcement: Scalable diversity maximization via small-size composable core-sets
Brief Announcement: Approximation of Scheduling with Calibrations on Multiple Machines
Brief Announcement: Fast Distributed Algorithms for LP-Type Problems of Bounded Dimension
Brief Announcement: Reduced I/O Latency with Futures
Brief Announcement: Optimizing Persistent Transactions
Brief Announcement: Eccentricity Heuristics through Sublinear Analysis Lenses