Author Index

Acar, Umut A., Carnegie Mellon University & Inria

Brief Announcement: Parallel Dynamic Tree Contraction via Self-Adjusting Computation (Page 275)

Agrawal, Kunal, Washington University in St. Louis

Brief Announcement: Scheduling Parallelizable Jobs Online to Maximize Throughput (Page 87)

Aksenov, Vitaly, Inria & ITMO University

Brief Announcement: Parallel Dynamic Tree Contraction via Self-Adjusting Computation (Page 275)

Albers, Susanne, Technical University of Munich

On Energy Conservation in Data Centers (Page 35)

Anderton, William C., Mississippi State University

Is Our Model for Contention Resolution Wrong?: Confronting the Cost of Collisions (Page 183)

Assadi, Sepehr, University of Pennsylvania

Randomized Composable Coresets for Matching and Vertex Cover (Page 3)

Atre, Rohit, Technische Universität Darmstadt

Brief Announcement: Meeting the Challenges of Parallelizing Sequential Programs (Page 363)

Azar, Yossi, Tel-Aviv University

Tight Bounds for Clairvoyant Dynamic Bin Packing (Page 77)

Ballard, Grey, Wake Forest University

A Communication-Avoiding Parallel Algorithm for the Symmetric Eigenvalue Problem (Page 111)

Bateni, Mohammad Hossein, Google Research

Almost Optimal Streaming Algorithms for Coverage Problems (Page 13)

Behnezhad, Soheil, University of Maryland

Brief Announcement: Graph Matching in Massive Datasets (Page 133)

Bienkowski, Marcin, University of Wrocław

Online Tree Caching (Page 329)

Bjelde, Antje, Humboldt University Berlin

Brief Announcement: Approximation Algorithms for Unsplittable Resource Allocation Problems with Diseconomies of Scale (Page 227)

Blelloch, Guy E., Carnegie Mellon University

Julienne: A Framework for Parallel Graph Algorithms using Work-efficient Bucketing (Page 293)

Some Sequential Algorithms are Almost Always Parallel (Page 141)

Busch, Costas, Louisiana State University

Brief Announcement: Complete Visibility for Oblivious Robots in Linear Time (Page 325)

Fast Scheduling in Distributed Transactional Memory (Page 173)

Calciu, Irina, VMware Research Group

Concurrent Data Structures for Near-Memory Computing (Page 235)

Chau, Vincent, Shenzhen Institutes of Advanced Technology

Minimizing Total Weighted Flow Time with Calibrations (Page 67)

Chowdhury, Rezaul, Stony Brook University

Provably Efficient Scheduling of Cache-oblivious Wavefront Algorithms (Page 339)

Cole, Richard, New York University

Bounding Cache Miss Costs of Multithreaded Computations Under General Schedulers (Page 351)

Cooper, Colin, King's College London

Improved Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs (Page 305)

Correia, Andreia, Concurrency Freaks

Brief Announcement: Hazard Eras - Non-Blocking Memory Reclamation (Page 367)

Demmel, James, University of California, Berkeley

A Communication-Avoiding Parallel Algorithm for the Symmetric Eigenvalue Problem (Page 111)

Derakhshan, Mahsa, University of Maryland

Brief Announcement: Graph Matching in Massive Datasets (Page 133)

Dhulipala, Laxman, Carnegie Mellon University

Julienne: A Framework for Parallel Graph Algorithms using Work-efficient Bucketing (Page 293)

Dieudonné, Yoann, Université de Picardie Jules Verne

Impact of Knowledge on Election Time in Anonymous Networks (Page 207)

Dobrev, Stefan, Slovak Academy of Sciences

Optimal Local Buffer Management for Information Gathering with Adversarial Traffic (Page 265)

Doshi, Kshitij, Intel Corporation

Brief Announcement: Hardware Transactional Storage Class Memory (Page 375)

Elnikety, Sameh, Microsoft Research

Optimal Reissue Policies for Reducing Tail Latency (Page 195)

Epasto, Alessandro, Google

Bicriteria Distributed Submodular Maximization in a Few Rounds (Page 25)

Eppstein, David, University of California, Irvine

Brief Announcement: Using Multi-Level Parallelism and 2-3 Cuckoo Filters for Set Intersection Queries and Sparse Boolean Matrix Multiplication (Page 137)

Esfandiari, Hossein, University of Maryland

Almost Optimal Streaming Algorithms for Coverage Problems (Page 13)

Brief Announcement: Graph Matching in Massive Datasets (Page 133)

Feldkord, Björn, Paderborn University

The Mobile Server Problem (Page 313)

Fraigniaud, Pierre, CNRS & University Paris Diderot

Distributed Detection of Cycles (Page 153)

Friedrich, Tobias, Hasso Plattner Institute

Brief Announcement: Efficient Best Response Computation for Strategic Network Formation under Attack (Page 321)

Ganapathi, Pramod, Stony Brook University

Provably Efficient Scheduling of Cache-oblivious Wavefront Algorithms (Page 339)

Ghaderi, Javad, Columbia University

Brief Announcement: A New Improved Bound for Coflow Scheduling (Page 91)

Giles, Ellis, Rice University

Brief Announcement: Hardware Transactional Storage Class Memory (Page 375)

Goodrich, Michael T., University of California, Irvine

Brief Announcement: Using Multi-Level Parallelism and 2-3 Cuckoo Filters for Set Intersection Queries and Sparse Boolean Matrix Multiplication (Page 137)

Guha, Sudipto, University of Pennsylvania

Distributed Partial Clustering (Page 143)

Hajiaghayi, Mohammad, University of Maryland at College Park

Foreword

He, Yuxiong, Microsoft Research

Optimal Reissue Policies for Reducing Tail Latency (Page 195)

Herlihy, Maurice, Brown University

Concurrent Data Structures for Near-Memory Computing (Page 235)

Fast Scheduling in Distributed Transactional Memory (Page 173)

Hoefler, Torsten, ETH Zurich

A Communication-Avoiding Parallel Algorithm for the Symmetric Eigenvalue Problem (Page 111)

Ihde, Sven, Hasso Plattner Institute

Brief Announcement: Efficient Best Response Computation for Strategic Network Formation under Attack (Page 321)

Indyk, Piotr, Massachusetts Institute of Technology

Beyond P vs. NP: Quadratic-Time Hardness for Big Data Problems (Page 1)

Jacob, Riko, IT University of Copenhagen

Lower Bounds in the Asymmetric External Memory Model (Page 247)

Jahanjou, Hamidreza, Northeastern University

Asymptotically Optimal Approximation Algorithms for Coflow Scheduling (Page 45)

Jannesari, Ali, University of California, Berkeley

Brief Announcement: Meeting the Challenges of Parallelizing Sequential Programs (Page 363)

Kaler, Tim, Massachusetts Institute of Technology

Optimal Reissue Policies for Reducing Tail Latency (Page 195)

Kantor, Erez, Northeastern University

Asymptotically Optimal Approximation Algorithms for Coflow Scheduling (Page 45)

Karstadt, Elaye, Hebrew University of Jerusalem

Matrix Multiplication, a Little Faster (Page 101)

Keßler, Christoph, Hasso Plattner Institute

Brief Announcement: Efficient Best Response Computation for Strategic Network Formation under Attack (Page 321)

Khan, Shahbaz, Indian Institute of Technology Kanpur

Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs (Page 283)

Khanna, Sanjeev, University of Pennsylvania

Randomized Composable Coresets for Matching and Vertex Cover (Page 3)

Klimm, Max, Humboldt University Berlin

Brief Announcement: Approximation Algorithms for Unsplittable Resource Allocation Problems with Diseconomies of Scale (Page 227)

Kling, Peter, University of Hamburg

Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource (Page 123)

Lafond, Manuel, Université d'Ottawa

Optimal Local Buffer Management for Information Gathering with Adversarial Traffic (Page 265)

Lenzner, Pascal, Hasso Plattner Institute

Brief Announcement: Efficient Best Response Computation for Strategic Network Formation under Attack (Page 321)

Li, Chuanyou, Nanyang Technological University

Brief Announcement: Towards Fault-Tolerant Bin Packing for Online Cloud Resource Allocation (Page 231)

Li, Jason, Carnegie Mellon University

Bounding Laconic Proof Systems by Solving CSPs in Parallel (Page 95)

Li, Jing, Washington University in St. Louis

Brief Announcement: Scheduling Parallelizable Jobs Online to Maximize Throughput (Page 87)

Li, Minming, City University of Hong Kong

Minimizing Total Weighted Flow Time with Calibrations (Page 67)

Li, Yi, Nanyang Technological University

Distributed Partial Clustering (Page 143)

Liu, Guoxin, Clemson University

Swarm-based Incast Congestion Control in Datacenters Serving Web Applications (Page 217)

Liu, Zhiyu, Brown University

Concurrent Data Structures for Near-Memory Computing (Page 235)

Lu, Kefu, Washington University in St. Louis

Brief Announcement: Scheduling Parallelizable Jobs Online to Maximize Throughput (Page 87)

Luchangco, Victor, Oracle Labs

Brief Announcement: Extending Transactional Memory with Atomic Deferral (Page 371)

Hand-Over-Hand Transactions with Precise Memory Reclamation (Page 255)

Mäcker, Alexander, Paderborn University

Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource (Page 123)

Marcinkowski, Jan, University of Wrocław

Online Tree Caching (Page 329)

McCauley, Samuel, IT University of Copenhagen

Minimizing Total Weighted Flow Time with Calibrations (Page 67)

Meyer auf der Heide, Friedhelm, Paderborn University

The Mobile Server Problem (Page 313)

Mirrokni, Vahab, Google Research

Almost Optimal Streaming Algorithms for Coverage Problems (Page 13)

Bicriteria Distributed Submodular Maximization in a Few Rounds (Page 25)

Moseley, Benjamin, Washington University in St. Louis

Brief Announcement: Scheduling Parallelizable Jobs Online to Maximize Throughput (Page 87)

Mukhopadhyay, Supratik, Louisiana State University

Brief Announcement: Complete Visibility for Oblivious Robots in Linear Time (Page 325)

Mutlu, Onur, ETH Zürich

Concurrent Data Structures for Near-Memory Computing (Page 235)

Narayanan, Lata, Concordia University

Optimal Local Buffer Management for Information Gathering with Adversarial Traffic (Page 265)

Neubert, Stefan, Hasso Plattner Institute

Brief Announcement: Efficient Best Response Computation for Strategic Network Formation under Attack (Page 321)

O'Donnell, Ryan, Carnegie Mellon University

Bounding Laconic Proof Systems by Solving CSPs in Parallel (Page 95)

Olivetti, Dennis, Gran Sasso Science Institute

Distributed Detection of Cycles (Page 153)

Opatrny, Jaroslav, Concordia University

Optimal Local Buffer Management for Information Gathering with Adversarial Traffic (Page 265)

Pacut, Maciej, University of Wrocław

Online Tree Caching (Page 329)

Pelc, Andrzej, Université du Québec en Outaouais

Impact of Knowledge on Election Time in Anonymous Networks (Page 207)

Popovic, Miroslav, University of Novi Sad

Fast Scheduling in Distributed Transactional Memory (Page 173)

Radzik, Tomasz, King's College London

Improved Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs (Page 305)

Rajaraman, Rajmohan, Northeastern University

Asymptotically Optimal Approximation Algorithms for Coflow Scheduling (Page 45)

Ramachandran, Vijaya, University of Texas at Austin

Bounding Cache Miss Costs of Multithreaded Computations Under General Schedulers (Page 351)

Ramalhete, Pedro, Cisco Systems

Brief Announcement: Hazard Eras - Non-Blocking Memory Reclamation (Page 367)

Ren, Runtian, Nanyang Technological University

Online Flexible Job Scheduling for Minimum Span (Page 55)

Riechers, Sören, Paderborn University

Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource (Page 123)

Rivera, Nicolás, King's College London

Improved Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs (Page 305)

Scheideler, Christian, Paderborn University

Foreword

Schmand, Daniel, RWTH Aachen University

Brief Announcement: Approximation Algorithms for Unsplittable Resource Allocation Problems with Diseconomies of Scale (Page 227)

Schmid, Stefan, Aalborg University

Online Tree Caching (Page 329)

Schumann, David, Hasso Plattner Institute

