Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID29th SPAA 2017: Washington, DC, USA
- Christian Scheideler, Mohammad Taghi Hajiaghayi:
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017. ACM 2017, ISBN 978-1-4503-4593-4
Keynote Lecture 1
- Piotr Indyk:
Beyond P vs. NP: Quadratic-Time Hardness for Big Data Problems. 1
Session 1
- Sepehr Assadi, Sanjeev Khanna:
Randomized Composable Coresets for Matching and Vertex Cover. 3-12 - MohammadHossein Bateni, Hossein Esfandiari, Vahab S. Mirrokni:
Almost Optimal Streaming Algorithms for Coverage Problems. 13-23 - Alessandro Epasto
, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Bicriteria Distributed Submodular Maximization in a Few Rounds. 25-33 - Susanne Albers:
On Energy Conservation in Data Centers. 35-44
Session 2
- Hamidreza Jahanjou, Erez Kantor, Rajmohan Rajaraman:
Asymptotically Optimal Approximation Algorithms for Coflow Scheduling. 45-54 - Runtian Ren, Xueyan Tang:
Online Flexible Job Scheduling for Minimum Span. 55-66 - Vincent Chau, Minming Li, Samuel McCauley, Kai Wang:
Minimizing Total Weighted Flow Time with Calibrations. 67-76 - Yossi Azar, Danny Vainstein:
Tight Bounds for Clairvoyant Dynamic Bin Packing. 77-86 - Kunal Agrawal, Jing Li, Kefu Lu, Benjamin Moseley:
Brief Announcement: Scheduling Parallelizable Jobs Online to Maximize Throughput. 87-89 - Mehrnoosh Shafiee, Javad Ghaderi:
Brief Announcement: A New Improved Bound for Coflow Scheduling. 91-93
Session 3
- Jason Li, Ryan O'Donnell:
Bounding Laconic Proof Systems by Solving CSPs in Parallel. 95-100 - Elaye Karstadt, Oded Schwartz:
Matrix Multiplication, a Little Faster. 101-110 - Edgar Solomonik, Grey Ballard, James Demmel, Torsten Hoefler:
A Communication-Avoiding Parallel Algorithm for the Symmetric Eigenvalue Problem. 111-121 - Peter Kling, Alexander Mäcker, Sören Riechers, Alexander Skopalik:
Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource. 123-132 - Soheil Behnezhad, Mahsa Derakhshan, Hossein Esfandiari, Elif Tan, Hadi Yami:
Brief Announcement: Graph Matching in Massive Datasets. 133-136 - David Eppstein, Michael T. Goodrich:
Brief Announcement: Using Multi-Level Parallelism and 2-3 Cuckoo Filters for Set Intersection Queries and Sparse Boolean Matrix Multiplication. 137-139
Keynote LECTURE 2
- Guy E. Blelloch:
Some Sequential Algorithms are Almost Always Parallel. 141
Session 4
- Sudipto Guha, Yi Li, Qin Zhang:
Distributed Partial Clustering. 143-152 - Pierre Fraigniaud, Dennis Olivetti:
Distributed Detection of Cycles. 153-162 - He Sun, Luca Zanetti:
Distributed Graph Clustering by Load Balancing. 163-171 - Costas Busch, Maurice Herlihy, Miroslav Popovic, Gokarna Sharma:
Fast Scheduling in Distributed Transactional Memory. 173-182
Session 5
- William C. Anderton, Maxwell Young:
Is Our Model for Contention Resolution Wrong?: Confronting the Cost of Collisions. 183-194 - Tim Kaler, Yuxiong He, Sameh Elnikety:
Optimal Reissue Policies for Reducing Tail Latency. 195-206 - Yoann Dieudonné, Andrzej Pelc:
Impact of Knowledge on Election Time in Anonymous Networks. 207-215 - Haoyu Wang, Haiying Shen, Guoxin Liu:
Swarm-based Incast Congestion Control in Datacenters Serving Web Applications. 217-226 - Antje Bjelde, Max Klimm, Daniel Schmand:
Brief Announcement: Approximation Algorithms for Unsplittable Resource Allocation Problems with Diseconomies of Scale. 227-229 - Chuanyou Li, Xueyan Tang:
Brief Announcement: Towards Fault-Tolerant Bin Packing for Online Cloud Resource Allocation. 231-233
Session 6
- Zhiyu Liu, Irina Calciu, Maurice Herlihy, Onur Mutlu:
Concurrent Data Structures for Near-Memory Computing. 235-245 - Riko Jacob, Nodari Sitchinava:
Lower Bounds in the Asymmetric External Memory Model. 247-254 - Tingzhe Zhou, Victor Luchangco, Michael F. Spear:
Hand-Over-Hand Transactions with Precise Memory Reclamation. 255-264 - Stefan Dobrev, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny:
Optimal Local Buffer Management for Information Gathering with Adversarial Traffic. 265-274 - Umut A. Acar, Vitaly Aksenov, Sam Westrick:
Brief Announcement: Parallel Dynamic Tree Contraction via Self-Adjusting Computation. 275-277 - Yuan Tang, Shiyi Wang:
Brief Announcement: STAR (Space-Time Adaptive and Reductive) Algorithms for Dynamic Programming Recurrences with more than O(1) Dependency. 279-281
Session 7
- Shahbaz Khan:
Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs. 283-292 - Laxman Dhulipala, Guy E. Blelloch, Julian Shun:
Julienne: A Framework for Parallel Graph Algorithms using Work-efficient Bucketing. 293-304 - Colin Cooper, Tomasz Radzik, Nicolas Rivera:
Improved Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs. 305-312 - Björn Feldkord, Friedhelm Meyer auf der Heide:
The Mobile Server Problem. 313-319 - Tobias Friedrich, Sven Ihde, Christoph Keßler, Pascal Lenzner, Stefan Neubert, David Schumann:
Brief Announcement: Efficient Best Response Computation for Strategic Network Formation under Attack. 321-323 - Gokarna Sharma, Costas Busch, Supratik Mukhopadhyay:
Brief Announcement: Complete Visibility for Oblivious Robots in Linear Time. 325-327
Session 8
- Marcin Bienkowski, Jan Marcinkowski, Maciej Pacut, Stefan Schmid, Aleksandra Spyra:
Online Tree Caching. 329-338 - Rezaul Chowdhury, Pramod Ganapathi, Yuan Tang, Jesmin Jahan Tithi:
Provably Efficient Scheduling of Cache-oblivious Wavefront Algorithms. 339-350 - Richard Cole, Vijaya Ramachandran:
Bounding Cache Miss Costs of Multithreaded Computations Under General Schedulers: Extended Abstract. 351-362 - Rohit Atre, Ali Jannesari, Felix Wolf:
Brief Announcement: Meeting the Challenges of Parallelizing Sequential Programs. 363-365 - Pedro Ramalhete, Andreia Correia:
Brief Announcement: Hazard Eras - Non-Blocking Memory Reclamation. 367-369 - Tingzhe Zhou, Victor Luchangco, Michael F. Spear:
Brief Announcement: Extending Transactional Memory with Atomic Deferral. 371-373 - Ellis Giles, Kshitij A. Doshi, Peter J. Varman:
Brief Announcement: Hardware Transactional Storage Class Memory. 375-378
a service of 
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 2024-05-15 21:47 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:
