13. SSS 2011: Grenoble, France

• Toshimitsu Masuzawa:
  Silence Is Golden: Self-stabilizing Protocols Communication-Efficient after Convergence. 1-3
  
• Nicola Santoro:
  Computing in Time-Varying Networks. 4
  
• Hrishikesh B. Acharya, Taehwan Choi, Rida A. Bazzi, Mohamed G. Gouda:
  The K-Observer Problem in Computer Networks. 5-18
  
• Noga Alon, Hagit Attiya, Shlomi Dolev, Swan Dubois, Maria Potop-Butucaru, Sébastien Tixeuil:
  Pragmatic Self-stabilization of Atomic Memory in Message-Passing Systems. 19-31
  
• Roberto Baldoni, Silvia Bonomi, Amir Soltani Nezhad:
  An Algorithm for Implementing BFT Registers in Distributed Systems with Bounded Churn. 32-46
  
• Joffroy Beauquier, Peva Blanchard, Janna Burman, Sylvie Delaët:
  Computing Time Complexity of Population Protocols with Cover Times - The ZebraNet Example. 47-61
  
• Andrew Berns, Sukumar Ghosh, Sriram V. Pemmaraju:
  Building Self-stabilizing Overlay Networks with the Transitive Closure Framework. 62-76
  
• Borzoo Bonakdarpour, Sandeep S. Kulkarni:
  Active Stabilization. 77-91
  
• Zohir Bouzid, Anissa Lamani:
  Robot Networks with Homonyms: The Case of Patterns Formation. 92-107
  
• Hagit Attiya, Armando Castañeda:
  A Non-topological Proof for the Impossibility of k-Set Agreement. 108-119
  
• Bernadette Charron-Bost, Henri Debrat, Stephan Merz:
  Formal Verification of Consensus Algorithms Tolerating Malicious Faults. 120-134
  
• Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Paul G. Spirakis:
  The Computational Power of Simple Protocols for Self-awareness on Graphs. 135-147
  
• Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, Yvan Rivierre:
  Self-stabilizing Labeling and Ranking in Ordered Trees. 148-162
  
• Danny Dolev, Matthias Függer, Christoph Lenzen, Ulrich Schmid:
  Fault-Tolerant Algorithms for Tick-Generation in Asynchronous Logic: Robust Pulse Generation - [Extended Abstract]. 163-177
  
• Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
  The South Zone: Distributed Algorithms for Alliances. 178-192
  
• Davide Frey, Arnaud Jégou, Anne-Marie Kermarrec:
  Social Market: Combining Explicit and Implicit Social Networks. 193-207
  
• Christian Gorecki, Felix C. Freiling, Marc Kührer, Thorsten Holz:
  TrumanBox: Improving Dynamic Malware Analysis by Emulating the Internet. 208-222
  
• Ofer Hermoni, Niv Gilboa, Eyal Felstaine, Yuval Elovici, Shlomi Dolev:
  Rendezvous Tunnel for Anonymous Publishing: Clean Slate and Tor Based Designs. 223-237
  
• Mohamed M. Saad, Binoy Ravindran:
  Snake: Control Flow Distributed Software Transactional Memory. 238-252
  
• Tatsuro Iida, Atsuko Miyaji, Kazumasa Omote:
  POLISH: Proactive Co-operative LInk Self-Healing for Wireless Sensor Networks. 253-267
  
• Damien Imbs, Michel Raynal:
  The Weakest Failure Detector to Implement a Register in Asynchronous Systems with Hybrid Communication. 268-282
  
• Jun Kiniwa, Kensaku Kikuta:
  Price Stabilization in Networks - What Is an Appropriate Model ? 283-295
  
• Andreas Klappenecker, Hyunyoung Lee, Jennifer L. Welch:
  Dynamic Regular Registers in Systems with Churn. 296-310
  
• Sven Köhler, Volker Turau:
  Space-Efficient Fault-Containment in Dynamic Networks. 311-325
  
• William Leal, Micah McCreery, Daniel Faria:
  The OCRC Fuel Cell Lab Safety System: A Self-Stabilizing Safety-Critical System. 326-340
  
• Achour Mostéfaoui, Michel Raynal, Julien Stainer:
  Relations Linking Failure Detectors Associated with k-Set Agreement in Message-Passing Systems. 341-355
  
• Rizal Mohd Nor, Mikhail Nesterenko, Christian Scheideler:
  Corona: A Stabilizing Deterministic Message-Passing Skip List. 356-370
  
• Ingy Ramzy, Anish Arora:
  Using Zero Knowledge to Share a Little Knowledge: Bootstrapping Trust in Device Networks. 371-385
  
• Marc Shapiro, Nuno M. Preguiça, Carlos Baquero, Marek Zawirski:
  Conflict-Free Replicated Data Types. 386-400
  
• Dominique Méry, Neeraj Kumar Singh:
  Analysis of DSR Protocol in Event-B. 401-415
  
• Andréa W. Richa, Christian Scheideler, Phillip Stevens:
  Self-Stabilizing De Bruijn Networks. 416-430
  
• Hrishikesh B. Acharya, Anil Kumar Katti, Mohamed G. Gouda:
  Brief Announcement: A Conjecture on Traceability, and a New Class of Traceable Networks. 431-432
  
• Fawaz M. Al-Azemi, Mehmet Hakan Karaata:
  Brief Announcement: A Stabilizing Algorithm for Finding Two Edge-Disjoint Paths in Arbitrary Graphs. 433-434
  
• Richard Anthony, Mariusz Pelc, Haffiz Suahib:
  Brief Announcement: Towards Interoperability Standards and Services for Autonomic Systems. 435-436
  
• Roberto Beraldi, Adriano Cerocchi, Fabio Papale, Leonardo Querzoni:
  Brief Announcement: Distributed Self-organizing Event Space Partitioning for Content-Based Publish/Subscribe Systems. 437-438
  
• Jacek Cichon, Rafal Kapelko, Karol Marchwicki:
  Brief Announcement: A Note on Replication of Documents. 439-440
  
• Ajoy Kumar Datta, Anne-Marie Kermarrec, Lawrence L. Larmore, Erwan Le Merrer:
  Brief Announcement: A Stable and Robust Membership Protocol. 441-442
  
• Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore:
  Brief Announcement: Sorting on Skip Chains. 443-444
  
• Yonghwan Kim, Tadashi Araragi, Junya Nakamura, Toshimitsu Masuzawa:
  Brief Announcement: A Concurrent Partial Snapshot Algorithm for Large-Scale and Dynamic Distributed Systems. 445-446
  
• Björn Saballus, Stephan-Alexander Posselt, Thomas Fuhrmann:
  Brief Announcement: Fault-Tolerant Object Location in Large Compute Clusters. 447-448
  
• Shailesh Vaya:
  Brief Announcement: Faster Gossiping in Bidirectional Radio Networks with Large Labels. 449-450
  

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