15. SIROCCO 2008: Villars-sur-Ollon, Switzerland

Invited Talks

• Nicola Santoro:
  Mobile Entities Computing: Models and Problems. 1
  
• Boaz Patt-Shamir:
  Reputation, Trust and Recommendation Systems in Peer-to-Peer Systems. 2-4
  

Regular Papers

• Nobuhiro Inuzuka, Yuichi Tomida, Taisuke Izumi, Yoshiaki Katayama, Koichi Wada:
  Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses. 5-19
  
• Colin Cooper, Ralf Klasing, Tomasz Radzik:
  Locating and Repairing Faults in a Network with Mobile Agents. 20-32
  
• Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro:
  Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots. 33-47
  
• Florent Becker, Sergio Rajsbaum, Ivan Rapaport, Eric Rémila:
  Average Binary Long-Lived Consensus: Quantifying the Stabilizing Role Played by Memory. 48-60
  
• Olivier Beaumont, Nicolas Bonichon, Philippe Duchon, Hubert Larchevêque:
  Distributed Approximation Algorithm for Resource Clustering. 61-73
  
• Augustin Chaintreau:
  Sharpness: A Tight Condition for Scalability. 74-88
  
• Davide Bilò, Thomas Erlebach, Matús Mihalák, Peter Widmayer:
  Discovery of Network Properties with All-Shortest-Paths Queries. 89-103
  
• Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker:
  Recovering the Long-Range Links in Augmented Graphs. 104-118
  
• Bibudh Lahiri, Srikanta Tirthapura:
  Computing Frequent Elements Using Gossip. 119-130
  
• Hillel Avni, Nir Shavit:
  Maintaining Consistent Transactional States without a Global Clock. 131-140
  
• David Adjiashvili, David Peleg:
  Equal-Area Locus-Based Convex Polygon Decomposition. 141-155
  
• Monika Steinová:
  On the Power of Local Orientations. 156-169
  
• Alexander Kesselman, Kirill Kogan, Michael Segal:
  Best Effort and Priority Queuing Policies for Buffered Crossbar Switches. 170-184
  
• Jan Kostka, Yvonne Anne Oswald, Roger Wattenhofer:
  Word of Mouth: Rumor Dissemination in Social Networks. 185-196
  
• Konstantinos Kollias:
  Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games. 197-208
  
• Andreas Emil Feldmann, Heiko Röglin, Berthold Vöcking:
  Computing Approximate Nash Equilibria in Network Congestion Games. 209-220
  
• Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks:
  On the Performance of Beauquier and Debas' Self-stabilizing Algorithm for Mutual Exclusion. 221-233
  
• Thomas Sauerwald, Dirk Sudholt:
  Self-stabilizing Cuts in Synchronous Networks. 234-246
  
• Toshimitsu Masuzawa, Sébastien Tixeuil:
  Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs. 247-261
  
• Jean-Claude Bermond, Luisa Gargano, Adele A. Rescigno:
  Gathering with Minimum Delay in Tree Sensor Networks. 262-276
  
• Frantisek Galcík:
  Centralized Communication in Radio Networks with Strong Interference. 277-290
  
• David Ilcinkas, Dariusz R. Kowalski, Andrzej Pelc:
  Fast Radio Broadcasting with Advice. 291-305
  

Last update Wed Feb 15 05:18:11 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page