default search action
19. SIROCCO 2012: Reykjavik, Iceland
- Guy Even, Magnús M. Halldórsson:
Structural Information and Communication Complexity - 19th International Colloquium, SIROCCO 2012, Reykjavik, Iceland, June 30-July 2, 2012, Revised Selected Papers. Lecture Notes in Computer Science 7355, Springer 2012, ISBN 978-3-642-31103-1 - Ioannis Caragiannis
, Christos Kalaitzis:
Space Lower Bounds for Low-Stretch Greedy Embeddings. 1-12 - Shiri Chechik, David Peleg:
The Fault Tolerant Capacitated k-Center Problem. 13-24 - Yuval Emek, Pierre Fraigniaud, Amos Korman, Shay Kutten, David Peleg:
Notions of Connectivity in Overlay Networks. 25-35 - Amotz Bar-Noy, Ben Baumer
Changing of the Guards: Strip Cover with Duty Cycling. 36-47 - Henning Hasemann, Juho Hirvonen, Joel Rybicki
Deterministic Local Algorithms, Unique Identifiers, and Fractional Graph Colouring. 48-60 - Peter Kling
An Algorithm for Online Facility Leasing. 61-72 - Martin Biely
Agreement in Directed Dynamic Networks. 73-84 - Majid Khabbazian, Stephane Durocher, Alireza Haghnegahdar:
Bounding Interference in Wireless Ad Hoc Networks with Nodes in Random Position. 85-98 - Mohsen Eftekhari Hesari, Evangelos Kranakis
Strong Connectivity of Sensor Networks with Double Antennae. 99-110 - Dongxiao Yu, Qiang-Sheng Hua, Yuexuan Wang, Haisheng Tan, Francis C. M. Lau:
Distributed Multiple-Message Broadcast in Wireless Ad-Hoc Networks under the SINR Model. 111-122 - Eyjolfur Ingi Asgeirsson, Magnús M. Halldórsson
Wireless Network Stability in the SINR Model. 123-134 - Heger Arfaoui, Pierre Fraigniaud:
What Can Be Computed without Communications? 135-146 - Vittorio Bilò
On Bidimensional Congestion Games. 147-158 - Michele Flammini
Mobile Network Creation Games. 159-170 - Carole Delporte-Gallet, Hugues Fauconnier, Hung Tran-The:
Homonyms with Forgeable Identifiers. 171-182 - Xavier Vilaça, Oksana Denysyuk, Luís E. T. Rodrigues:
Asynchrony and Collusion in the N-party BAR Transfer Problem. 183-194 - Dan Alistarh, Hagit Attiya
Early Deciding Synchronous Renaming in O( logf ) Rounds or Less. 195-206 - Jérémie Chalopin, Yves Métivier, Thomas Morsellino:
On Snapshots and Stable Properties Detection in Anonymous Fully Distributed Systems (Extended Abstract). 207-218 - Andreas Larsson, Philippas Tsigas
Self-stabilizing (k, r)-Clustering in Clock Rate-Limited Systems. 219-230 - Michel Raynal, Julien Stainer:
Increasing the Power of the Iterated Immediate Snapshot Model with Failure Detectors. 231-242 - Iftah Gamzu, Moti Medina
Improved Approximation for Orienting Mixed Graphs. 243-253 - Karine Altisen, Stéphane Devismes
Analysis of Random Walks Using Tabu Lists. 254-266 - Stefan Dobrev, Rastislav Královic
Online Graph Exploration with Advice. 267-278 - Balasingham Balamohan, Stefan Dobrev, Paola Flocchini, Nicola Santoro:
Asynchronous Exploration of an Unknown Anonymous Dangerous Graph with O(1) Pebbles. 279-290 - Samir Elouasbi, Andrzej Pelc:
Time of Anonymous Rendezvous in Trees: Determinism vs. Randomization. 291-302 - Shinji Kawai, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Randomized Rendezvous of Mobile Agents in Anonymous Unidirectional Ring Networks. 303-314 - Linda Pagli
Getting Close without Touching. 315-326 - Gianlorenzo D'Angelo
Gathering of Robots on Anonymous Grids without Multiplicity Detection. 327-338
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 2024-12-02 21:35 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: