default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID23rd SPAA 2011: San Jose, CA, USA
- Rajmohan Rajaraman, Friedhelm Meyer auf der Heide:
SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located with FCRC 2011). ACM 2011, ISBN 978-1-4503-0743-7
Parallel algorithms
- Grey Ballard
, James Demmel, Olga Holtz, Oded Schwartz:
Graph expansion and communication costs of fast matrix multiplication: regular submission. 1-12 - Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, Kanat Tangwongsan:
Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs. 13-22 - Guy E. Blelloch, Richard Peng, Kanat Tangwongsan:
Linear-work greedy parallel approximate set cover and variants. 23-32 - Umut A. Acar, Andrew Cotter, Benoît Hudson, Duru Türkoglu:
Parallelism in dynamic well-spaced point sets. 33-42
Transactional memory and locks
- Victor Pankratius, Ali-Reza Adl-Tabatabai:
A study of transactional memory vs. locks in practice. 43-52 - Torvald Riegel, Patrick Marlier, Martin Nowack, Pascal Felber, Christof Fetzer:
Optimizing hybrid transactional memory: the importance of nonspeculative operations. 53-64 - David Dice, Virendra J. Marathe, Nir Shavit:
Flat-combining NUMA locks. 65-74 - Edya Ladan-Mozes, I-Ting Angelina Lee, Dmitry Vyukov:
Location-based memory fences. 75-84
Parallel computing
- Silvio Lattanzi, Benjamin Moseley, Siddharth Suri, Sergei Vassilvitskii:
Filtering: a method for solving graph problems in MapReduce. 85-94 - Victoria Caparrós Cabezas, Phillip Stanley-Marbell:
Parallelism and data movement characterization of contemporary application classes. 95-104 - Martin Wimmer, Jesper Larsson Träff:
Work-stealing for mixed-mode parallelism by deterministic team-building. 105-116 - Yuan Tang, Rezaul Alam Chowdhury, Bradley C. Kuszmaul, Chi-Keung Luk, Charles E. Leiserson:
The pochoir stencil compiler. 117-128
Brief announcements I
- Bernadette Charron-Bost, Matthias Függer, Jennifer L. Welch, Josef Widder:
Brief announcement: full reversal routing as a linear dynamical system. 129-130 - George Constantin Caragea, Uzi Vishkin:
Brief announcement: better speedups for parallel max-flow. 131-134 - Guillaume Aupy, Anne Benoit, Fanny Dufossé, Yves Robert:
Brief announcement: reclaiming the energy of a schedule, models and algorithms. 135-136 - Alejandro López-Ortiz, Alejandro Salinger:
Brief announcement: paging for multicore processors. 137-138
Coordination algorithms
- Bastian Degener, Barbara Kempkes, Tobias Langner, Friedhelm Meyer auf der Heide, Peter Pietrzyk, Roger Wattenhofer:
A tight runtime bound for synchronous gathering of autonomous robots with limited visibility. 139-148 - Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler:
Stabilizing consensus with the power of two choices. 149-158 - Peter Kling, Friedhelm Meyer auf der Heide:
Convergence of local communication chain strategies via linear transformations: or how to trade locality for speed. 159-166 - Patrick Briest, Christoph Raupach:
The car sharing problem. 167-176
Games and approximation algorithms
- Martin Hoefer, Thomas Kesselheim, Berthold Vöcking:
Approximation algorithms for secondary spectrum auctions. 177-186 - Thomas Erlebach, Tom Grant, Frank Kammer:
Maximising lifetime for fault-tolerant target coverage in sensor networks. 187-196 - Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano:
Convergence to equilibrium of logit dynamics for strategic games. 197-206 - Shayan Ehsani, MohammadAmin Fazli, Abbas Mehrabian, Sina Sadeghian Sadeghabad, MohammadAli Safari, Morteza Saghafian, Saber ShokatFadaee:
On a bounded budget network creation game. 207-214
Network and P2P algorithms
- Guy Even, Moti Medina:
Online packet-routing in grids with bounded buffers. 215-224 - Cyril Gavoille, Christian Sommer:
Sparse spanners vs. compact routing. 225-234 - Sebastian Kniesburges, Andreas Koutsopoulos, Christian Scheideler:
Re-Chord: a self-stabilizing chord overlay network. 235-244 - Yossi Azar, Aviv Nisgav, Boaz Patt-Shamir:
Recommender systems with non-binary grades. 245-252
Brief announcements II
- Mieszko Lis, Keun Sup Shim, Myong Hyon Cho, Christopher W. Fletcher, Michel A. Kinsy, Ilia A. Lebedev, Omer Khan, Srinivas Devadas:
Brief announcement: distributed shared memory based on computation migration. 253-256 - Grey Ballard, James Demmel, Andrew Gearhart:
Brief announcement: communication bounds for heterogeneous architectures. 257-258 - Michael T. Goodrich, Michael Mitzenmacher:
Brief announcement: large-scale multimaps. 259-260 - Francesco Versaci, Keshav Pingali:
Brief announcement: processor allocation for optimistic parallelization of irregular programs. 261-262 - Youngjoon Jo, Milind Kulkarni:
Brief announcement: locality-enhancing loop transformations for tree traversal algorithms. 263-264 - Lei Li, Tianshi Chen, Yunji Chen, Ling Li, Cheng Qian, Weiwu Hu:
Brief announcement: program regularization in verifying memory consistency. 265-266 - Hrishikesh B. Acharya, Mohamed G. Gouda:
Brief announcement: RedRem: a parallel redundancy remover. 267-268
Scheduling and network communication
- MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Vahid Liaghat:
On a local protocol for concurrent file transfers. 269-278 - Susanne Albers, Antonios Antoniadis, Gero Greiner:
On multi-processor speed scaling with migration: extended abstract. 279-288 - Benjamin Moseley, Anirban Dasgupta, Ravi Kumar, Tamás Sarlós:
On scheduling in map-reduce and flow-shops. 289-298 - Thomas Locher:
Finding heavy distinct hitters in data streams. 299-308
Brief announcements III
- David Dice:
Brief announcement: a partitioned ticket lock. 309-310 - Vincent Gramoli, Rachid Guerraoui:
Brief announcement: transaction polymorphism. 311-312 - David Dice, Oleksandr Otenko:
Brief announcement: multilane - a concurrent blocking multiset. 313-314 - Tyler Crain, Damien Imbs, Michel Raynal:
Brief announcement: read invisibility, virtual world consistency and permissiveness are compatible. 315-316
Concurrency control
- James Aspnes, Faith Ellen:
Tight bounds for anonymous adopt-commit objects. 317-324 - Panagiota Fatourou, Nikolaos D. Kallimanis:
A highly-efficient wait-free universal construction. 325-334 - Håkan Sundell, Anders Gidenstam, Marina Papatriantafilou, Philippas Tsigas:
A lock-free algorithm for concurrent bags. 335-344 - Mark C. Jeffrey, J. Gregory Steffan:
Understanding bloom filter intersection for lazy address-set disambiguation. 345-354
Cache hierarchies and memory sharing
- Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Harsha Vardhan Simhadri:
Scheduling irregular parallel computations on hierarchical caches. 355-366 - Michael Sindelar, Ramesh K. Sitaraman, Prashant J. Shenoy:
Sharing-aware algorithms for virtual machine colocation. 367-378 - Michael T. Goodrich:
Data-oblivious external-memory algorithms for the compaction, selection, and sorting of outsourced data. 379-388
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 2025-12-02 23:30 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:
