default search action
18. SIROCCO 2011: Gdansk, Poland
- Adrian Kosowski, Masafumi Yamashita:
Structural Information and Communication Complexity - 18th International Colloquium, SIROCCO 2011, Gdansk, Poland, June 26-29, 2011. Proceedings. Lecture Notes in Computer Science 6796, Springer 2011, ISBN 978-3-642-22211-5
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
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
Gathering of Six Robots on Anonymous Symmetric Rings. 174-185 - Jérémie Chalopin, Shantanu Das
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á
Routing in Carrier-Based Mobile Networks. 222-233 - Thomas Nowak
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
Network Verification via Routing Table Queries. 270-281 - Vittorio Bilò
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
Optimal Time Data Gathering in Wireless Networks with Omni-Directional Antennas. 306-317
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-03-11 19:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: