11. SSS 2010: New York, NY, USA

Invited Talks Abstracts

• Leonid A. Levin:
  Arcane Information, Solving Relations, and Church Censorship. 1
  
• Mihalis Yannakakis:
  Computation of Equilibria and Stable Solutions. 2
  
• Yechiam Yemini:
  A Geometry of Networks. 3
  

Contributed Papers

• Ananda Basu, Borzoo Bonakdarpour, Marius Bozga, Joseph Sifakis:
  Systematic Correct Construction of Self-stabilizing Systems: A Case Study. 4-18
  
• Ezra N. Hoch, Michael Ben-Or, Danny Dolev:
  A Fault-Resistant Asynchronous Clock Function. 19-34
  
• Ajoy Kumar Datta, Lawrence L. Larmore, Hema Piniganti:
  Self-stabilizing Leader Election in Dynamic Networks. 35-49
  
• Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil:
  Loop-Free Super-Stabilizing Spanning Tree Construction. 50-64
  
• Sven Köhler, Volker Turau:
  A New Technique for Proving Self-stabilizing under the Distributed Scheduler. 65-79
  
• Abhishek Dhama, Oliver E. Theel:
  A Tranformational Approach for Designing Scheduler-Oblivious Self-stabilizing Algorithms. 80-95
  
• Swan Dubois, Toshimitsu Masuzawa, Sébastien Tixeuil:
  On Byzantine Containment Properties of the min + 1 Protocol. 96-110
  
• Jean R. S. Blair, Fredrik Manne, Rodica Mihai:
  Efficient Self-stabilizing Graph Searching in Tree Networks. 111-125
  
• Yukiko Yamauchi, Toshimitsu Masuzawa, Doina Bein:
  Adaptive Containment of Time-Bounded Byzantine Faults. 126-140
  
• Jorge Arturo Cobb:
  Brief Announcement: Fast Convergence in Route-Preservation. 141-143
  
• S. Dov Gordon, Jonathan Katz, Ranjit Kumaresan, Arkady Yerukhimovich:
  Authenticated Broadcast with a Partially Compromised Public-Key Infrastructure. 144-158
  
• Tuan Manh Vu, Reihaneh Safavi-Naini, Carey Williamson:
  On Applicability of Random Graphs for Modeling Random Key Predistribution for Wireless Sensor Networks. 159-175
  
• Mahesh Arumugam, Murat Demirbas, Sandeep S. Kulkarni:
  "Slow Is Fast" for Wireless Sensor Networks in the Presence of Message Losses. 176-190
  
• Anurag Agarwal, Vijay K. Garg, Vinit A. Ogale:
  Modeling and Analyzing Periodic Distributed Computations. 191-205
  
• Fuad Abujarad, Sandeep S. Kulkarni:
  Complexity Issues in Automated Model Revision without Explicit Legitimate State. 206-220
  
• Ioannis Chatzigiannakis, Othon Michail, Paul G. Spirakis:
  Algorithmic Verification of Population Protocols. 221-235
  
• Bo Zhang, Robert Simon, Hakan Aydin:
  Energy Management for Time-Critical Energy Harvesting Wireless Sensor Networks. 236-251
  
• Ioannis Chatzigiannakis, Othon Michail, Paul G. Spirakis:
  Stably Decidable Graph Languages by Mediated Population Protocols. 252-266
  
• Evangelos Kranakis, Michel Paquette:
  Broadcasting in Sensor Networks of Unknown Topology in the Presence of Swamping. 267-281
  
• Matthew P. Johnson, Amotz Bar-Noy, Mani B. Srivastava:
  Brief Announcement: Configuration of Actuated Camera Networks for Multi-target Coverage. 282-284
  
• Hrishikesh B. Acharya, Mohamed G. Gouda:
  Brief Announcement: On the Hardness of Topology Inference. 285-287
  
• Stéphane Pomportes, Joanna Tomasik, Anthony Busson, Véronique Vèque:
  Self-stabilizing Algorithm of Two-Hop Conflict Resolution. 288-302
  
• Amos Israeli, Mathew D. McCubbins, Ramamohan Paturi, Andrea Vattani:
  Low Memory Distributed Protocols for 2-Coloring. 303-318
  
• Taisuke Izumi, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil:
  Connectivity-Preserving Scattering of Mobile Robots with Limited Visibility. 319-331
  
• Andrei Giurgiu, Rachid Guerraoui, Kévin Huguenin, Anne-Marie Kermarrec:
  Computing in Social Networks. 332-346
  
• Junwhan Kim, Binoy Ravindran:
  On Transactional Scheduling in Distributed Transactional Memory Systems. 347-361
  
• Eli Gafni, Sergio Rajsbaum:
  Recursion in Distributed Computing. 362-376
  
• Damien Imbs, Michel Raynal:
  On Adaptive Renaming under Eventually Limited Contention. 377-387
  
• Jons-Tobias Wamhoff, Torvald Riegel, Christof Fetzer, Pascal Felber:
  RobuSTM: A Robust Software Transactional Memory. 388-404
  
• Hagit Attiya, Vincent Gramoli, Alessia Milani:
  A Provably Starvation-Free Distributed Directory Protocol. 405-419
  
• Bo Jiang, Binoy Ravindran, Changsoo Kim:
  Lightweight Live Migration for High Availability Cluster Service. 420-434
  
• Carole Delporte-Gallet, Stéphane Devismes, Hugues Fauconnier:
  Approximation of delta-Timeliness. 435-451
  
• Ji Lu, Yaoxue Zhang, Yuezhi Zhou:
  A Framework for Adaptive Optimization of Remote Synchronous CSCW in the Cloud Computing Era. 452-467
  
• Pierre Leone, Marina Papatriantafilou, Elad Michael Schiller, Gongxi Zhu:
  Chameleon-MAC: Adaptive and Self-* Algorithms for Media Access Control in Mobile Ad Hoc Networks. 468-488
  
• Heverson Borba Ribeiro, Emmanuelle Anceaume:
  A Comparative Study of Rateless Codes for P2P Persistent Storage. 489-503
  
• Mathieu Valero, Luciana Arantes, Maria Gradinariu, Pierre Sens:
  Dynamically Reconfigurable Filtering Architectures. 504-518
  
• Yaser Houri, Bernhard Amann, Thomas Fuhrmann:
  A Quantitative Analysis of Redundancy Schemes for Peer-to-Peer Storage Systems. 519-530
  
• Samuel Bernard, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil:
  A Framework for Secure and Private P2P Publish/Subscribe. 531-545
  
• Alain Cournier, Swan Dubois, Anissa Lamani, Franck Petit, Vincent Villain:
  Snap-Stabilizing Linear Message Forwarding. 546-559
  
• Vedant Misra, Dion Harmon, Yaneer Bar-Yam:
  Vulnerability Analysis of High Dimensional Complex Systems. 560-572
  
• Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang Chen, David Eisenstat, Goran Konjevod:
  Storage Capacity of Labeled Graphs. 573-587
  
• Taylor T. Johnson, Sayan Mitra:
  Safe Flocking in Spite of Actuator Faults. 588-602
  

Last update Sun May 26 03:32:04 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page