Table of Contents

• Parallel Minimum Cuts in Near-linear Work and Low DepthBarbara Geissmann, Lukas Gianinazzi. 1-11 [doi]
• Wireless ExpandersShirel Attali, Merav Parter, David Peleg, Shay Solomon. 13-22 [doi]
• Trees for Vertex Cuts, Hypergraph Cuts and Minimum Hypergraph BisectionHarald Räcke, Roy Schwartz, Richard Stotz. 23-32 [doi]
• Dynamic Representations of Sparse Distributed Networks: A Locality-Sensitive ApproachHaim Kaplan, Shay Solomon. 33-42 [doi]
• Greedy and Local Ratio Algorithms in the MapReduce ModelNicholas J. A. Harvey, Christopher Liaw, Paul Liu. 43-52 [doi]
• The Resurgence of Software Performance EngineeringCharles E. Leiserson. 53 [doi]
• A 3D Parallel Algorithm for QR DecompositionGrey Ballard, James Demmel, Laura Grigori, Mathias Jacquelin, Nicholas Knight. 55-65 [doi]
• Constant-Depth and Subcubic-Size Threshold Circuits for Matrix MultiplicationOjas Parekh, Cynthia A. Phillips, Conrad D. James, James B. Aimone. 67-76 [doi]
• Integrated Model, Batch, and Domain Parallelism in Training Neural NetworksAmir Gholami, Ariful Azad, Peter H. Jin, Kurt Keutzer, Aydin Buluç. 77-86 [doi]
• Brief Announcement: On Approximating PageRank Locally with Sublinear Query ComplexityMarco Bressan 0002, Enoch Peserico, Luca Pretto. 87-89 [doi]
• Brief Announcement: Coloring-based Task Mapping for Dragonfly SystemsInk Chinavinijkul, Jacob Newcomb, Lingzhi Xi, David P. Bunde. 91-93 [doi]
• Brief Announcement: Parallel Transitive Closure Within 3D Crosspoint MemoryAlvaro Velasquez, Sumit Kumar Jha 0001. 95-98 [doi]
• BQ: A Lock-Free Queue with BatchingGal Milman, Alex Kogan, Yossi Lev, Victor Luchangco, Erez Petrank. 99-109 [doi]
• An Efficient Wait-free Resizable Hash TablePanagiota Fatourou, Nikolaos D. Kallimanis, Thomas Ropars. 111-120 [doi]
• Lock-free Contention Adapting Search TreesKjell Winblad, Konstantinos Sagonas, Bengt Jonsson. 121-132 [doi]
• Distributionally Linearizable Data StructuresDan Alistarh, Trevor Brown 0001, Justin Kopinsky, Jerry Zheng Li, Giorgi Nadiradze. 133-142 [doi]
• Distributed Domination on Graph Classes of Bounded ExpansionSaeed Akhoondian Amiri, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz. 143-151 [doi]
• Possibilities and Impossibilities for Distributed Subgraph DetectionOrr Fischer, Tzlil Gonen, Fabian Kuhn, Rotem Oshman. 153-162 [doi]
• Towards a Complexity Theory for the Congested CliqueJanne H. Korhonen, Jukka Suomela. 163-172 [doi]
• Breaking the $ilde$Omega($sqrt{n})$ Barrier: Fast Consensus under a Late AdversaryPeter Robinson 0002, Christian Scheideler, Alexander Setzer. 173-182 [doi]
• Intense Competition can Drive Selfish Explorers to Optimize CoverageSimon Collet, Amos Korman. 183-192 [doi]
• Massive-scale Streaming Analytics: Models, Parallelism, & Real-world ApplicationsDavid A. Bader. 193 [doi]
• Red-Blue Pebble Game: Complexity of Computing the Trade-Off between Cache Size and Memory TransfersErik D. Demaine, Quanquan C. Liu. 195-204 [doi]
• Online Generalized Caching with Varying Weights and CostsGuy Even, Moti Medina, Dror Rawitz. 205-212 [doi]
• Cache-Adaptive Exploration: Experimental Results and Scan-Hiding for AdaptivityAndrea Lincoln, Quanquan C. Liu, Jayson Lynch, Helen Xu. 213-222 [doi]
• Brief Announcement: Distributed Symmetry-Breaking with Improved Vertex-Averaged ComplexityLeonid Barenboim, Yaniv Tzur. 223-226 [doi]
• Brief Announcement: Hardware Transactional Persistent MemoryEllis Giles, Kshitij Doshi, Peter J. Varman. 227-230 [doi]
• Brief Announcement: Competitive Routing in Hybrid Communication NetworksDaniel Jung, Christina Kolb, Christian Scheideler, Jannik Sundermeier. 231-233 [doi]
• Parallel Write-Efficient Algorithms and Data Structures for Computational GeometryGuy E. Blelloch, Yan Gu 0001, Julian Shun, Yihan Sun 0001. 235-246 [doi]
• The Parallel Persistent Memory ModelGuy E. Blelloch, Phillip B. Gibbons, Yan Gu 0001, Charles McGuffey, Julian Shun. 247-258 [doi]
• The Inherent Cost of Remembering ConsistentlyNachshon Cohen, Rachid Guerraoui, Igor Zablotchi. 259-269 [doi]
• Romulus: Efficient Algorithms for Persistent Transactional MemoryAndreia Correia, Pascal Felber, Pedro Ramalhete. 271-282 [doi]
• A Unified Rounding Algorithm For Unrelated Machines Scheduling ProblemsNikhil R. Devanur, Janardhan Kulkarni. 283-290 [doi]
• Online Non-preemptive Scheduling on Unrelated Machines with RejectionsGiorgio Lucarelli, Benjamin Moseley, Nguyen Kim Thang, Abhinav Srivastav, Denis Trystram. 291-300 [doi]
• The Price of Bounded PreemptionNoga Alon, Yossi Azar, Mark Berlin. 301-310 [doi]
• Accurate Traffic Splitting on Commodity SwitchesOri Rottenstreich, Yossi Kanizo, Haim Kaplan, Jennifer Rexford. 311-320 [doi]
• Parallel Working-Set Search StructuresKunal Agrawal, Seth Gilbert, Wei Quan Lim. 321-332 [doi]
• Improved Worst-Case Deterministic Parallel Dynamic Minimum Spanning ForestTsvi Kopelowitz, Ely Porat, Yair Rosenmutter. 333-341 [doi]
• Brief Announcement: Approximation Algorithms for Preemptive Resource AllocationKanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai. 343-345 [doi]
• Brief Announcement: A Greedy 2 Approximation for the Active Time ProblemSaurabh Kumar, Samir Khuller. 347-349 [doi]
• Brief Announcement: Open CilkTao B. Schardl, I-Ting Angelina Lee, Charles E. Leiserson. 351-353 [doi]
• Brief Announcement: Stamp-it, a more Thread-efficient, Concurrent Memory Reclamation Scheme in the C++ Memory ModelManuel Pöter, Jesper Larsson Träff. 355-358 [doi]
• Brief Announcement: Communication in Systems of Home Based Mobile AgentsFriedhelm Meyer auf der Heide, Johannes Schaefer. 359-361 [doi]
• Optimal Algorithms for Right-Sizing Data CentersSusanne Albers, Jens Quedenfeld. 363-372 [doi]
• Online Facility Location with Mobile FacilitiesBjörn Feldkord, Friedhelm Meyer auf der Heide. 373-381 [doi]
• The Transactional Conflict ProblemDan Alistarh, Syed Kamran Haider, Raphael Kübler, Giorgi Nadiradze. 383-392 [doi]
• Theoretically Efficient Parallel Graph Algorithms Can Be Fast and ScalableLaxman Dhulipala, Guy E. Blelloch, Julian Shun. 393-404 [doi]
• On the Distributed Complexity of Large-Scale Graph ComputationsGopal Pandurangan, Peter Robinson 0002, Michele Scquizzato. 405-414 [doi]
• Laika: Efficient In-Place Scheduling for 3D Mesh Graph ComputationsPredrag Gruevski, William Hasenplaugh, David Lugato, James J. Thomas. 415-426 [doi]