Abstract is missing.
- DISC 2011 Invited Lecture: Deterministic Rendezvous in Networks: Survey of Models and ResultsAndrzej Pelc. 1-15 [doi]
- Fast and Scalable RendezvousingYehuda Afek, Michael Hakimi, Adam Morrison. 16-31 [doi]
- Beeping a Maximal Independent SetYehuda Afek, Noga Alon, Ziv Bar-Joseph, Alejandro Cornejo, Bernhard Haeupler, Fabian Kuhn. 32-50 [doi]
- Trading Bit, Message, and Time Complexity of Distributed AlgorithmsJohannes Schneider, Roger Wattenhofer. 51-65 [doi]
- Combinatorial Algorithms for Distributed Graph ColoringLeonid Barenboim, Michael Elkin. 66-81 [doi]
- Physical Expander in Virtual Tree OverlayTaisuke Izumi, Maria Gradinariu Potop-Butucaru, Mathieu Valero. 82-96 [doi]
- Sub-logarithmic Test-and-Set against a Weak AdversaryDan Alistarh, James Aspnes. 97-109 [doi]
- Tight Space Bounds for ℓ-ExclusionGadi Taubenfeld. 110-124 [doi]
- SMV: Selective Multi-Versioning STMDmitri Perelman, Anton Byshevsky, Oleg Litmanovich, Idit Keidar. 125-140 [doi]
- Brief Announcement: Leaderless Byzantine PaxosLeslie Lamport. 141-142 [doi]
- Brief Announcement: When You Don't Trust Clients: Byzantine Proposer Fast PaxosKeith Marzullo, Hein Meling, Alessandro Mei. 143-144 [doi]
- Brief Announcement: On the Meaning of Solving a Task with a Failure DetectorCarole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov. 145-146 [doi]
- Brief Announcement: Algorithmic Mechanisms for Internet-Based Computing under Unreliable CommunicationEvgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro. 147-149 [doi]
- Maximum Metric Spanning Tree Made Byzantine TolerantSwan Dubois, Toshimitsu Masuzawa, Sébastien Tixeuil. 150-164 [doi]
- Performing Dynamically Injected Tasks on Processes Prone to Crashes and RestartsChryssis Georgiou, Dariusz R. Kowalski. 165-180 [doi]
- Leakage-Resilient Coin TossingElette Boyle, Shafi Goldwasser, Yael Tauman Kalai. 181-196 [doi]
- Brief Announcement: Composition Games for Distributed Systems: The EU Grants GamesShay Kutten, Ron Lavi, Amitabh Trehan. 197-199 [doi]
- Brief Announcement: Distributed Approximations for the Semi-matching ProblemAndrzej Czygrinow, Michal Hanckowiak, Krzysztof Krzywdzinski, Edyta Szymanska, Wojciech Wawrzyniak. 200-201 [doi]
- Brief Announcement: Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: - Adaptiveness vs. Obliviousness and Randomization vs. DeterminismMartin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks. 202-204 [doi]
- Brief Announcement: Bridging the Theory-Practice Gap in Multi-commodity Flow RoutingSiddhartha Sen, Sunghwan Ihm, Kay Ousterhout, Michael J. Freedman. 205-207 [doi]
- DISC 2011 Invited Lecture by Dahlia Malkhi: Going beyond PaxosMahesh Balakrishnan, Dahlia Malkhi, Vijayan Prabhakaran, Ted Wobber. 208-210 [doi]
- Byzantizing Paxos by RefinementLeslie Lamport. 211-224 [doi]
- Unbounded Contention Resolution in Multiple-Access ChannelsAntonio Fernández Anta, Miguel A. Mosteiro, Jorge Ramón Muñoz. 225-236 [doi]
- Deterministic and Energy-Optimal Wireless SynchronizationLeonid Barenboim, Shlomi Dolev, Rafail Ostrovsky. 237-251 [doi]
- Leveraging Channel Diversity to Gain Efficiency and Robustness for Wireless BroadcastShlomi Dolev, Seth Gilbert, Majid Khabbazian, Calvin C. Newport. 252-267 [doi]
- Leader Election Using Loneliness DetectionMohsen Ghaffari, Nancy A. Lynch, Srikanth Sastry. 268-282 [doi]
- Optimal Random Sampling from Distributed Streams RevisitedSrikanta Tirthapura, David P. Woodruff. 283-297 [doi]
- Parsimonious Flooding in Geometric Random-Walks - (Extended Abstract)Andrea E. F. Clementi, Riccardo Silvestri. 298-310 [doi]
- Misleading Stars: What Cannot Be Measured in the Internet?Yvonne Anne Pignolet, Stefan Schmid, Gilles Trédan. 311-325 [doi]
- Brief Announcement: A Randomized Algorithm for Label Assignment in Dynamic NetworksMeg Walraed-Sullivan, Radhika Niranjan Mysore, Keith Marzullo, Amin Vahdat. 326-327 [doi]
- Brief Announcement: ΔΩ: Specifying an Eventual Leader Service for Dynamic SystemsMikel Larrea, Michel Raynal. 328-329 [doi]
- Brief Announcement: The BG-Simulation for Byzantine Mobile RobotsTaisuke Izumi, Zohir Bouzid, Sébastien Tixeuil, Koichi Wada. 330-331 [doi]
- DISC 2011 Invited Lecture: Polygon Reconstruction with Little Information: An Example for the Power of Simple Micro-robotsPeter Widmayer. 332 [doi]
- Locality and Checkability in Wait-Free ComputingPierre Fraigniaud, Sergio Rajsbaum, Corentin Travers. 333-347 [doi]
- The Contest between Simplicity and Efficiency in Asynchronous Byzantine AgreementAllison B. Lewko. 348-362 [doi]
- Randomized Consensus in Expected O(n 2) Total Work Using Single-Writer RegistersJames Aspnes. 363-373 [doi]
- Structured Derivation of Semi-Synchronous AlgorithmsHagit Attiya, Fatemeh Borran, Martin Hutle, Zarko Milosevic 0001, André Schiper. 374-388 [doi]
- Byzantine Agreement Using Partial AuthenticationPiyush Bansal, Prasant Gopal, Anuj Gupta, Kannan Srinathan, Pranav K. Vasishta. 389-403 [doi]
- On Approximate Distance Labels and Routing Schemes with Affine StretchIttai Abraham, Cyril Gavoille. 404-415 [doi]
- The Complexity of Data Aggregation in Directed NetworksFabian Kuhn, Rotem Oshman. 416-431 [doi]
- Black Hole Search with Finite Automata Scattered in a Synchronous TorusJérémie Chalopin, Shantanu Das 0001, Arnaud Labourel, Euripides Markou. 432-446 [doi]
- Synchronous Rendezvous for Location-Aware AgentsAndrew Collins, Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Russell A. Martin. 447-459 [doi]
- Toward a Formal Semantic Framework for Deterministic Parallel ProgrammingLi Lu, Michael L. Scott. 460-474 [doi]
- CAFÉ: Scalable Task Pools with Adjustable Fairness and ContentionDmitry Basin, Rui Fan, Idit Keidar, Ofer Kiselov, Dmitri Perelman. 475-488 [doi]
- Oblivious CollaborationYehuda Afek, Yakov Babichenko, Uriel Feige, Eli Gafni, Nati Linial, Benny Sudakov. 489-504 [doi]