Invited Talks ------------- Michael Rabin, Leslie Lamport, Nancy Lynch Provable Unbreakable Hyper-Encryption Using Distributed Systems Michael Rabin Time, Clocks, and the Ordering of My Ideas about Distributed Systems Leslie Lamport My Early Days in Distributed Computing Theory: 1979-1982 Nancy Lynch Invited Paper ------------- Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols Ran Canetti, Ling Cheung, Dilsun Kaynar, Moses Liskov, Nancy Lynch, Olivier Pereira, and Roberto Segala Panel ----- Eli Gafni, Michel Raynal, Nicola Santoro, Jan van Leeuwen, Shmuel Zaks DISC at its 20th anniversary: Past, Present and Future Michel Raynal, Sam Toueg and Shmuel Zaks Regular Papers -------------- Checking a Multithreaded Algorithm with +CAL Leslie Lamport Distributed Resource Allocation in Stream Processing Cathy H. Xia, James A. Broberg, Zhen Liu, Li Zhang One-Step Consensus Solvability Taisuke Izumi, Toshimitsu Masuzawa Low-latency Atomic Broadcast in the presence of contention Piotr Zielinski Exact Distance Labelings Yield Additive-Stretch Compact Routing Schemes Arthur Brady, Lenore Cowen Built-in Coloring for Highly-Concurrent Doubly-Linked Lists Hagit Attiya, Eshcar Hillel Oblivious Gradient Clock Synchronization Thomas Locher, Roger Wattenhofer Renaming in Message Passing Systems with Byzantine Failures Michael Okun, Amnon Barak Transactional Locking II Dave Dice, Ori Shalev, Nir Shavit Distributed approximation algorithms in unit-disk graphs A. Czygrinow, M. Han'c'kowiak Less is More: Consensus Gaps Between Restricted and Unrestricted Objects Yehuda Afek, Eran Shalom On Consistency of Encrypted Files Alina Oprea, Michael K. Reiter A New Proof of the GHS Minimum-spanning Tree Protocol Yoram Moses, Benny Shimony Fully Adaptive Algorithms for Long-Lived Renaming Alex Brodsky, Faith Ellen Fich, Philipp Woelfel Robust Network Supercomputing with Malicious Processes Kishori M. Konwar, Sanguthevar Rajasekaran, Alexander A. Shvartsman On Randomized Broadcasting in Power Law Networks Robert Elsasser Subconsensus Tasks: Renaming is Weaker than Set Agreement Eli Gafni, Sergio Rajsbaum, Maurice Herlihy Time and communication efficient consensus for crash failures Bogdan S. Chlebus, Dariusz R. Kowalski On Minimizing the Number of ADMs in a General Topology Optical Network Michele Flammini, Mordechai Shalom, Shmuel Zaks Conflict Detection and Validation Strategies for Software Transactional Memory Michael F. Spear, Virendra J. Marathe, William N. Scherer III, Michael L. Scott Bounded-Wait Combining: Constructing Robust and High-Throughput Shared Objects Danny Hendler, Shay Kutten Fault-tolerant and Self-stabilizing Mobile Robots Gathering Xavier De'fago, Maria Gradinariu, Stephane Messika, Philippe Raipin-Parve'dy Agreeing to Agree: Conflict Resolution for Optimistically Replicated Data Michael B. Greenwald, Sanjeev Khanna, Keshav Kunal, Benjamin C. Pierce, Alan Schmitt A Fast Distributed Approximation Algorithm for Minimum Spanning Trees Maleq Khan, Gopal Pandurangan Exploring Gafni's reduction land: from Omega^k to wait-free adaptive 2p-ceil(p/k)-renaming via k-set agreement Achour Mostefaoui, Michel Raynal, Corentin Travers Fast Computation by Population Protocols With a Leader Dana Angluin, James Aspnes, David Eisenstat On Self-Stabilizing Search Trees Doina Bein, Ajoy K. Datta, Lawrence L. Larmore The Weakest Failure Detectors to Boost Obstruction-Freedom Rachid Guerraoui, Michal Kapalka, Petr Kouznetsov A Knowledge-Based Analysis of Global Function Computation Joseph Y. Halpren, Sabina Petride Groupings and Pairings in Anonymous Networks Jeremie Chalopin, Shantanu Das, Nicola Santoro Capturing Register and Control Dependence in Memory Consistency Models with Applications to the Itanium Architecture Lisa Higham, LillAnne Jackson, Jalal Kawash A Lazy Snapshot Algorithm with Eager Validation Torvald Riegel, Pascal Felber, Christof Fetzer Efficient Dynamic Aggregation Yitzhak Birk, Idit Keidar, Liran Liss, Assaf Schuster Bounded Wait-Free f-resilient Atomic Byzantine Data Storage Systems for an Unbounded Number of Clients Rida A. Bazzi, Yin Ding Byzantine and Multi-writer K-quorums Amitanand S. Aiyer, Lorenzo Alvisi, Rida A. Bazzi Brief Announcements ------------------- Brief Announcement: Decentralized, Connectivity-Preserving, and Cost-Effective Structured Overlay Maintenance Yu Chen, Wei Chen Brief Announcement: Performance Analysis of Cyclon, an Inexpensive Membership Management for Unstructured P2P Overlays Francois Bonnet, Frederic Tronel, Spyros Voulgaris Brief Announcement: on Augmented Graph Navigability Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker Brief Announcement: Multislicing: Many slices are better than one Vinit A. Ogale, Vijay K. Garg Brief Announcement: Optimistic Algorithms for Partial Database Replication Nicolas Schiper, Rodrigo Schmidt, Fernando Pedone Brief Announecment: Fault-Tolerant SemiFast Implementations of Atomic Read/Write Registers Chryssis Georgiou, Nicolas C. Nicolaou, Alexander A. Shvartsman Brief Announecment: Convergence Analysis of Scalable Gossip Protocols Stacy Patterson, Bassam Bamieh, Amr El Abbadi Brief Announcement: Monitoring of Distributed Linear Computations Anton Esin, Rostislav Yavorskiy, Nikolay Zemtsov Brief Announcement: Communication-optimal implementation of failure detector class <>P Mikel Larrea, Alberto Lafuente, and Joachim Wieland Brief Announcement: Computing automatically the stabilization time against the best and the worst schedulers Joffroy Beauquier, Colette Johnen, Stephane Messika Brief Announcement: Decoupled Quorum-based Byzantine-Resilient Coordination in Open Distributed Systems Alysson Neves Bessani, Miguel Correia, Joni da Silva Fraga, Lau Cheuk Lung Brief Announcement: Abortable shared objects Marcos K. Aguilera, Svend Frolund, Vassos Hadzilacos, Stephanie Lorraine Horn, Sam Toueg Brief Announcement: Synchronous Distributed Algorithms for Node Discovery and Configuration in Multi-channel Cognitive Radio Networks Srinivasan Krishnamurthy, R. Chandrasekaran, Neeraj Mittal and S. Venkatesan