| 2011 | A complexity separation between the cache-coherent and distributed shared memory models. Wojciech M. Golab |
| 2011 | A generalization of multiple choice balls-into-bins. GaHyun Park |
| 2011 | A nonblocking set optimized for querying the minimum value. Yujie Liu, Michael F. Spear |
| 2011 | A theory of goal-oriented communication. Oded Goldreich, Brendan Juba, Madhu Sudan |
| 2011 | A tight unconditional lower bound on distributed randomwalk computation. Danupon Nanongkai, Atish Das Sarma, Gopal Pandurangan |
| 2011 | Accurate byzantine agreement with feedback. Vijay K. Garg, John Bridgman, Bharath Balasubramanian |
| 2011 | Adaptively secure broadcast, revisited. Juan A. Garay, Jonathan Katz, Ranjit Kumaresan, Hong-Sheng Zhou |
| 2011 | Analyzing consistency properties for fun and profit. Wojciech M. Golab, Xiaozhou Li, Mehul A. Shah |
| 2011 | B-neck: a distributed and quiescent max-min fair algorithm. Alberto Mozo, José Luis López-Presa, Antonio Fernández Anta |
| 2011 | Byzantine agreement with homonyms. Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Anne-Marie Kermarrec, Eric Ruppert, Hung Tran-The |
| 2011 | Compact policy routing. Gábor Rétvári, András Gulyás, Zalán Heszberger, Márton Csernai, József Bíró |
| 2011 | Conflict on a communication channel. Valerie King, Jared Saia, Maxwell Young |
| 2011 | Coordinated consensus in dynamic networks. Fabian Kuhn, Yoram Moses, Rotem Oshman |
| 2011 | Distributed computing with rules of thumb. Aaron D. Jaggard, Michael Schapira, Rebecca N. Wright |
| 2011 | Distributed deterministic edge coloring using bounded neighborhood independence. Leonid Barenboim, Michael Elkin |
| 2011 | Distributed graph coloring in a few rounds. Kishore Kothapalli, Sriram V. Pemmaraju |
| 2011 | Distributed k-core decomposition. Alberto Montresor, Francesco De Pellegrini, Daniele Miorandi |
| 2011 | Easy impossibility proofs for k-set agreement in message passing systems. Martin Biely, Peter Robinson, Ulrich Schmid |
| 2011 | Error-free multi-valued consensus with byzantine failures. Guanfeng Liang, Nitin H. Vaidya |
| 2011 | Fast and compact self stabilizing verification, computation, and fault detection of an MST. Amos Korman, Shay Kutten, Toshimitsu Masuzawa |
| 2011 | Faster information dissemination in dynamic networks via network coding. Bernhard Haeupler, David R. Karger |
| 2011 | Fault-tolerant spanners: better and simpler. Michael Dinitz, Robert Krauthgamer |
| 2011 | Fork-consistent constructions from registers. Matthias Majuntke, Dan Dobre, Neeraj Suri |
| 2011 | From bounded to unbounded concurrency objects and back. Yehuda Afek, Adam Morrison, Guy Wertheim |
| 2011 | Incentive-compatible distributed greedy protocols. Noam Nisan, Michael Schapira, Gregory Valiant, Aviv Zohar |
| 2011 | Information dissemination on multiple channels. Stephan Holzer, Yvonne-Anne Pignolet, Jasmin Smula, Roger Wattenhofer |
| 2011 | Locally checkable proofs. Mika Göös, Jukka Suomela |
| 2011 | MIS on trees. Christoph Lenzen, Roger Wattenhofer |
| 2011 | Minimum congestion mapping in a cloud. Nikhil Bansal, Kang-Won Lee, Viswanath Nagarajan, Murtaza Zafer |
| 2011 | Network synchronization and localization based on stolen signals. Christian Schindelhauer, Zvi Lotker, Johannes Wendeberg |
| 2011 | On the hardness and approximation of minimum topic-connected overlay. Monika Steinová |
| 2011 | On the power of hardware transactional memory to simplify memory management. Aleksandar Dragojevic, Maurice Herlihy, Yossi Lev, Mark Moir |
| 2011 | Optimal-time adaptive strong renaming, with applications to counting. Dan Alistarh, James Aspnes, Keren Censor-Hillel, Seth Gilbert, Morteza Zadimoghaddam |
| 2011 | Order optimal information spreading using algebraic gossip. Chen Avin, Michael Borokhovich, Keren Censor-Hillel, Zvi Lotker |
| 2011 | Parallel and distributed programming extensions for mainstream languages based on pi-calculus. Patrick Viry |
| 2011 | Partial reversal acyclicity. Tsvetomira Radeva, Nancy A. Lynch |
| 2011 | Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, PODC 2011, San Jose, CA, USA, June 6-8, 2011 Cyril Gavoille, Pierre Fraigniaud |
| 2011 | Randomized compact routing in decomposable metrics. Goran Konjevod, Andréa W. Richa, Donglin Xia, Ling Zhou |
| 2011 | Rationality authority for provable rational behavior. Shlomi Dolev, Panagiota N. Panagopoulou, Mikaël Rabie, Elad Michael Schiller, Paul G. Spirakis |
| 2011 | Reliable end-user communication under a changing packet network protocol. Brendan Juba |
| 2011 | Resilience of mutual exclusion algorithms to transient memory faults. Thomas Moscibroda, Rotem Oshman |
| 2011 | Robust data sharing with key-value stores. Cristina Basescu, Christian Cachin, Ittay Eyal, Robert Haas, Marko Vukolic |
| 2011 | Robust network supercomputing without centralized control. Seda Davtyan, Kishori M. Konwar, Alexander A. Shvartsman |
| 2011 | Scalability versus semantics of concurrent FIFO queues. Hannes Payer, Harald Röck, Christoph M. Kirsch, Ana Sokolova |
| 2011 | Scalable rational secret sharing. Varsha Dani, Mahnush Movahedi, Yamel Rodriguez, Jared Saia |
| 2011 | Secure data structures based on multi-party computation. Tomas Toft |
| 2011 | Securing social networks. Michael Backes, Matteo Maffei, Kim Pecina |
| 2011 | Solving the at-most-once problem with nearly optimal effectiveness. Sotiris Kentros, Aggelos Kiayias |
| 2011 | Stability of a peer-to-peer communication system. Ji Zhu, Bruce E. Hajek |
| 2011 | Structuring unreliable radio networks. Keren Censor-Hillel, Seth Gilbert, Fabian Kuhn, Nancy A. Lynch, Calvin C. Newport |
| 2011 | Sustaining collaboration in multicast despite rational collusion. Haifeng Yu, Phillip B. Gibbons, Chenwei Shi |
| 2011 | The complexity of robust atomic storage. Dan Dobre, Rachid Guerraoui, Matthias Majuntke, Neeraj Suri, Marko Vukolic |
| 2011 | The impact of memory models on software reliability in multiprocessors. Alexander Jaffe, Thomas Moscibroda, Laura Effinger-Dean, Luis Ceze, Karin Strauss |
| 2011 | The inherent difficulty of timely primary-backup replication. Pramod V. Koppol, Kedar S. Namjoshi, Thanos Stathopoulos, Gordon T. Wilfong |
| 2011 | The round complexity of distributed sorting: extended abstract. Boaz Patt-Shamir, Marat Teplitsky |
| 2011 | The space complexity of long-lived and one-shot timestamp implementations. Maryam Helmi, Lisa Higham, Eduardo Pacheco, Philipp Woelfel |
| 2011 | The universe of symmetry breaking tasks. Damien Imbs, Sergio Rajsbaum, Michel Raynal |
| 2011 | Tight bounds on information dissemination in sparse mobile networks. Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci, Eli Upfal |
| 2011 | Time bounds for shared objects in partially synchronous systems. Jiaqi Wang, Jennifer L. Welch, Hyunyoung Lee |
| 2011 | Time-efficient randomized multiple-message broadcast in radio networks. Majid Khabbazian, Dariusz R. Kowalski |
| 2011 | Toward more localized local algorithms: removing assumptions concerning global knowledge. Amos Korman, Jean-Sébastien Sereni, Laurent Viennot |
| 2011 | Tracking distributed aggregates over time-based sliding windows. Graham Cormode, Ke Yi |
| 2011 | Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions. Maurice Herlihy, Yoram Moses, Mark R. Tuttle |
| 2011 | Unbounded contention resolution in multiple-access channels. Miguel A. Mosteiro, Antonio Fernández Anta, Jorge Ramón Muñoz |
| 2011 | Validity bound of regular registers with churn and byzantine processes. Roberto Baldoni, Silvia Bonomi, Amir Soltani Nezhad |
| 2011 | Xheal: localized self-healing using expanders. Gopal Pandurangan, Amitabh Trehan |