Table of Contents

• The 2009 Edsger W. Dijkstra Prize in Distributed ComputingLorenzo Alvisi, Rachid Guerraoui, Prasad Jayanti, Idit Keidar, Shay Kutten, Jennifer L. Welch. 1-2 [doi]
• Computing, Observing, Controlling, Checkpointing: Symbiosis Is Even Better Than Agreement!Jean-Michel Hélary. 3-4 [doi]
• What Agreement Problems Owe MichelAchour Mostéfaoui. 5 [doi]
• Shmuel Zaks - The Early Years: A Combinatorialist in Distributed ComputingNicola Santoro. 6 [doi]
• Shmuel Zaks - The Mathematician, Computer Scientist and PersonalityMordechai Shalom. 7 [doi]
• The Disagreement Power of an AdversaryCarole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Andreas Tielmann. 8-21 [doi]
• New Bounds for the Controller ProblemYuval Emek, Amos Korman. 22-34 [doi]
• On Set Consensus NumbersEli Gafni, Petr Kuznetsov. 35-47 [doi]
• The Abstract MAC LayerFabian Kuhn, Nancy A. Lynch, Calvin C. Newport. 48-62 [doi]
• Randomization Can Be a Healer: Consensus with Dynamic Omission FailuresHenrique Moniz, Nuno Ferreira Neves, Miguel Correia, Paulo Veríssimo. 63-77 [doi]
• Interrupting Snapshots and the Java:::TM:::^{/mbox{/tiny TM}} Size() MethodYehuda Afek, Nir Shavit, Moran Tzafrir. 78-92 [doi]
• Elastic TransactionsPascal Felber, Vincent Gramoli, Rachid Guerraoui. 93-107 [doi]
• Brief Announcement: Transactional Scheduling for Read-Dominated WorkloadsHagit Attiya, Alessia Milani. 108-110 [doi]
• Tight Group Renaming on Groups of Size g Is Equivalent to g-ConsensusYehuda Afek, Eli Gafni, Opher Lieber. 111-126 [doi]
• The RedBlue Adaptive Universal ConstructionsPanagiota Fatourou, Nikolaos D. Kallimanis. 127-141 [doi]
• Help When Needed, But No More: Efficient Read/Write Partial SnapshotDamien Imbs, Michel Raynal. 142-156 [doi]
• Contention-Sensitive Data Structures and AlgorithmsGadi Taubenfeld. 157-171 [doi]
• Brief Announcement: Acceleration by Contention for Shared Memory Mutual Exclusion AlgorithmsMichiko Inoue, Tsuyoshi Suzuki, Hideo Fujiwara. 172-173 [doi]
• Brief Announcement: Incremental Component-Based Modeling, Verification, and Performance Evaluation of Distributed ResetAnanda Basu, Borzoo Bonakdarpour, Marius Bozga, Joseph Sifakis. 174-175 [doi]
• Local Computation of Nearly Additive SpannersBilel Derbel, Cyril Gavoille, David Peleg, Laurent Viennot. 176-190 [doi]
• A Local 2-Approximation Algorithm for the Vertex Cover ProblemMatti Ã…strand, Patrik Floréen, Valentin Polishchuk, Joel Rybicki, Jukka Suomela, Jara Uitto. 191-205 [doi]
• Distributed Discovery of Large Near-CliquesZvika Brakerski, Boaz Patt-Shamir. 206-220 [doi]
• Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive DualityChristos Koufogiannakis, Neal E. Young. 221-238 [doi]
• Brief Announcement: Decidable Graph Languages by Mediated Population ProtocolsIoannis Chatzigiannakis, Othon Michail, Paul G. Spirakis. 239-240 [doi]
• Brief Announcement: Towards Secured Distributed Polling in Social NetworksRachid Guerraoui, Kévin Huguenin, Anne-Marie Kermarrec, Maxime Monod. 241-242 [doi]
• What Can Be Observed Locally?Cyril Gavoille, Adrian Kosowski, Marcin Markiewicz. 243-257 [doi]
• At-Most-Once Semantics in Asynchronous Shared MemorySotiris Kentros, Aggelos Kiayias, Nicolas C. Nicolaou, Alexander A. Shvartsman. 258-273 [doi]
• Nonblocking Algorithms and Backward SimulationSimon Doherty, Mark Moir. 274-288 [doi]
• Brief Announcement: Efficient Model Checking of Fault-Tolerant Distributed Protocols Using Symmetry ReductionPéter Bokor, Marco Serafini, Neeraj Suri, Helmut Veith. 289-290 [doi]
• Brief Announcement: Dynamic FTSS in Asynchronous Systems: The Case of UnisonSwan Dubois, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil. 291-293 [doi]
• Dynamics in Network Interaction GamesMartin Hoefer, Siddharth Suri. 294-308 [doi]
• Brief Announcement: Cloud Computing Games: Pricing Services of Large Data CentersAshraf Al Daoud, Sachin Agarwal, Tansu Alpcan. 309-310 [doi]
• On the Existence of Weakest Failure Detectors for Mutual Exclusion and ::::k::::-ExclusionVibhor Bhatt, Prasad Jayanti. 311-325 [doi]
• Crash-Quiescent Failure DetectionSrikanth Sastry, Scott M. Pike, Jennifer L. Welch. 326-340 [doi]
• The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash and AnonymityFrançois Bonnet, Michel Raynal. 341-355 [doi]
• Brief Announcement: On Implementing Omega Efficiently in the Crash-Recovery ModelMikel Larrea, Cristian Martín. 356-357 [doi]
• Brief Announcement: The Minimum Failure Detector for Non-Local Tasks in Message-Passing SystemsCarole Delporte-Gallet, Hugues Fauconnier, Sam Toueg. 358-359 [doi]
• Brief Announcement: Weak Synchrony Models and Failure Detectors for Message Passing (::::k::::-)Set AgreementMartin Biely, Peter Robinson, Ulrich Schmid. 360-361 [doi]
• Brief Announcement Zab: A Practical Totally Ordered Broadcast ProtocolFlavio Paiva Junqueira, Benjamin C. Reed. 362-363 [doi]
• Compact Multicast RoutingIttai Abraham, Dahlia Malkhi, David Ratajczak. 364-378 [doi]
• Compact Routing in Power-Law GraphsWei Chen, Christian Sommer 0002, Shang-Hua Teng, Yajun Wang. 379-391 [doi]
• Virtual Ring Routing TrendsDahlia Malkhi, Siddhartha Sen, Kunal Talwar, Renato Fonseca F. Werneck, Udi Wieder. 392-406 [doi]
• A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free PropertyLélia Blin, Maria Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil. 407-422 [doi]
• Euler Tour Lock-In Problem in the Rotor-Router ModelEvangelos Bampas, Leszek Gasieniec, Nicolas Hanusse, David Ilcinkas, Ralf Klasing, Adrian Kosowski. 423-435 [doi]
• Optimum Simultaneous Consensus for General Omissions Is Equivalent to an NP OracleYoram Moses. 436-448 [doi]
• On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine AgreementMatthias Fitzi, Jesper Buus Nielsen. 449-463 [doi]
• From Almost Everywhere to Everywhere: Byzantine Agreement with Õ(n:::3/2:::) BitsValerie King, Jared Saia. 464-478 [doi]
• Brief Announcement: A Leader-free Byzantine Consensus AlgorithmFatemeh Borran, André Schiper. 479-480 [doi]
• Efficient k-Shot Broadcasting in Radio NetworksErez Kantor, David Peleg. 481-495 [doi]
• Keeping Mobile Robot Swarms ConnectedAlejandro Cornejo, Fabian Kuhn, Ruy Ley-Wild, Nancy A. Lynch. 496-511 [doi]
• Consensus and Mutual Exclusion in a Multiple Access ChannelJurek Czyzowicz, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc. 512-526 [doi]
• Brief Announcement: Efficient Utilization of Multiple Interfaces in Wireless Ad Hoc NetworksRoy Friedman, Alex Kogan. 527-528 [doi]
• Brief Announcement: The Speed of Broadcasting in Random Networks - Density Does Not MatterNikolaos Fountoulakis, Anna Huber, Konstantinos Panagiotou. 529-530 [doi]