SPAA 2016: 28TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES

A
Acar, Umut A.	Latency-Hiding Work Stealing
Agrawal, Kunal	Scheduling Parallelizable Jobs Online to Minimize Maximum Flow Time Provably good and practically efficient parallel race detection for fork-join programs
Ai, Ming	A Tight Distributed Algorithm for All Pairs Shortest Paths and Applications
Al-Bawani, Kamal	Online Packet Scheduling for CIOQ and Buffered Crossbar Switches
Amenta, Nina	Parallel Approaches to the String Matching Problem on the GPU
Amir, Amihood	The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets
Ashkiani, Saman	Parallel Approaches to the String Matching Problem on the GPU
B
Balmau, Oana	Fast and Robust Memory Reclamation for Concurrent Data Structures
Barreto, João	RUBIC: Online Parallelism Tuning for Collocated Transactional Memory Applications
Ben David, Naama	Parallel Algorithms for Asymmetric Read-Write Costs
Bender, Michael	Cache-Adaptive Analysis
Blelloch, Guy	Parallelism in Randomized Incremental Algorithms Parallel Shortest-Paths Using Radius Stepping Just Join for Parallel Ordered Sets and Maps Parallel Algorithms for Asymmetric Read-Write Costs
Bremler-Barr, Anat	Encoding Short Ranges in TCAM Without Expansion: Efficient Algorithm and Applications
Brown, Trevor	Investigating the performance of hardware transactions on a multi-socket machine
C
Carpenter, Timothy	Brief Announcement: Approximating the I/O Complexity of One-Shot Red-Blue Pebbling
Chen, Lin	The Power of Migration in Online Machine Minimization
Cord-Landwehr, Andreas	Asymptotically Optimal Gathering on a Grid
D
David, Tudor	Concurrent Search Data Structures Can Be Blocking and Practically Wait-Free
Dechev, Damian	Lock-free Transactions without Aborts for Linked Data Structures
Demaine, Erik	Cache-Adaptive Analysis
Derakhshandeh, Zahra	Universal Shape Formation for Programmable Matter
Devanny, William E.	Parallel Equivalence Class Sorting: Algorithms, Lower Bounds, and Distribution-Based Analysis
Dinh, David	Extending the Nested Parallel Model to the Nested Dataflow Model with Provably Efficient Schedulers
Drees, Maximilian	Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration
E
Ebrahimi, Roozbeh	Cache-Adaptive Analysis
Eldawy, Ahmed	Parallel Algorithms for Summing Floating-Point Numbers
Englert, Matthias	Online Packet Scheduling for CIOQ and Buffered Crossbar Switches
Esfandiari, Hossein	Applications of Uniform Sampling: Densest Subgraph and Beyond
F
Fan, Haoqiang	A Tight Distributed Algorithm for All Pairs Shortest Paths and Applications
Ferizovic, Daniel	Just Join for Parallel Ordered Sets and Maps
Fineman, Jeremy	Provably good and practically efficient parallel race detection for fork-join programs Cache-Adaptive Analysis Parallel Algorithms for Asymmetric Read-Write Costs
Fischer, Matthias	Asymptotically Optimal Gathering on a Grid
Friedrichs, Stephan	Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-Ford
G
Ghaffari, Mohsen	Near-Optimal Distributed Algorithms for Fault-Tolerant Tree Structures
Gibbons, Phillip	Parallel Algorithms for Asymmetric Read-Write Costs
Gmyr, Robert	Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration Universal Shape Formation for Programmable Matter
Golan-Gueta, Guy	Brief Announcement: Transactional Data Structure Libraries
Goodrich, Michael	Parallel Algorithms for Summing Floating-Point Numbers Parallel Equivalence Class Sorting: Algorithms, Lower Bounds, and Distribution-Based Analysis
Gruber, Jakob	Benchmarking Concurrent Priority Queues: Performance of k-LSM and Related Data Structures
Gu, Yan	Parallelism in Randomized Incremental Algorithms Parallel Shortest-Paths Using Radius Stepping Parallel Algorithms for Asymmetric Read-Write Costs
Guerraoui, Rachid	Concurrent Search Data Structures Can Be Blocking and Practically Wait-Free Fast and Robust Memory Reclamation for Concurrent Data Structures
H
Hajiaghayi, Mohammadtaghi	Applications of Uniform Sampling: Densest Subgraph and Beyond
Harchol, Yotam	Encoding Short Ranges in TCAM Without Expansion: Efficient Algorithm and Applications
Hassan, Ahmed	Extending TM Primitives using Low Level Semantics
Hay, David	Encoding Short Ranges in TCAM Without Expansion: Efficient Algorithm and Applications
Hel-Or, Yacov	Encoding Short Ranges in TCAM Without Expansion: Efficient Algorithm and Applications
Herlihy, Maurice	Fast and Robust Memory Reclamation for Concurrent Data Structures
Hua, Qiang-Sheng	A Tight Distributed Algorithm for All Pairs Shortest Paths and Applications
I
Im, Sungjin	General Profit Scheduling and the Power of Migration on Heterogeneous Machines Fair Online Scheduling for Selfish Jobs on Heterogeneous Machines A QPTAS for Non-preemptive Speed-scaling
Izraelevitz, Joseph	Brief Announcement: Preserving Happens-before in Persistent Memory
J
Jahja, Irvan	The Cost of Unknown Diameter in Dynamic Networks
Jetviroj, Kristopher	Parallel Equivalence Class Sorting: Algorithms, Lower Bounds, and Distribution-Based Analysis
Jin, Hai	A Tight Distributed Algorithm for All Pairs Shortest Paths and Applications
Johnson, Rob	Cache-Adaptive Analysis
Jung, Daniel	Asymptotically Optimal Gathering on a Grid
K
Kapah, Oren	The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets
Karakonstantis, Georgios	Energy optimization of memory intensive parallel workloads
Katz, Dmitry	Brief Announcement: Flexible Resource Allocation for Clouds and All-Optical Networks
Keidar, Idit	Brief Announcement: Transactional Data Structure Libraries
Khuller, Samir	Improved Approximation Algorithms for Scheduling Co-Flows
Kogan, Alex	Investigating the performance of hardware transactions on a multi-socket machine
Kopelowitz, Tsvi	The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets
Korupolu, Madhukar	Robust and Probabilistic Failure-Aware Placement
Kulkarni, Janardhan	Fair Online Scheduling for Selfish Jobs on Heterogeneous Machines
Kuszmaul, William	Fast Concurrent Cuckoo Kick-out Eviction Schemes for High-Density Tables
L
Lee, I-Ting Angelina	Provably good and practically efficient parallel race detection for fork-join programs
Lenzen, Christoph	Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-Ford
Lev, Yossi	Investigating the performance of hardware transactions on a multi-socket machine
Li, Jing	Scheduling Parallelizable Jobs Online to Minimize Maximum Flow Time
Li, Xi	Brief Announcement: MIC++: Accelerating Maximal Information Coefficient Calculation with GPUs and FPGAs
Li, Yangyang	A Tight Distributed Algorithm for All Pairs Shortest Paths and Applications
Lincoln, Andrea	Cache-Adaptive Analysis
Liu, Mingmou	Randomized approximate nearest neighbor search with limited adaptivity
Lu, Kefu	Scheduling Parallelizable Jobs Online to Minimize Maximum Flow Time
Luchangco, Victor	Investigating the performance of hardware transactions on a multi-socket machine
Lynch, Jayson	Cache-Adaptive Analysis
M
Mccauley, Samuel	Cache-Adaptive Analysis
McGuffey, Charles	Parallel Algorithms for Asymmetric Read-Write Costs
Megow, Nicole	The Power of Migration in Online Machine Minimization
Mellor-Crummey, John	A Practical Solution to the Cactus Stack problem
Mendes, Hammurabi	Brief Announcement: Preserving Happens-before in Persistent Memory
Meyer Auf der Heide, Friedhelm	Asymptotically Optimal Gathering on a Grid
Miller, Avery	Election vs. Selection: How Much Advice is Needed to Find the Largest Node in a Graph?
Mitzenmacher, Michael	Better bounds for coalescing-branching random walks on graphs
Mohtasham, Amin	RUBIC: Online Parallelism Tuning for Collocated Transactional Memory Applications
Moseley, Benjamin	General Profit Scheduling and the Power of Migration on Heterogeneous Machines Scheduling Parallelizable Jobs Online to Minimize Maximum Flow Time
Muller, Stefan K.	Latency-Hiding Work Stealing
N
Naor, Moni	The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets
Nikolopoulos, Dimitrios	Energy optimization of memory intensive parallel workloads
O
Owens, John D.	Parallel Approaches to the String Matching Problem on the GPU
P
Palmieri, Roberto	Extending TM Primitives using Low Level Semantics
Pan, Xiaoyin	Randomized approximate nearest neighbor search with limited adaptivity
Pandurangan, Gopal	Fast Distributed Algorithms for Connectivity and MST in Large Graphs
Parter, Merav	Near-Optimal Distributed Algorithms for Fault-Tolerant Tree Structures
Pelc, Andrzej	Election vs. Selection: How Much Advice is Needed to Find the Largest Node in a Graph?
Porat, Ely	The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets
Purohit, Manish	Improved Approximation Algorithms for Scheduling Co-Flows
Q
Qian, Lixiang	A Tight Distributed Algorithm for All Pairs Shortest Paths and Applications
R
Rajaraman, Rajmohan	Robust and Probabilistic Failure-Aware Placement Better bounds for coalescing-branching random walks on graphs
Rastello, Fabrice	Brief Announcement: Approximating the I/O Complexity of One-Shot Red-Blue Pebbling
Ravindran, Binoy	Extending TM Primitives using Low Level Semantics
Ren, Runtian	Clairvoyant Dynamic Bin Packing for Job Scheduling with Minimum Server Usage Time
Richa, Andréa W.	Universal Shape Formation for Programmable Matter
Robinson, Peter	Fast Distributed Algorithms for Connectivity and MST in Large Graphs
Roche, Scott	Better bounds for coalescing-branching random walks on graphs
Roughgarden, Tim	Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation)
S
Saad, Mohamed M.	Extending TM Primitives using Low Level Semantics
Sadayappan, P.	Brief Announcement: Approximating the I/O Complexity of One-Shot Red-Blue Pebbling
Sarkar, Vivek	Dynamic Determinacy Race Detection for Task Parallelism with Futures
Scheideler, Christian	Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration Universal Shape Formation for Programmable Matter
Schewior, Kevin	The Power of Migration in Online Machine Minimization
Schieber, Baruch	Brief Announcement: Flexible Resource Allocation for Clouds and All-Optical Networks
Scott, Michael	Brief Announcement: Preserving Happens-before in Persistent Memory
Scquizzato, Michele	Fast Distributed Algorithms for Connectivity and MST in Large Graphs
Shachnai, Hadas	Brief Announcement: Flexible Resource Allocation for Clouds and All-Optical Networks
Shadloo, Maryam	A QPTAS for Non-preemptive Speed-scaling
Shi, Xuanhua	A Tight Distributed Algorithm for All Pairs Shortest Paths and Applications
Shun, Julian	Parallelism in Randomized Incremental Algorithms Parallel Algorithms for Asymmetric Read-Write Costs
Sidiropoulos, Anastasios	Brief Announcement: Approximating the I/O Complexity of One-Shot Red-Blue Pebbling
Simhadri, Harsha Vardhan	Extending the Nested Parallel Model to the Nested Dataflow Model with Provably Efficient Schedulers
Spiegelman, Alexander	Brief Announcement: Transactional Data Structure Libraries
Strothmann, Thim	Universal Shape Formation for Programmable Matter
Sun, Yihan	Parallelism in Randomized Incremental Algorithms Parallel Shortest-Paths Using Radius Stepping Just Join for Parallel Ordered Sets and Maps
Surendran, Rishi	Dynamic Determinacy Race Detection for Task Parallelism with Futures
T
Tang, Xueyan	Clairvoyant Dynamic Bin Packing for Job Scheduling with Minimum Server Usage Time
Tang, Yuan	Extending the Nested Parallel Model to the Nested Dataflow Model with Provably Efficient Schedulers
Tangwongsan, Kanat	Parallel Shortest-Paths Using Radius Stepping
Trehan, Chhaya	Energy optimization of memory intensive parallel workloads
Träff, Jesper Larsson	Benchmarking Concurrent Priority Queues: Performance of k-LSM and Related Data Structures
U
Utterback, Robert	Provably good and practically efficient parallel race detection for fork-join programs
V
Vaidya, Nitin	Brief Announcement: Relaxed Byzantine Vector Consensus
Vandierendonck, Hans	Energy optimization of memory intensive parallel workloads
Vassilvitskii, Sergei	Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation)
W
Wang, Aili	Brief Announcement: MIC++: Accelerating Maximal Information Coefficient Calculation with GPUs and FPGAs
Wang, Chao	Brief Announcement: MIC++: Accelerating Maximal Information Coefficient Calculation with GPUs and FPGAs
Wang, Joshua	Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation)
Westermann, Matthias	Online Packet Scheduling for CIOQ and Buffered Crossbar Switches
Wimmer, Martin	Benchmarking Concurrent Priority Queues: Performance of k-LSM and Related Data Structures
Woodruff, David	Applications of Uniform Sampling: Densest Subgraph and Beyond
X
Xiang, Zhuolun	Brief Announcement: Relaxed Byzantine Vector Consensus
Y
Yang, Chaoran	A Practical Solution to the Cactus Stack problem
Yin, Yitong	Randomized approximate nearest neighbor search with limited adaptivity
Yu, Haifeng	The Cost of Unknown Diameter in Dynamic Networks
Z
Zablotchi, Igor	Fast and Robust Memory Reclamation for Concurrent Data Structures
Zhang, Deli	Lock-free Transactions without Aborts for Linked Data Structures
Zhao, Yuda	The Cost of Unknown Diameter in Dynamic Networks
Zhou, Xuehai	Brief Announcement: MIC++: Accelerating Maximal Information Coefficient Calculation with GPUs and FPGAs

Disclaimer | Powered by EasyChair Smart Program