| 2011 | Beeping a Maximal Independent Set. Yehuda Afek, Noga Alon, Ziv Bar-Joseph, Alejandro Cornejo, Bernhard Haeupler, Fabian Kuhn |
| 2011 | Black Hole Search with Finite Automata Scattered in a Synchronous Torus. Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou |
| 2011 | Brief Announcement: A Randomized Algorithm for Label Assignment in Dynamic Networks. Meg Walraed-Sullivan, Radhika Niranjan Mysore, Keith Marzullo, Amin Vahdat |
| 2011 | Brief Announcement: Algorithmic Mechanisms for Internet-Based Computing under Unreliable Communication. Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro |
| 2011 | Brief Announcement: Bridging the Theory-Practice Gap in Multi-commodity Flow Routing. Siddhartha Sen, Sunghwan Ihm, Kay Ousterhout, Michael J. Freedman |
| 2011 | Brief Announcement: Composition Games for Distributed Systems: The EU Grants Games. Shay Kutten, Ron Lavi, Amitabh Trehan |
| 2011 | Brief Announcement: Distributed Approximations for the Semi-matching Problem. Andrzej Czygrinow, Michal Hanckowiak, Krzysztof Krzywdzinski, Edyta Szymanska, Wojciech Wawrzyniak |
| 2011 | Brief Announcement: Leaderless Byzantine Paxos. Leslie Lamport |
| 2011 | Brief Announcement: On the Meaning of Solving a Task with a Failure Detector. Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov |
| 2011 | Brief Announcement: Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: - Adaptiveness vs. Obliviousness and Randomization vs. Determinism. Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks |
| 2011 | Brief Announcement: The BG-Simulation for Byzantine Mobile Robots. Taisuke Izumi, Zohir Bouzid, Sébastien Tixeuil, Koichi Wada |
| 2011 | Brief Announcement: When You Don't Trust Clients: Byzantine Proposer Fast Paxos. Keith Marzullo, Hein Meling, Alessandro Mei |
| 2011 | Brief Announcement: ΔΩ: Specifying an Eventual Leader Service for Dynamic Systems. Mikel Larrea, Michel Raynal |
| 2011 | Byzantine Agreement Using Partial Authentication. Piyush Bansal, Prasant Gopal, Anuj Gupta, Kannan Srinathan, Pranav K. Vasishta |
| 2011 | Byzantizing Paxos by Refinement. Leslie Lamport |
| 2011 | CAFÉ: Scalable Task Pools with Adjustable Fairness and Contention. Dmitry Basin, Rui Fan, Idit Keidar, Ofer Kiselov, Dmitri Perelman |
| 2011 | Combinatorial Algorithms for Distributed Graph Coloring. Leonid Barenboim, Michael Elkin |
| 2011 | DISC 2011 Invited Lecture by Dahlia Malkhi: Going beyond Paxos. Mahesh Balakrishnan, Dahlia Malkhi, Vijayan Prabhakaran, Ted Wobber |
| 2011 | DISC 2011 Invited Lecture: Deterministic Rendezvous in Networks: Survey of Models and Results. Andrzej Pelc |
| 2011 | DISC 2011 Invited Lecture: Polygon Reconstruction with Little Information: An Example for the Power of Simple Micro-robots. Peter Widmayer |
| 2011 | Deterministic and Energy-Optimal Wireless Synchronization. Leonid Barenboim, Shlomi Dolev, Rafail Ostrovsky |
| 2011 | Distributed Computing - 25th International Symposium, DISC 2011, Rome, Italy, September 20-22, 2011. Proceedings David Peleg |
| 2011 | Fast and Scalable Rendezvousing. Yehuda Afek, Michael Hakimi, Adam Morrison |
| 2011 | Leader Election Using Loneliness Detection. Mohsen Ghaffari, Nancy A. Lynch, Srikanth Sastry |
| 2011 | Leakage-Resilient Coin Tossing. Elette Boyle, Shafi Goldwasser, Yael Tauman Kalai |
| 2011 | Leveraging Channel Diversity to Gain Efficiency and Robustness for Wireless Broadcast. Shlomi Dolev, Seth Gilbert, Majid Khabbazian, Calvin C. Newport |
| 2011 | Locality and Checkability in Wait-Free Computing. Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers |
| 2011 | Maximum Metric Spanning Tree Made Byzantine Tolerant. Swan Dubois, Toshimitsu Masuzawa, Sébastien Tixeuil |
| 2011 | Misleading Stars: What Cannot Be Measured in the Internet? Yvonne-Anne Pignolet, Stefan Schmid, Gilles Trédan |
| 2011 | Oblivious Collaboration. Yehuda Afek, Yakov Babichenko, Uriel Feige, Eli Gafni, Nati Linial, Benny Sudakov |
| 2011 | On Approximate Distance Labels and Routing Schemes with Affine Stretch. Ittai Abraham, Cyril Gavoille |
| 2011 | Optimal Random Sampling from Distributed Streams Revisited. Srikanta Tirthapura, David P. Woodruff |
| 2011 | Parsimonious Flooding in Geometric Random-Walks - (Extended Abstract). Andrea E. F. Clementi, Riccardo Silvestri |
| 2011 | Performing Dynamically Injected Tasks on Processes Prone to Crashes and Restarts. Chryssis Georgiou, Dariusz R. Kowalski |
| 2011 | Physical Expander in Virtual Tree Overlay. Taisuke Izumi, Maria Gradinariu Potop-Butucaru, Mathieu Valero |
| 2011 | Randomized Consensus in Expected O(n 2) Total Work Using Single-Writer Registers. James Aspnes |
| 2011 | SMV: Selective Multi-Versioning STM. Dmitri Perelman, Anton Byshevsky, Oleg Litmanovich, Idit Keidar |
| 2011 | Structured Derivation of Semi-Synchronous Algorithms. Hagit Attiya, Fatemeh Borran, Martin Hutle, Zarko Milosevic, André Schiper |
| 2011 | Sub-logarithmic Test-and-Set against a Weak Adversary. Dan Alistarh, James Aspnes |
| 2011 | Synchronous Rendezvous for Location-Aware Agents. Andrew Collins, Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Russell A. Martin |
| 2011 | The Complexity of Data Aggregation in Directed Networks. Fabian Kuhn, Rotem Oshman |
| 2011 | The Contest between Simplicity and Efficiency in Asynchronous Byzantine Agreement. Allison B. Lewko |
| 2011 | Tight Space Bounds for ℓ-Exclusion. Gadi Taubenfeld |
| 2011 | Toward a Formal Semantic Framework for Deterministic Parallel Programming. Li Lu, Michael L. Scott |
| 2011 | Trading Bit, Message, and Time Complexity of Distributed Algorithms. Johannes Schneider, Roger Wattenhofer |
| 2011 | Unbounded Contention Resolution in Multiple-Access Channels. Antonio Fernández Anta, Miguel A. Mosteiro, Jorge Ramón Muñoz |