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