SPAA 2014 Conference Program


List of Accepted Regular Papers

Leah Epstein and Elena Kleiman. Scheduling selfish jobs on multidimensional parallel machines
Tim Kaler, William Hasenplaugh, Tao Schardl and Charles Leiserson. Executing Dynamic Data-Graph Computations Deterministically Using Chromatic Scheduling
Justin Thaler, Michael Mitzenmacher and Jiayang Jiang. Parallel Peeling Algorithms
Michael Mitzenmacher. Balanced Allocations and Double Hashing
Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri and Luca Trevisan. Simple Dynamics for Majority Consensus
William Hasenplaugh, Tim Kaler, Charles Leiserson and Tao Schardl. Ordering heuristics for parallel graph coloring
Seth Gilbert, Valerie King, Seth Pettie, Ely Porat, Jared Saia and Maxwell Young. (Near) Optimal Resource-Competitive Broadcast with Jamming
Ioana Bercea, Navin Goyal, David G. Harris and Aravind Srinivasan. On Computing Maximal Independent Sets of Hypergraphs in Parallel
Eleni Ch. Akrida, Leszek Gasieniec, George Mertzios and Paul G. Spirakis. Ephemeral Networks with Random Availability of Links: Diameter and Connectivity
Jessica Chang, Samir Khuller and Koyel Mukherjee. LP Rounding and Combinatorial Algorithms for Minimizing Active and Busy Time
Edgar Solomonik, Erin Carson, Nicholas Knight and James Demmel. Tradeoffs between synchronization, communication, and work in parallel linear algebra computations
Mohammad Taghi Hajiaghayi, Theodore Johnson, Mohammad Reza Khani and Barna Saha. Hierarchical Graph Partitioning
Yusen Li, Xueyan Tang and Wentong Cai. On Dynamic Bin Packing for Resource Allocation in the Cloud
Ioannis Koutis. A Simple Parallel Algorithm for Spectral Sparsification
Victor Bushkov, Dmytro Dziuma, Panagiota Fatourou and Rachid Guerraoui. The PCL Theorem. Transactions cannot be Parallel, Consistent and Live
Kunal Agrawal, Jeremy Fineman, Kefu Lu, Brendan Sheridan, Jim Sukha and Robert Utterback. Provably Good Scheduling for Parallel Programs that Use Data Structures through Implicit Batching
Andre Brinkmann, Peter Kling, Friedhelm Meyer Auf der Heide, Lars Nagel, Sören Riechers and Tim Süszlig;. Scheduling Shared Continuous Resources on Many-Cores
Xiaocheng Hu, Yufei Tao, Yi Yang and Shuigeng Zhou. Finding Approximate Partitions and Splitters
Davide Bilo, Luciano Guala, Stefano Leucci and Guido Proietti. Locality-based Network Creation Games
Torsten Hoefler and Grzegorz Kwasniewski. Automatic Complexity Analysis of Explicitly Parallel Programs
Khuzaima Daudjee, Shahin Kamali and Alejandro Lopez-Ortiz. On the Online Fault-Tolerant Server Consolidation Problem
Harsha Vardhan Simhadri, Guy Blelloch, Jeremy Fineman, Phillip B. Gibbons and Aapo Kyrola. Experimental Analysis of Space-Bounded Schedulers
Evripidis Bampis, Dimitrios Letsios and Giorgio Lucarelli. A Note on Multiprocessor Speed Scaling with Precedence Constraints
Julian Shun and Guy Blelloch. Phase-Concurrent Hash Tables for Determinism
Julian Shun, Laxman Dhulipala and Guy Blelloch. A Simple and Practical Linear-Work Parallel Algorithm for Connectivity
Chao Wang, Yujie Liu and Michael Spear. Transaction-Friendly Condition Variables
Venmugil Elango, Fabrice Rastello, Louis-Noel Pouchet, J Ramanujam and P Sadayappan. On Characterizing the Data Movement Complexity of Computational DAGs for Parallel Execution
Kanat Tangwongsan, Srikanta Tirthapura and Kun-Lung Wu. Parallel Streaming Frequency-Based Aggregates
Dave Dice, Alex Kogan, Yossi Lev, Tim Merrifield and Mark Moir. Adaptive Integration of Hardware and Software Lock Elision Techniques
Sungjin Im, Benjamin Moseley, Kirk Pruhs and Eric Torng. Competitively Scheduling Tasks with Intermediate Parallelizability