11. OPODIS 2007: Guadeloupe, French West Indies

• Laurent Baduel, Satoshi Matsuoka:
  A Decentralized, Scalable, and Autonomous Grid Monitoring System. 1-15
  
• Rodrigo Schmidt, Fernando Pedone:
  A Formal Analysis of the Deferred Update Technique. 16-30
  
• JunSuk Shin, Rajnish Kumar, Dushmanta Mohapatra, Umakishore Ramachandran, Mostafa H. Ammar:
  ASAP: A Camera Sensor Network for Situation Awareness. 31-47
  
• Baruch Awerbuch, Aviv Nisgav, Boaz Patt-Shamir:
  Asynchronous Active Recommendation Systems. 48-61
  
• Theodore P. Baker, Michele Cirinei:
  Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks. 62-75
  
• Moumen Hamouma, Achour Mostéfaoui, Gilles Trédan:
  Byzantine Consensus with Few Synchronous Links. 76-89
  
• Emmanuelle Anceaume, Carole Delporte-Gallet, Hugues Fauconnier, Michel Hurfin, Josef Widder:
  Clock Synchronization in the Byzantine-Recovery Failure Model. 90-104
  
• Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro:
  Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots. 105-118
  
• Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves:
  Deterministic Communication in the Weak Sensor Model. 119-131
  
• Yoann Dieudonné, Franck Petit:
  Deterministic Leader Election in Anonymous Sensor Networks Without Common Coordinated System. 132-142
  
• Vinodkrishnan Kulathumani, Anish Arora:
  Distance Sensitive Snapshots in Wireless Sensor Networks. 143-158
  
• Sven Oliver Krumke, Peter Merz, Tim Nonner, Katharina Rupp:
  Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs. 159-173
  
• Christian Groß, Holger Hermanns, Reza Pulungan:
  Does Clock Precision Influence ZigBee's Energy Consumptions?. 174-188
  
• Antonio Fernández Anta, Michel Raynal:
  From an Intermittent Rotating Star to a Leader. 189-203
  
• Sanjoy K. Baruah, Nathan Fisher:
  Global Deadline-Monotonic Scheduling of Arbitrary-Deadline Sporadic Task Systems. 204-216
  
• Anders Gidenstam, Marina Papatriantafilou:
  LFthreads: A Lock-Free Thread Library. 217-231
  
• Chi Ho, Danny Dolev, Robbert van Renesse:
  Making Distributed Applications Robust. 232-246
  
• Tiziana Calamoneri, Andrea E. F. Clementi, Emanuele G. Fusco, Riccardo Silvestri:
  Maximizing the Number of Broadcast Operations in Static Random Geometric Ad-Hoc Networks. 247-259
  
• Eli Gafni, Petr Kuznetsov:
  N-Consensus is the Second Strongest Object for N+1 Processes. 260-273
  
• Philippe Duchon, Nicole Eggemann, Nicolas Hanusse:
  Non-Searchability of Random Power-Law Graphs. 274-285
  
• James Aspnes, Yinghua Wu:
  O(logn)-Time Overlay Network Construction from Graphs with Out-Degree 1. 286-300
  
• Lélia Blin, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil:
  On the Self-stabilization of Mobile Robots in Graphs. 301-314
  
• Olivier Beaumont, Anne-Marie Kermarrec, Etienne Riviere:
  Peer to Peer Multidimensional Overlays: Approximating Complex Structures. 315-328
  
• Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Eric Ruppert:
  Secretive Birds: Privacy in Population Protocols. 329-342
  
• Danny Dolev, Ezra N. Hoch, Robbert van Renesse:
  Self-stabilizing and Byzantine-Tolerant Overlay Network. 343-357
  
• Philippe Mauran, Gérard Padiou, Philippe Quéinnec:
  Separability to Help Parallel Simulation of Distributed Computations. 358-371
  
• François Bonnet, Anne-Marie Kermarrec, Michel Raynal:
  Small-World Networks: From Theoretical Bounds to Practical Systems. 372-385
  
• Eric Ruppert:
  The Anonymous Consensus Hierarchy and Naming Problems. 386-400
  
• Moshe Hoffman, Ori Shalev, Nir Shavit:
  The Baskets Queue. 401-414
  
• David Ilcinkas, Nicolas Nisse, David Soguet:
  The Cost of Monotonicity in Distributed Graph Searching. 415-428
  
• Vincent Gramoli, Michel Raynal:
  Timed Quorum Systems for Large-Scale and Dynamic Environments. 429-442
  
• James Aspnes, Navin Rustagi, Jared Saia:
  Worm Versus Alert: Who Wins in a Battle for Control of a Large-Scale Network?. 443-456