SPAA 2016 Conference Program

SPAA 2016 Program

Preliminary version of the SPAA 2016 conference program can be found on Easychair on in pdf.

Social events:

SPAA 2016 Accepted Papers for Regular Papers

Guy Blelloch, Yan Gu, Yihan Sun and Kanat Tangwongsan. Parallel Shortest-Paths Using Radius Stepping
Guy Blelloch, Yan Gu, Julian Shun and Yihan Sun. Parallelism in Randomized Incremental Algorithms
Naama Ben David, Guy Blelloch, Jeremy Fineman, Phillip Gibbons, Yan Gu, Charles McGuffey and Julian Shun. Parallel Algorithms for Asymmetric Read-Write Costs
Yihan Sun, Guy Blelloch and Daniel Ferizovic. Just Join for Parallel Ordered Sets and Maps
Anat Bremler-Barr, Yotam Harchol, David Hay and Yacov Hel-Or. Encoding Short Ranges in TCAM Without Expansion: Efficient Algorithm and Applications
Amin Mohtasham and João Barreto. RUBIC: Online Parallelism Tuning for Collocated Transactional Memory Applications
Sungjin Im and Benjamin Moseley. General Profit Scheduling and the Power of Migration on Heterogeneous Machines
Avery Miller and Andrzej Pelc. Election vs. Selection: Two Ways of Finding the Largest Node in a Graph
Sungjin Im and Janardhan Kulkarni. Fair Online Scheduling for Selfish Jobs on Heterogeneous Machines
Tudor David and Rachid Guerraoui. Concurrent Search Data Structures Can Be Blocking and Practically Wait-Free
Runtian Ren and Xueyan Tang. Clairvoyant Dynamic Bin Packing for Job Scheduling with Minimum Server Usage Time
Mingmou Liu, Xiaoyin Pan and Yitong Yin. Randomized approximate nearest neighbor search with limited adaptivity
Stephan Friedrichs and Christoph Lenzen. Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-Ford
William E. Devanny, Michael Goodrich and Kristopher Jetviroj. Parallel Equivalence Class Sorting: Algorithms, Lower Bounds, and Distribution-Based Analysis
Michael Goodrich and Ahmed Eldawy. Parallel Algorithms for Summing Floating-Point Numbers
Deli Zhang and Damian Dechev. Lock-free Transactions without Aborts for Linked Data Structures
Haifeng Yu, Yuda Zhao and Irvan Jahja. The Cost of Unknown Diameter in Dynamic Networks
Kunal Agrawal, Jing Li, Kefu Lu and Benjamin Moseley. Scheduling Parallelizable Jobs Online to Minimize Maximum Flow Time
Maximilian Drees, Robert Gmyr and Christian Scheideler. Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration
Zahra Derakhshandeh, Robert Gmyr, Andréa W. Richa, Christian Scheideler and Thim Strothmann. Universal Shape Formation for Programmable Matter
Gopal Pandurangan, Peter Robinson and Michele Scquizzato. Fast Distributed Algorithms for Connectivity and MST in Large Graphs
Lin Chen, Nicole Megow and Kevin Schewior. The Power of Migration in Online Machine Minimization
Chaoran Yang and John Mellor-Crummey. A Practical Solution to the Cactus Stack problem
Amihood Amir, Oren Kapah, Tsvi Kopelowitz, Moni Naor and Ely Porat. The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets
Daniel Jung, Friedhelm Meyer Auf der Heide, Andreas Cord-Landwehr and Matthias Fischer. Asymptotically Optimal Gathering on a Grid
Oana Balmau, Rachid Guerraoui, Maurice Herlihy and Igor Zablotchi. Fast and Robust Memory Reclamation for Concurrent Data Structures
Michael Mitzenmacher, Rajmohan Rajaraman and Scott Roche. Better bounds for coalescing-branching random walks on graphs
Kamal Al-Bawani, Matthias Englert and Matthias Westermann. Online Packet Scheduling for CIOQ and Buffered Crossbar Switches
Stefan K. Muller and Umut A. Acar. Latency-Hiding Work Stealing
Mohamed M. Saad, Roberto Palmieri, Ahmed Hassan and Binoy Ravindran. Extending TM Primitives using Low Level Semantics
Mohsen Ghaffari and Merav Parter. Near-Optimal Distributed Algorithms for Fault-Tolerant Tree Structures
Trevor Brown, Alex Kogan, Yossi Lev and Victor Luchangco. Investigating the performance of hardware transactions on a multi-socket machine
David Dinh, Harsha Vardhan Simhadri and Yuan Tang. Extending the Nested Parallel Model to the Nested Dataflow Model with Provably Efficient Schedulers
Michael Bender, Erik Demaine, Roozbeh Ebrahimi, Jeremy Fineman, Rob Johnson, Andrea Lincoln, Jayson Lynch and Samuel Mccauley. Cache-Adaptive Analysis
Tim Roughgarden, Sergei Vassilvitskii and Joshua Wang. Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation)
Saman Ashkiani, Nina Amenta and John D. Owens. Parallel Approaches to the String Matching Problem on the GPU
Robert Utterback, Kunal Agrawal, Jeremy Fineman and I-Ting Angelina Lee. Provably good and practically efficient parallel race detection for fork-join programs
Madhukar Korupolu and Rajmohan Rajaraman. Robust and Probabilistic Failure-Aware Placement

SPAA 2016 Accepted Papers for Brief Announcements

Jakob Gruber, Jesper Larsson Träff and Martin Wimmer. Benchmarking Concurrent Priority Queues: Performance of k-LSM and Related Data Structures
Chao Wang, Xi Li, Aili Wang and Xuehai Zhou. Brief Announcement: MIC++: Accelerating Maximal Information Coefficient Calculation with GPUs and FPGAs
Alexander Spiegelman, Guy Golan-Gueta and Idit Keidar. Brief Announcement: Transactional Data Structure Libraries
Dmitry Katz, Baruch Schieber and Hadas Shachnai. Brief Announcement: Flexible Resource Allocation for Clouds and All-Optical Networks
Timothy Carpenter, Fabrice Rastello, P. Sadayappan and Anastasios Sidiropoulos. Brief Announcement: Approximating the I/O Complexity of One-Shot Red-Blue Pebbling
Zhuolun Xiang and Nitin Vaidya. Brief Announcement: Relaxed Byzantine Vector Consensus
Samir Khuller and Manish Purohit. Improved Approximation Algorithms for Scheduling Co-Flows
Joseph Izraelevitz, Hammurabi Mendes and Michael Scott. Brief Announcement: Preserving Happens-before in Persistent Memory
Chhaya Trehan, Georgios Karakonstantis, Dimitrios Nikolopoulos and Hans Vandierendonck. Energy optimization of memory intensive parallel workloads
Qiang-Sheng Hua, Haoqiang Fan, Lixiang Qian, Ming Ai, Yangyang Li, Xuanhua Shi and Hai Jin. A Tight Distributed Algorithm for All Pairs Shortest Paths and Applications
Hossein Esfandiari, Mohammadtaghi Hajiaghayi and David Woodruff. Applications of Uniform Sampling: Densest Subgraph and Beyond
William Kuszmaul. Fast Concurrent Cuckoo Kick-out Eviction Schemes for High-Density Tables
Rishi Surendran and Vivek Sarkar. Dynamic Determinacy Race Detection for Task Parallelism with Futures
Sungjin Im and Maryam Shadloo. A QPTAS for Non-preemptive Speed-scaling