- MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Vahid Liaghat:
On a local protocol for concurrent file transfers. SPAA 2011: 269-278 - Martin Hoefer, Thomas Kesselheim, Berthold Vöcking:
Approximation algorithms for secondary spectrum auctions. SPAA 2011: 177-186 - Mark C. Jeffrey
, J. Gregory Steffan:
Understanding bloom filter intersection for lazy address-set disambiguation. SPAA 2011: 345-354 - Youngjoon Jo, Milind Kulkarni:
Brief announcement: locality-enhancing loop transformations for tree traversal algorithms. SPAA 2011: 263-264 - Peter Kling, Friedhelm Meyer auf der Heide:
Convergence of local communication chain strategies via linear transformations: or how to trade locality for speed. SPAA 2011: 159-166 - Sebastian Kniesburges, Andreas Koutsopoulos, Christian Scheideler:
Re-Chord: a self-stabilizing chord overlay network. SPAA 2011: 235-244 - Edya Ladan-Mozes, I-Ting Angelina Lee, Dmitry Vyukov:
Location-based memory fences. SPAA 2011: 75-84 - Silvio Lattanzi, Benjamin Moseley, Siddharth Suri, Sergei Vassilvitskii:
Filtering: a method for solving graph problems in MapReduce. SPAA 2011: 85-94 - Lei Li, Tianshi Chen, Yunji Chen, Ling Li, Cheng Qian, Weiwu Hu:
Brief announcement: program regularization in verifying memory consistency. SPAA 2011: 265-266 - 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. SPAA 2011: 253-256 - Thomas Locher:
Finding heavy distinct hitters in data streams. SPAA 2011: 299-308 - Alejandro López-Ortiz, Alejandro Salinger:
Brief announcement: paging for multicore processors. SPAA 2011: 137-138 - Benjamin Moseley, Anirban Dasgupta, Ravi Kumar, Tamás Sarlós:
On scheduling in map-reduce and flow-shops. SPAA 2011: 289-298 - Victor Pankratius, Ali-Reza Adl-Tabatabai:
A study of transactional memory vs. locks in practice. SPAA 2011: 43-52 - Torvald Riegel, Patrick Marlier, Martin Nowack, Pascal Felber, Christof Fetzer:
Optimizing hybrid transactional memory: the importance of nonspeculative operations. SPAA 2011: 53-64 - Michael Sindelar, Ramesh K. Sitaraman, Prashant J. Shenoy:
Sharing-aware algorithms for virtual machine colocation. SPAA 2011: 367-378 - Håkan Sundell, Anders Gidenstam, Marina Papatriantafilou, Philippas Tsigas:
A lock-free algorithm for concurrent bags. SPAA 2011: 335-344 - Yuan Tang, Rezaul Alam Chowdhury, Bradley C. Kuszmaul, Chi-Keung Luk, Charles E. Leiserson:
The pochoir stencil compiler. SPAA 2011: 117-128 - Francesco Versaci, Keshav Pingali:
Brief announcement: processor allocation for optimistic parallelization of irregular programs. SPAA 2011: 261-262 - Martin Wimmer, Jesper Larsson Träff:
Work-stealing for mixed-mode parallelism by deterministic team-building. SPAA 2011: 105-116 - 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 [contents]
