default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID30th SPAA 2018: Vienna, Austria
- Christian Scheideler, Jeremy T. Fineman:
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, SPAA 2018, Vienna, Austria, July 16-18, 2018. ACM 2018
Session 1
- Barbara Geissmann, Lukas Gianinazzi
:
Parallel Minimum Cuts in Near-linear Work and Low Depth. 1-11 - Shirel Attali, Merav Parter, David Peleg, Shay Solomon:
Wireless Expanders. 13-22 - Harald Räcke, Roy Schwartz, Richard Stotz:
Trees for Vertex Cuts, Hypergraph Cuts and Minimum Hypergraph Bisection. 23-32 - Haim Kaplan, Shay Solomon:
Dynamic Representations of Sparse Distributed Networks: A Locality-Sensitive Approach. 33-42 - Nicholas J. A. Harvey, Christopher Liaw, Paul Liu:
Greedy and Local Ratio Algorithms in the MapReduce Model. 43-52
Keynote Address
- Charles E. Leiserson:
The Resurgence of Software Performance Engineering. 53
Session 2
- Grey Ballard, James Demmel, Laura Grigori, Mathias Jacquelin, Nicholas Knight:
A 3D Parallel Algorithm for QR Decomposition. 55-65 - Ojas Parekh, Cynthia A. Phillips, Conrad D. James, James B. Aimone:
Constant-Depth and Subcubic-Size Threshold Circuits for Matrix Multiplication. 67-76 - Amir Gholami, Ariful Azad, Peter H. Jin, Kurt Keutzer, Aydin Buluç:
Integrated Model, Batch, and Domain Parallelism in Training Neural Networks. 77-86 - Marco Bressan, Enoch Peserico, Luca Pretto:
Brief Announcement: On Approximating PageRank Locally with Sublinear Query Complexity. 87-89 - Ink Chinavinijkul, Jacob Newcomb, Lingzhi Xi, David P. Bunde:
Brief Announcement: Coloring-based Task Mapping for Dragonfly Systems. 91-93 - Alvaro Velasquez, Sumit Kumar Jha:
Brief Announcement: Parallel Transitive Closure Within 3D Crosspoint Memory. 95-98
Session 3
- Gal Milman, Alex Kogan, Yossi Lev, Victor Luchangco, Erez Petrank:
BQ: A Lock-Free Queue with Batching. 99-109 - Panagiota Fatourou, Nikolaos D. Kallimanis, Thomas Ropars:
An Efficient Wait-free Resizable Hash Table. 111-120 - Kjell Winblad, Konstantinos Sagonas, Bengt Jonsson:
Lock-free Contention Adapting Search Trees. 121-132 - Dan Alistarh, Trevor Brown, Justin Kopinsky, Jerry Zheng Li, Giorgi Nadiradze:
Distributionally Linearizable Data Structures. 133-142
Session 4
- Saeed Akhoondian Amiri, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz:
Distributed Domination on Graph Classes of Bounded Expansion. 143-151 - Orr Fischer, Tzlil Gonen, Fabian Kuhn, Rotem Oshman:
Possibilities and Impossibilities for Distributed Subgraph Detection. 153-162 - Janne H. Korhonen, Jukka Suomela:
Towards a Complexity Theory for the Congested Clique. 163-172 - Peter Robinson, Christian Scheideler, Alexander Setzer:
Breaking the $ilde$Omega($sqrt{n})$ Barrier: Fast Consensus under a Late Adversary. 173-182 - Simon Collet, Amos Korman:
Intense Competition can Drive Selfish Explorers to Optimize Coverage. 183-192
Keynote Address
- David A. Bader:
Massive-scale Streaming Analytics: Models, Parallelism, & Real-world Applications. 193
Session 5
- Erik D. Demaine, Quanquan C. Liu:
Red-Blue Pebble Game: Complexity of Computing the Trade-Off between Cache Size and Memory Transfers. 195-204 - Guy Even, Moti Medina, Dror Rawitz:
Online Generalized Caching with Varying Weights and Costs. 205-212 - Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, Helen Xu:
Cache-Adaptive Exploration: Experimental Results and Scan-Hiding for Adaptivity. 213-222 - Leonid Barenboim, Yaniv Tzur:
Brief Announcement: Distributed Symmetry-Breaking with Improved Vertex-Averaged Complexity. 223-226 - Ellis Giles, Kshitij A. Doshi, Peter J. Varman:
Brief Announcement: Hardware Transactional Persistent Memory. 227-230 - Daniel Jung, Christina Kolb, Christian Scheideler, Jannik Sundermeier:
Brief Announcement: Competitive Routing in Hybrid Communication Networks. 231-233
Session 6
- Guy E. Blelloch, Yan Gu, Julian Shun, Yihan Sun:
Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry. 235-246 - Guy E. Blelloch, Phillip B. Gibbons, Yan Gu, Charles McGuffey, Julian Shun:
The Parallel Persistent Memory Model. 247-258 - Nachshon Cohen, Rachid Guerraoui, Igor Zablotchi:
The Inherent Cost of Remembering Consistently. 259-269 - Andreia Correia, Pascal Felber, Pedro Ramalhete:
Romulus: Efficient Algorithms for Persistent Transactional Memory. 271-282
Session 7
- Nikhil R. Devanur, Janardhan Kulkarni:
A Unified Rounding Algorithm For Unrelated Machines Scheduling Problems. 283-290 - Giorgio Lucarelli, Benjamin Moseley, Kim Thang Nguyen, Abhinav Srivastav, Denis Trystram:
Online Non-preemptive Scheduling on Unrelated Machines with Rejections. 291-300 - Noga Alon, Yossi Azar, Mark Berlin:
The Price of Bounded Preemption. 301-310 - Ori Rottenstreich, Yossi Kanizo, Haim Kaplan, Jennifer Rexford:
Accurate Traffic Splitting on Commodity Switches. 311-320
Session 8
- Kunal Agrawal, Seth Gilbert, Wei Quan Lim:
Parallel Working-Set Search Structures. 321-332 - Tsvi Kopelowitz, Ely Porat, Yair Rosenmutter:
Improved Worst-Case Deterministic Parallel Dynamic Minimum Spanning Forest. 333-341 - Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
Brief Announcement: Approximation Algorithms for Preemptive Resource Allocation. 343-345 - Saurabh Kumar, Samir Khuller:
Brief Announcement: A Greedy 2 Approximation for the Active Time Problem. 347-349 - Tao B. Schardl, I-Ting Angelina Lee, Charles E. Leiserson:
Brief Announcement: Open Cilk. 351-353 - Manuel Pöter, Jesper Larsson Träff:
Brief Announcement: Stamp-it, a more Thread-efficient, Concurrent Memory Reclamation Scheme in the C++ Memory Model. 355-358 - Friedhelm Meyer auf der Heide, Johannes Schaefer:
Brief Announcement: Communication in Systems of Home Based Mobile Agents. 359-361
Session 9
- Susanne Albers, Jens Quedenfeld:
Optimal Algorithms for Right-Sizing Data Centers. 363-372 - Björn Feldkord, Friedhelm Meyer auf der Heide:
Online Facility Location with Mobile Facilities. 373-381 - Dan Alistarh, Syed Kamran Haider, Raphael Kübler, Giorgi Nadiradze:
The Transactional Conflict Problem. 383-392
Session 10
- Laxman Dhulipala, Guy E. Blelloch, Julian Shun:
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. 393-404 - Gopal Pandurangan, Peter Robinson, Michele Scquizzato:
On the Distributed Complexity of Large-Scale Graph Computations. 405-414 - Predrag Gruevski, William Hasenplaugh, David Lugato, James Thomas:
Laika: Efficient In-Place Scheduling for 3D Mesh Graph Computations. 415-426
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-01-15 23:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
