| 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: program regularization in verifying memory consistency. | Lei Li, Tianshi Chen, Yunji Chen, Ling Li, Cheng Qian, Weiwu Hu |
| 2011 | Filtering: a method for solving graph problems in MapReduce. | Silvio Lattanzi, Benjamin Moseley, Siddharth Suri, Sergei Vassilvitskii |
| 2011 | Location-based memory fences. | Edya Ladan-Mozes, I-Ting Angelina Lee, Dmitry Vyukov |
| 2011 | Re-Chord: a self-stabilizing chord overlay network. | Sebastian Kniesburges, Andreas Koutsopoulos, Christian Scheideler |
| 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 | Brief announcement: locality-enhancing loop transformations for tree traversal algorithms. | Youngjoon Jo, Milind Kulkarni |
| 2011 | Understanding bloom filter intersection for lazy address-set disambiguation. | Mark C. Jeffrey, J. Gregory Steffan |
| 2011 | Approximation algorithms for secondary spectrum auctions. | Martin Hoefer, Thomas Kesselheim, Berthold Vcking |
| 2011 | On a local protocol for concurrent file transfers. | MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Vahid Liaghat |
| 2011 | Brief announcement: transaction polymorphism. | Vincent Gramoli, Rachid Guerraoui |
| 2011 | Brief announcement: large-scale multimaps. | Michael T. Goodrich, Michael Mitzenmacher |
| 2011 | Data-oblivious external-memory algorithms for the compaction, selection, and sorting of outsourced data. | Michael T. Goodrich |
| 2011 | Sparse spanners vs. compact routing. | Cyril Gavoille, Christian Sommer |
| 2011 | A highly-efficient wait-free universal construction. | Panagiota Fatourou, Nikolaos D. Kallimanis |
| 2011 | Online packet-routing in grids with bounded buffers. | Guy Even, Moti Medina |
| 2011 | Maximising lifetime for fault-tolerant target coverage in sensor networks. | Thomas Erlebach, Tom Grant, Frank Kammer |
| 2011 | On a bounded budget network creation game. | Shayan Ehsani, MohammadAmin Fazli, Abbas Mehrabian, Sina Sadeghian Sadeghabad, MohammadAli Safari, Morteza Saghafian, Saber ShokatFadaee |
| 2011 | Stabilizing consensus with the power of two choices. | Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler |
| 2011 | Brief announcement: multilane - a concurrent blocking multiset. | David Dice, Oleksandr Otenko |
| 2011 | Flat-combining NUMA locks. | David Dice, Virendra J. Marathe, Nir Shavit |
| 2011 | Brief announcement: a partitioned ticket lock. | David Dice |
| 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 | Brief announcement: read invisibility, virtual world consistency and permissiveness are compatible. | Tyler Crain, Damien Imbs, Michel Raynal |
| 2011 | Brief announcement: full reversal routing as a linear dynamical system. | Bernadette Charron-Bost, Matthias Fgger, Jennifer L. Welch, Josef Widder |