Brief Announcement: Efficient Best Response Computation for Strategic Network Formation under Attack (Page 321)

Schwartz, Oded, Hebrew University of Jerusalem

Matrix Multiplication, a Little Faster (Page 101)

Shafiee, Mehrnoosh, Columbia University

Brief Announcement: A New Improved Bound for Coflow Scheduling (Page 91)

Sharma, Gokarna, Kent State University

Brief Announcement: Complete Visibility for Oblivious Robots in Linear Time (Page 325)

Fast Scheduling in Distributed Transactional Memory (Page 173)

Shen, Haiying, University of Virginia

Swarm-based Incast Congestion Control in Datacenters Serving Web Applications (Page 217)

Shun, Julian, University of California, Berkeley

Julienne: A Framework for Parallel Graph Algorithms using Work-efficient Bucketing (Page 293)

Sitchinava, Nodari, University of Hawaii at Mānoa

Lower Bounds in the Asymmetric External Memory Model (Page 247)

Skopalik, Alexander, Paderborn University

Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource (Page 123)

Solomonik, Edgar, University of Illinois at Urbana-Champaign

A Communication-Avoiding Parallel Algorithm for the Symmetric Eigenvalue Problem (Page 111)

Spear, Michael, Lehigh University

Brief Announcement: Extending Transactional Memory with Atomic Deferral (Page 371)

Hand-Over-Hand Transactions with Precise Memory Reclamation (Page 255)

Spyra, Aleksandra, University of Wrocław

Online Tree Caching (Page 329)

Sun, He, University of Bristol

Distributed Graph Clustering by Load Balancing (Page 163)

Tan, Elif, Ankara University

Brief Announcement: Graph Matching in Massive Datasets (Page 133)

Tang, Xueyan, Nanyang Technological University

Brief Announcement: Towards Fault-Tolerant Bin Packing for Online Cloud Resource Allocation (Page 231)

Online Flexible Job Scheduling for Minimum Span (Page 55)

Tang, Yuan, Fudan University

Brief Announcement: STAR (Space-Time Adaptive and Reductive) Algorithms for Dynamic Programming Recurrences with more than O(1) Dependency (Page 279)

Provably Efficient Scheduling of Cache-oblivious Wavefront Algorithms (Page 339)

Tithi, Jesmin Jahan, Intel Corporation

Provably Efficient Scheduling of Cache-oblivious Wavefront Algorithms (Page 339)

Vainstein, Danny, Tel-Aviv University

Tight Bounds for Clairvoyant Dynamic Bin Packing (Page 77)

Varman, Peter, Rice University

Brief Announcement: Hardware Transactional Storage Class Memory (Page 375)

Wang, Haoyu, University of Virginia

Swarm-based Incast Congestion Control in Datacenters Serving Web Applications (Page 217)

Wang, Kai, City University of Hong Kong

Minimizing Total Weighted Flow Time with Calibrations (Page 67)

Wang, Shiyi, Fudan University

Brief Announcement: STAR (Space-Time Adaptive and Reductive) Algorithms for Dynamic Programming Recurrences with more than O(1) Dependency (Page 279)

Westrick, Sam, Carnegie Mellon University

Brief Announcement: Parallel Dynamic Tree Contraction via Self-Adjusting Computation (Page 275)

Wolf, Felix, Technische Universität Darmstadt

Brief Announcement: Meeting the Challenges of Parallelizing Sequential Programs (Page 363)

Yami, Hadi, University of Maryland

Brief Announcement: Graph Matching in Massive Datasets (Page 133)

Young, Maxwell, Mississippi State University

Is Our Model for Contention Resolution Wrong?: Confronting the Cost of Collisions (Page 183)

Zadimoghaddam, Morteza, Google

Bicriteria Distributed Submodular Maximization in a Few Rounds (Page 25)

Zanetti, Luca, University of Bristol

Distributed Graph Clustering by Load Balancing (Page 163)

Zhang, Qin, Indiana University, Bloomington

Distributed Partial Clustering (Page 143)

Zhou, Tingzhe, Lehigh University

Brief Announcement: Extending Transactional Memory with Atomic Deferral (Page 371)

Hand-Over-Hand Transactions with Precise Memory Reclamation (Page 255)