10. OPODIS 2006: Bordeaux, France

• Butler W. Lampson:
  Lazy and Speculative Execution in Computer Systems. 1-2
  
• Michel Raynal, Corentin Travers:
  In Search of the Holy Grail: Looking for the Weakest Failure Detector for Wait-Free Set Agreement. 3-19
  
• Rachid Guerraoui, Maurice Herlihy, Bastian Pochon:
  A Topological Treatment of Early-Deciding Set-Agreement. 20-35
  
• Eli Gafni:
  Renaming with k-Set-Consensus: An Optimal Algorithm into n + k - 1 Slots. 36-44
  
• Shlomi Dolev, Ronen I. Kat, Elad Michael Schiller:
  When Consensus Meets Self-stabilization. 45-63
  
• Burkhard Englert:
  On the Cost of Uniform Protocols Whose Memory Consumption Is Adaptive to Interval Contention. 64-80
  
• Nicolas Schiper, Rodrigo Schmidt, Fernando Pedone:
  Optimistic Algorithms for Partial Database Replication. 81-93
  
• Heinrich Moser, Ulrich Schmid:
  Optimal Clock Synchronization Revisited: Upper and Lower Bounds in Real-Time Systems. 94-109
  
• César Sánchez, Henny B. Sipma, Christopher D. Gill, Zohar Manna:
  Distributed Priority Inheritance for Real-Time and Embedded Systems. 110-125
  
• Neeraj Mittal, Kuppahalli L. Phaneesh, Felix C. Freiling:
  Safe Termination Detection in an Asynchronous Distributed System When Processes May Crash and Recover. 126-141
  
• Damian Dechev, Peter Pirkelbauer, Bjarne Stroustrup:
  Lock-Free Dynamically Resizable Arrays. 142-156
  
• Mirela Damian, Saurav Pandit, Sriram V. Pemmaraju:
  Distributed Spanner Construction in Doubling Metric Spaces. 157-171
  
• Anna Philippou, George Michael:
  Verification Techniques for Distributed Algorithms. 172-186
  
• Jérémie Chalopin, Emmanuel Godard, Yves Métivier, Rodrigue Ossamy:
  Mobile Agent Algorithms Versus Message Passing Algorithms. 187-201
  
• Mathieu Couture, Michel Barbeau, Prosenjit Bose, Evangelos Kranakis:
  Incremental Construction of k-Dominating Sets in Wireless Sensor Networks. 202-214
  
• Seth Gilbert, Rachid Guerraoui, Calvin C. Newport:
  Of Malicious Motes and Suspicious Sensors: On the Efficiency of Malicious Interference in Wireless Networks. 215-229
  
• Shlomi Dolev, Nir Tzachar:
  Empire of Colonies: Self-stabilizing and Self-organizing Distributed Algorithms. 230-243
  
• Murat Demirbas, Anish Arora, Vinod Kulathumani:
  Glance: A Lightweight Querying Service for Wireless Sensor Networks. 244-259
  
• Bogdan S. Chlebus, Dariusz R. Kowalski, Tomasz Radzik:
  On Many-to-Many Communication in Packet Radio Networks. 260-274
  
• Baruch Awerbuch, Christian Scheideler:
  Robust Random Number Generation for Peer-to-Peer Systems. 275-289
  
• Rudi Cilibrasi, Zvi Lotker, Alfredo Navarra, Stephane Perennes, Paul M. B. Vitányi:
  About the Lifespan of Peer to Peer Networks, . 290-304
  
• Emmanuelle Anceaume, Aina Ravoaja:
  Incentive-Based Robust Reputation Mechanism for P2P Services. 305-319
  
• Colin Cooper, Ralf Klasing, Tomasz Radzik:
  Searching for Black-Hole Faults in a Network Using Multiple Agents. 320-332
  
• Samia Souissi, Xavier Défago, Masafumi Yamashita:
  Gathering Asynchronous Mobile Robots with Inaccurate Compasses. 333-349
  
• Jurek Czyzowicz, Leszek Gasieniec, Andrzej Pelc:
  Gathering Few Fat Mobile Robots in the Plane. 350-364
  
• Rida A. Bazzi, Young-ri Choi, Mohamed G. Gouda:
  Hop Chains: Secure Routing and the Establishment of Distinct Identities. 365-379
  
• Marios Mavronicolas, Loizos Michael, Paul G. Spirakis:
  Computing on a Partially Eponymous Ring. 380-394
  
• Michael J. Fischer, Hong Jiang:
  Self-stabilizing Leader Election in Networks of Finite-State Anonymous Agents. 395-409
  
• Colette Johnen, Le Huy Nguyen:
  Robust Self-stabilizing Clustering Algorithm. 410-424
  
• Vadim Drabkin, Roy Friedman, Maria Gradinariu:
  Self-stabilizing Wireless Connected Overlays. 425-439
  

Last update Fri May 25 08:30:14 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page