Invited Talks

• 
  Colin Cooper: Random Walks, Interacting Particles, Dynamic Networks: Randomness Can Be Helpful. 1-14
• 
  David Peleg: SINR Maps: Properties and Applications. 15-16

Survey Talk

• 
  Sergio Rajsbaum, Michel Raynal: A Survey on Some Recent Advances in Shared Memory Models. 17-28

Fault Tolerance

• 
  Emmanuel Godard, Joseph G. Peters: Consensus vs. Broadcast in Communication Networks with Arbitrary Mobile Omission Faults. 29-41
• 
  Heinrich Moser, Ulrich Schmid: Reconciling Fault-Tolerant Distributed Algorithms and Real-Time Computing - (Extended Abstract). 42-53
• 
  Alain Bui, Simon Clavière, Ajoy Kumar Datta, Lawrence L. Larmore, Devan Sohier: Self-stabilizing Hierarchical Construction of Bounded Size Clusters. 54-65
• 
  Damien Imbs, Sergio Rajsbaum, Michel Raynal: The Universe of Symmetry Breaking Tasks. 66-77

Routing

• 
  Sun-Yuan Hsieh, Chi-Ya Kao: Determining the Conditional Diagnosability of k-Ary n-Cubes Under the MM* Model. 78-88
• 
  Lakshmi Anantharamu, Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki: Medium Access Control for Adversarial Channels with Jamming. 89-100
• 
  Bernadette Charron-Bost, Matthias Függer, Jennifer L. Welch, Josef Widder: Full Reversal Routing as a Linear Dynamical System. 101-112
• 
  Bernadette Charron-Bost, Matthias Függer, Jennifer L. Welch, Josef Widder: Partial is Full. 113-124

Mobile Agents/Robots (I)

• 
  Branislav Katreniak: Convergence with Limited Visibility by Asynchronous Mobile Robots. 125-137
• 
  Philipp Brandes, Bastian Degener, Barbara Kempkes, Friedhelm Meyer auf der Heide: Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally. 138-149
• 
  Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil: Asynchronous Mobile Robot Gathering from Symmetric Configurations without Global Multiplicity Detection. 150-161

Mobile Agents/Robots (II)

• 
  Samuel Guilbault, Andrzej Pelc: Gathering Asynchronous Oblivious Agents with Local Vision in Regular Bipartite Graphs. 162-173
• 
  Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra: Gathering of Six Robots on Anonymous Symmetric Rings. 174-185
• 
  Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou: Tight Bounds for Scattered Black Hole Search in a Ring. 186-197
• 
  Balasingham Balamohan, Paola Flocchini, Ali Miri, Nicola Santoro: Improving the Optimal Bounds for Black Hole Search in Rings. 198-209

Probabilistic Methods

• 
  Colin Cooper, Alan M. Frieze, Tomasz Radzik: The Cover Times of Random Walks on Hypergraphs. 210-221
• 
  Bronislava Brejová, Stefan Dobrev, Rastislav Královic, Tomás Vinar: Routing in Carrier-Based Mobile Networks. 222-233
• 
  Thomas Nowak, Matthias Függer, Alexander Kößler: On the Performance of a Retransmission-Based Synchronizer. 234-245

Distributed Algorithms on Graphs

• 
  Johannes Schneider, Roger Wattenhofer: Distributed Coloring Depending on the Chromatic Number or the Neighborhood Growth. 246-257
• 
  Guanfeng Liang, Nitin H. Vaidya: Multiparty Equality Function Computation in Networks with Point-to-Point Links. 258-269
• 
  Evangelos Bampas, Davide Bilò, Guido Drovandi, Luciano Gualà, Ralf Klasing, Guido Proietti: Network Verification via Routing Table Queries. 270-281
• 
  Vittorio Bilò, Alessandro Celi, Michele Flammini, Vasco Gallotti: Social Context Congestion Games. 282-293

Ad-hoc Networks

• 
  Christian Schindelhauer, Zvi Lotker, Johannes Wendeberg: Network Synchronization and Localization Based on Stolen Signals. 294-305
• 
  Jean-Claude Bermond, Luisa Gargano, Stéphane Pérennes, Adele A. Rescigno, Ugo Vaccaro: Optimal Time Data Gathering in Wireless Networks with Omni-Directional Antennas. 306-317

last updated on Thu May 23 03:43:46 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page