SPAA 2017 Conference Program

SPAA 2017 Program

Preliminary version of the SPAA 2017 conference program (updated on July 20, 2017) is now available. All events, except the banquet will be held on the third floor of the Marvin Center at George Washington University.

Social events:

SPAA 2017 Accepted Papers for Regular Papers

Jason Li and Ryan O'Donnell. Bounding laconic proof systems by solving CSPs in parallel
Marcin Bienkowski, Jan Marcinkowski, Maciej Pacut, Stefan Schmid and Aleksandra Spyra. Online Tree Caching
Haoyu Wang, Haiying Shen and Guoxin Liu. Swarm-based Incast Congestion Control in datacenter Serving Web Applications
Susanne Albers. On Energy Conservation in Data Centers
Edgar Solomonik, Grey Ballard, James Demmel and Torsten Hoefler. A communication-avoiding parallel algorithm for the symmetric eigenvalue problem
Runtian Ren and Xueyan Tang. Online Flexible Job Scheduling for Minimum Span
Yoann Dieudonne and Andrzej Pelc. Impact of Knowledge on Election Time in Anonymous Networks
Colin Cooper, Tomasz Radzik and Nicolás Rivera. Improved Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs
Costas Busch, Maurice Herlihy, Miroslav Popovic and Gokarna Sharma. Fast Scheduling in Distributed Transactional Memory
Timothy Kaler, Yuxiong He and Sameh Elnikety. Optimal Reissue Policies For Reducing Tail-Latency
Hamidreza Jahanjou, Erez Kantor and Rajmohan Rajaraman. Asymptotically Optimal Approximation Algorithms for Coflow Scheduling
Sudipto Guha, Yi Li and Qin Zhang. Distributed Partial Clustering
He Sun and Luca Zanetti. Distributed Graph Clustering by Load Balancing
Yossi Azar and Danny Vainstein. Tight Bounds for Clairvoyant Dynamic Bin Packing
Pierre Fraigniaud and Dennis Olivetti. Distributed Detection of Cycles
Richard Cole and Vijaya Ramachandran. Bounding Cache Miss Costs of Multithreaded Computations Under General Schedulers
Vincent Chau, Minming Li, Samuel Mccauley and Wang Kai. Minimizing Total Weighted Flow Time with Calibrations
Alessandro Epasto, Vahab Mirrokni and Morteza Zadimoghaddam. Bicriteria Distributed Submodular Maximization in a Few Rounds
Björn Feldkord and Friedhelm Meyer Auf der Heide. The Mobile Server Problem
Shahbaz Khan. Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs
Stefan Dobrev, Manuel Lafond, Lata Narayanan and Jaroslav Opatrny. Optimal Local Buffer Management for Information Gathering with Adversarial Traffic
Peter Kling, Alexander Mäcker, Sören Riechers and Alexander Skopalik. Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource
Elaye Karstadt and Oded Schwartz. Matrix Multiplication, a Little Faster
Laxman Dhulipala, Guy Blelloch and Julian Shun. Julienne: A Framework for Parallel Graph Algorithms using Work-efficient Bucketing
Sepehr Assadi and Sanjeev Khanna. Randomized Composable Coresets for Matching and Vertex Cover
Zhiyu Liu, Irina Calciu, Maurice Herlihy and Onur Mutlu. Concurrent Data Structures for Near-Memory Computing
Riko Jacob and Nodari Sitchinava. Lower Bounds in the Asymmetric External Memory Model
Cooper Anderton and Maxwell Young. Is Our Model for Contention Resolution Wrong?
Mohammadhossein Bateni, Hossein Esfandiari and Vahab Mirrokni. Almost Optimal Streaming Algorithms for Coverage Problems
Rezaul Chowdhury, Pramod Ganapathi, Yuan Tang and Jesmin Jahan Tithi. Provably Efficient Scheduling of Cache-Oblivious Wavefront Algorithms
Tingzhe Zhou, Victor Luchangco and Michael Spear. Hand-Over-Hand Transactions with Precise Memory Reclamation

SPAA 2017 Accepted Papers for Brief Announcements

Pedro Ramalhete and Andreia Correia. Hazard Eras - Non-Blocking Memory Reclamation
Ellis Giles, Kshitij Doshi and Peter Varman. Hardware Transactional Storage Class Memory
Kunal Agrawal, Jing Li, Kefu Lu and Benjamin Moseley. Scheduling Parallelizable Jobs Online to Maximize Throughput
Gokarna Sharma, Costas Busch and Supratik Mukhopadhyay. Complete Visibility for Oblivious Robots in Linear Time
Rohit Atre. How to discover parallelism in sequential programs?
Yuan Tang, Ronghui You and Shiyi Wang. STAR (Space-Time Adaptive and Reductive) Algorithms for Dynamic Programs with more than O(1) Dependency
Tobias Friedrich, Sven Ihde, Christoph Keßler, Pascal Lenzner, Stefan Neubert and David Schumann. Efficient Best Response Computation for Strategic Network Formation under Attack
Umut Acar, Vitaly Aksenov and Sam Westrick. Parallel Dynamic Tree Contraction via Self-Adjusting Computation
Chuanyou Li and Xueyan Tang. Towards Fault-Tolerant Bin Packing for Online Cloud Resource Allocation
Antje Bjelde, Max Klimm and Daniel Schmand. Approximation Algorithms for Unsplittable Resource Allocation Problems with Diseconomies of Scale
Mehrnoosh Shafiee and Javad Ghaderi. A New Improved Bound for Coflow Scheduling
David Eppstein and Michael Goodrich. Using Multi-Level Parallelism and 2-3 Cuckoo Filters for Faster Set Intersection Queries and Sparse Boolean Matrix Multiplication
Tingzhe Zhou, Victor Luchangco and Michael Spear. Extending Transactional Memory with Atomic Deferral
Soheil Behnezhad, Mahsa Derakhshan, Hossein Esfandiari, Elif Tan and Hadi Yami. Graph Matching in Massive Datasets