default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID28th SPAA 2016: Asilomar State Beach/Pacific Grove, CA, USA
- Christian Scheideler, Seth Gilbert:
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016. ACM 2016, ISBN 978-1-4503-4210-0
Parallel Algorithms
- Tim Roughgarden, Sergei Vassilvitskii, Joshua R. Wang:
Shuffles and Circuits: (On Lower Bounds for Modern Parallel Computation). 1-12 - Michael T. Goodrich
, Ahmed Eldawy:
Parallel Algorithms for Summing Floating-Point Numbers. 13-22 - Mingmou Liu, Xiaoyin Pan, Yitong Yin:
Randomized Approximate Nearest Neighbor Search with Limited Adaptivity. 23-33 - Anat Bremler-Barr, Yotam Harchol, David Hay, Yacov Hel-Or:
Encoding Short Ranges in TCAM Without Expansion: Efficient Algorithm and Applications. 35-46
Keynote Address
- Michael I. Jordan:
On Computational Thinking, Inferential Thinking and Data Science. 47
Scheduling Parallel Computation
- David Dinh, Harsha Vardhan Simhadri, Yuan Tang:
Extending the Nested Parallel Model to the Nested Dataflow Model with Provably Efficient Schedulers. 49-60 - Chaoran Yang, John M. Mellor-Crummey:
A Practical Solution to the Cactus Stack Problem. 61-70 - Stefan K. Muller, Umut A. Acar:
Latency-Hiding Work Stealing: Scheduling Interacting Parallel Computations with Work Stealing. 71-82 - Robert Utterback, Kunal Agrawal, Jeremy T. Fineman, I-Ting Angelina Lee:
Provably Good and Practically Efficient Parallel Race Detection for Fork-Join Programs. 83-94 - Rishi Surendran, Vivek Sarkar:
Brief Announcement: Dynamic Determinacy Race Detection for Task Parallelism with Futures. 95-97
Transactional Memory and Beyond
- Amin Mohtasham, João Pedro Barreto:
RUBIC: Online Parallelism Tuning for Co-located Transactional Memory Applications. 99-108 - Mohamed M. Saad, Roberto Palmieri, Ahmed Hassan, Binoy Ravindran:
Extending TM Primitives using Low Level Semantics. 109-120 - Trevor Brown, Alex Kogan, Yossi Lev, Victor Luchangco:
Investigating the Performance of Hardware Transactions on a Multi-Socket Machine. 121-132 - Alexander Spiegelman, Guy Golan-Gueta, Idit Keidar:
Brief Announcement: Transactional Data Structure Libraries. 133-134
Parallel Algorithms
- Michael A. Bender, Erik D. Demaine, Roozbeh Ebrahimi, Jeremy T. Fineman, Rob Johnson, Andrea Lincoln, Jayson Lynch, Samuel McCauley:
Cache-Adaptive Analysis. 135-144 - Naama Ben-David, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Charles McGuffey, Julian Shun:
Parallel Algorithms for Asymmetric Read-Write Costs. 145-156 - Joseph Izraelevitz, Hammurabi Mendes, Michael L. Scott:
Brief Announcement: Preserving Happens-before in Persistent Memory. 157-159 - Timothy Carpenter, Fabrice Rastello, P. Sadayappan, Anastasios Sidiropoulos:
Brief Announcement: Approximating the I/O Complexity of One-Shot Red-Blue Pebbling. 161-163
Scheduling
- Sungjin Im, Benjamin Moseley:
General Profit Scheduling and the Power of Migration on Heterogeneous Machines. 165-173 - Lin Chen, Nicole Megow, Kevin Schewior:
The Power of Migration in Online Machine Minimization. 175-184 - Sungjin Im, Janardhan Kulkarni:
Fair Online Scheduling for Selfish Jobs on Heterogeneous Machines. 185-194 - Kunal Agrawal, Jing Li, Kefu Lu, Benjamin Moseley:
Scheduling Parallelizable Jobs Online to Minimize the Maximum Flow Time. 195-205 - Sungjin Im, Maryam Shadloo:
Brief Announcement: A QPTAS for Non-preemptive Speed-scaling. 207-209
Keynote Address
- Nir Shavit:
A Multicore Path to Connectomics-on-Demand. 211
Scheduling and Resource Allocation
- Madhukar R. Korupolu, Rajmohan Rajaraman:
Robust and Probabilistic Failure-Aware Placement. 213-224 - Dmitriy Katz, Baruch Schieber, Hadas Shachnai:
Brief Announcement: Flexible Resource Allocation for Clouds and All-Optical Networks. 225-226 - Runtian Ren, Xueyan Tang:
Clairvoyant Dynamic Bin Packing for Job Scheduling with Minimum Server Usage Time. 227-237 - Samir Khuller, Manish Purohit:
Brief Announcement: Improved Approximation Algorithms for Scheduling Co-Flows. 239-240 - Kamal Al-Bawani, Matthias Englert, Matthias Westermann:
Online Packet Scheduling for CIOQ and Buffered Crossbar Switches. 241-250 - Chhaya Trehan, Hans Vandierendonck, Georgios Karakonstantis, Dimitrios S. Nikolopoulos:
Brief Announcement: Energy Optimization of Memory Intensive Parallel Workloads. 251-252
Parallel Algorithms
- Guy E. Blelloch, Daniel Ferizovic, Yihan Sun:
Just Join for Parallel Ordered Sets. 253-264 - William E. Devanny, Michael T. Goodrich, Kristopher Jetviroj:
Parallel Equivalence Class Sorting: Algorithms, Lower Bounds, and Distribution-Based Analysis. 265-274 - Saman Ashkiani, Nina Amenta, John D. Owens:
Parallel Approaches to the String Matching Problem on the GPU. 275-285 - Chao Wang, Xi Li, Aili Wang, Xuehai Zhou:
Brief Announcement: MIC++: Accelerating Maximal Information Coefficient Calculation with GPUs and FPGAs. 287-288
Robots, Amoebots, and Cobras (Oh my!)
- Zahra Derakhshandeh, Robert Gmyr, Andréa W. Richa, Christian Scheideler, Thim Strothmann:
Universal Shape Formation for Programmable Matter. 289-299 - Andreas Cord-Landwehr, Matthias Fischer, Daniel Jung, Friedhelm Meyer auf der Heide:
Asymptotically Optimal Gathering on a Grid. 301-312 - Michael Mitzenmacher, Rajmohan Rajaraman, Scott T. Roche:
Better Bounds for Coalescing-Branching Random Walks. 313-323
Concurrent Data Structures
- Deli Zhang, Damian Dechev:
Lock-free Transactions without Rollbacks for Linked Data Structures. 325-336 - Tudor David, Rachid Guerraoui:
Concurrent Search Data Structures Can Be Blocking and Practically Wait-Free. 337-348 - Oana Balmau, Rachid Guerraoui, Maurice Herlihy, Igor Zablotchi:
Fast and Robust Memory Reclamation for Concurrent Data Structures. 349-359 - Jakob Gruber, Jesper Larsson Träff, Martin Wimmer:
Brief Announcement: Benchmarking Concurrent Priority Queues. 361-362 - William Kuszmaul:
Brief Announcement: Fast Concurrent Cuckoo Kick-Out Eviction Schemes for High-Density Tables. 363-365
Graph Algorithms
- Amihood Amir, Oren Kapah, Tsvi Kopelowitz, Moni Naor, Ely Porat:
The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets. 367-375 - Avery Miller, Andrzej Pelc:
Election vs. Selection: How Much Advice is Needed to Find the Largest Node in a Graph? 377-386 - Mohsen Ghaffari, Merav Parter:
Near-Optimal Distributed Algorithms for Fault-Tolerant Tree Structures. 387-396 - Hossein Esfandiari, MohammadTaghi Hajiaghayi, David P. Woodruff:
Brief Announcement: Applications of Uniform Sampling: Densest Subgraph and Beyond. 397-399 - Zhuolun Xiang, Nitin H. Vaidya:
Brief Announcement: Relaxed Byzantine Vector Consensus. 401-403
Distributed Algorithms
- Haifeng Yu, Yuda Zhao, Irvan Jahja:
The Cost of Unknown Diameter in Dynamic Networks. 405-416 - Maximilian Drees, Robert Gmyr, Christian Scheideler:
Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration. 417-427 - Gopal Pandurangan, Peter Robinson, Michele Scquizzato:
Fast Distributed Algorithms for Connectivity and MST in Large Graphs. 429-438 - Qiang-Sheng Hua, Haoqiang Fan, Lixiang Qian, Ming Ai, Yangyang Li, Xuanhua Shi, Hai Jin:
Brief Announcement: A Tight Distributed Algorithm for All Pairs Shortest Paths and Applications. 439-441
Parallel Graph Algorithms
- Guy E. Blelloch, Yan Gu, Yihan Sun, Kanat Tangwongsan:
Parallel Shortest Paths Using Radius Stepping. 443-454 - Stephan Friedrichs, Christoph Lenzen:
Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-Ford. 455-466 - Guy E. Blelloch, Yan Gu, Julian Shun, Yihan Sun:
Parallelism in Randomized Incremental Algorithms. 467-478
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-06-09 22:37 CEST 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:
