Keynote Lectures

• 
  Paola Flocchini, Bernard Mans, Nicola Santoro: Sense of Direction in Distributed Computing. 1-15
• 
  Ron van der Meyden, Yoram Moses: Top-Down Considerations on Distributed Computing. 16-19
• 
  Santosh K. Shrivastava: Inter-task Co-ordination in Long-Lived Distributed Applications. 20-21

Contributed Papers

• 
  Yair Amir, Alec Peterson, David Shaw: Seamlessly Selecting the Best Copy from Internet-Wide Replicated Web Servers. 22-33
• 
  James H. Anderson, Rohit Jain, David Ott: Wait-Free Synchronization in Quantum-Based Multiprogrammed Systems. 34-48
• 
  Hagit Attiya, Alla Gorbach, Shlomo Moran: Computing in Totally Anonymous Asynchronous Shared Memory Systems. 49-61
• 
  Joffroy Beauquier, Sylvie Delaët, Shlomi Dolev, Sébastien Tixeuil: Transient Fault Detectors. 62-74
• 
  Jean-Claude Bermond, Nausica Marlin, David Peleg, Stephane Perennes: Directed Virtual Path Layouts in ATM Networks. 75-88
• 
  Francis C. Chu, Joseph Y. Halpern: A Decision-Theoretic Approach to Reliable Message Delivery. 89-103
• 
  Israel Cidon, Osnat Mokryn: Propagation and Leader Election in a Multihop Broadcast Environment. 104-118
• 
  Michael J. Demmer, Maurice Herlihy: The Arrow Distributed Directory Protocol. 119-133
• 
  Matthias Fitzi, Ueli M. Maurer: Efficient Byzantine Agreement Secure Against General Adversaries. 134-148
• 
  Wayne Eberly, Lisa Higham, Jolanta Warpechowska-Gruca: Long-Lived, Fast, Waitfree Renaming with Optimal Name Space and High Throughput. 149-160
• 
  Cyril Gavoille, David Peleg: The Compactness of Interval Routing for Almost All Graphs. 161-174
• 
  Maurice Herlihy, Sergio Rajsbaum: A Wait-Free Classification of Loop Agreement Tasks. 175-185
• 
  Ted Herman: A Stabilizing Repair Timer. 186-200
• 
  Lisa Higham, Jalal Kawash: Java: Memory Consistency and Process Coordination. 201-215
• 
  Prasad Jayanti: A Complete and Constant Time Wait-Free Implementation of CAS from LL/SC and Vice Versa. 216-230
• 
  Marcos Kawazoe Aguilera, Wei Chen, Sam Toueg: Failure Detection and Consensus in the Crash-Recovery Model. 231-245
• 
  Tim Kempster, Colin Stirling, Peter Thanisch: A More Committed Quorum-Based Three Phase Commit Protocol. 246-257
• 
  Roger Khazan, Alan Fekete, Nancy A. Lynch: Multicast Group Communication as a Base for a Load-Balancing Replicated Data Service. 258-272
• 
  Rastislav Kralovic, Branislav Rovan, Peter Ruzicka, Daniel Stefankovic: Efficient Deadlock-Free Multi-dimensional Interval Routing in Interconnection Networks. 273-287
• 
  Jean-Marc Menaud, Valérie Issarny, Michel Banâtre: A New Protocol for Efficient Cooperative Transversal Web Caching. 288-302
• 
  Michael Merritt, Gadi Taubenfeld: Fairness of Shared Objects. 303-317
• 
  Fernando Pedone, André Schiper: Optimistic Atomic Broadcast. 318-332
• 
  Richard Plunkett, Alan Fekete: Approximate Agreement with Mixed Mode Faults: Algorithm and Lower Bound. 333-346
• 
  Assaf Schuster, Lea Shalev: Using Remote Access Histories for Thread Scheduling in Distributed Shared Memory Systems. 347-362
• 
  Jeremy B. Sussman, Keith Marzullo: The Bancomat Problem: An Example of Resource Allocation in a Partitionable Asynchronous System. 363-377
• 
  Francisco J. Torres-Rojas, Mustaque Ahamad, Michel Raynal: Lifetime Based Consistency Protocols for Distributed Objects. 378-392
• 
  Yih-Kuen Tsay: Deriving a Scalable Algorithm for Mutual Exclusion. 393-407
• 
  Christopher H. Young, Nael B. Abu-Ghazaleh, Philip A. Wilsey: OFC: A Distributed Fossil-Collection Algorithm for Time-Warp. 408-418

last updated on Sat May 25 05:43:57 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page