23. SPAA 2011:
San Jose,
CA,
USA
Rajmohan Rajaraman, Friedhelm Meyer auf der Heide (Eds.):
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
Parallel computing
Brief announcements I
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
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
Brief announcements III
Concurrency control
Cache hierarchies and memory sharing
Last update Fri May 25 08:41:11 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
