|
Conferences in DBLP
- Evangelos Kranakis, Danny Krizanc, Sergio Rajsbaum
Mobile Agent Rendezvous: A Survey. [Citation Graph (0, 0)][DBLP] SIROCCO, 2006, pp:1-9 [Conf]
- Hagit Attiya
Adapting to Point Contention with Long-Lived Safe Agreement . [Citation Graph (0, 0)][DBLP] SIROCCO, 2006, pp:10-23 [Conf]
- Roger Wattenhofer
Sensor Networks: Distributed Algorithms Reloaded - or Revolutions?. [Citation Graph (0, 0)][DBLP] SIROCCO, 2006, pp:24-28 [Conf]
- Reuven Cohen, David Peleg
Local Algorithms for Autonomous Robot Systems. [Citation Graph (0, 0)][DBLP] SIROCCO, 2006, pp:29-43 [Conf]
- Dariusz R. Kowalski, Adam Malinowski
How to Meet in Anonymous Network. [Citation Graph (0, 0)][DBLP] SIROCCO, 2006, pp:44-58 [Conf]
- David Ilcinkas
Setting Port Numbers for Fast Graph Exploration. [Citation Graph (0, 0)][DBLP] SIROCCO, 2006, pp:59-69 [Conf]
- Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial
Distributed Chasing of Network Intruders. [Citation Graph (0, 0)][DBLP] SIROCCO, 2006, pp:70-84 [Conf]
- Jérémie Chalopin
Election in the Qualitative World. [Citation Graph (0, 0)][DBLP] SIROCCO, 2006, pp:85-99 [Conf]
- Bilel Derbel, Cyril Gavoille
Fast Deterministic Distributed Algorithms for Sparse Spanners. [Citation Graph (0, 0)][DBLP] SIROCCO, 2006, pp:100-114 [Conf]
- Jaap-Henk Hoepman, Shay Kutten, Zvi Lotker
Efficient Distributed Weighted Matchings on Trees. [Citation Graph (0, 0)][DBLP] SIROCCO, 2006, pp:115-129 [Conf]
- Adrian Kosowski
Approximation Strategies for Routing Edge Disjoint Paths in Complete Graphs. [Citation Graph (0, 0)][DBLP] SIROCCO, 2006, pp:130-142 [Conf]
- Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel
Short Labels by Traversal and Jumping. [Citation Graph (0, 0)][DBLP] SIROCCO, 2006, pp:143-156 [Conf]
- Nicolas Thibault, Christian Laforest
An Optimal Rebuilding Strategy for a Decremental Tree Problem. [Citation Graph (0, 0)][DBLP] SIROCCO, 2006, pp:157-170 [Conf]
- Amotz Bar-Noy, Richard E. Ladner, Tami Tamir
Optimal Delay for Media-on-Demand with Pre-loading and Pre-buffering. [Citation Graph (0, 0)][DBLP] SIROCCO, 2006, pp:171-181 [Conf]
- Philippe Raipin Parvédy, Michel Raynal, Corentin Travers
Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures. [Citation Graph (0, 0)][DBLP] SIROCCO, 2006, pp:182-196 [Conf]
- Stefan Dobrev, Rastislav Kralovic, Richard Královic, Nicola Santoro
On Fractional Dynamic Faults with Threshold. [Citation Graph (0, 0)][DBLP] SIROCCO, 2006, pp:197-211 [Conf]
- Mikhail Nesterenko, Sébastien Tixeuil
Discovering Network Topology in the Presence of Byzantine Faults. [Citation Graph (0, 0)][DBLP] SIROCCO, 2006, pp:212-226 [Conf]
- Tiziana Calamoneri, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Riccardo Silvestri
Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks. [Citation Graph (0, 0)][DBLP] SIROCCO, 2006, pp:227-239 [Conf]
- Alfredo Navarra
3-D Minimum Energy Broadcasting. [Citation Graph (0, 0)][DBLP] SIROCCO, 2006, pp:240-252 [Conf]
- Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki
Average-Time Complexity of Gossiping in Radio Networks. [Citation Graph (0, 0)][DBLP] SIROCCO, 2006, pp:253-267 [Conf]
- Tiziana Calamoneri, Emanuele G. Fusco, Richard B. Tan, Paola Vocca
L(h, 1, 1)-Labeling of Outerplanar Graphs. [Citation Graph (0, 0)][DBLP] SIROCCO, 2006, pp:268-279 [Conf]
- Graham Cormode, S. Muthukrishnan
Combinatorial Algorithms for Compressed Sensing. [Citation Graph (0, 0)][DBLP] SIROCCO, 2006, pp:280-294 [Conf]
- Davide Bilò, Luciano Gualà, Guido Proietti
On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem. [Citation Graph (0, 0)][DBLP] SIROCCO, 2006, pp:295-309 [Conf]
- Travis Gagie
Dynamic Asymmetric Communication. [Citation Graph (0, 0)][DBLP] SIROCCO, 2006, pp:310-318 [Conf]
- Boaz Patt-Shamir, Allon Shafrir
Approximate Top-k Queries in Sensor Networks. [Citation Graph (0, 0)][DBLP] SIROCCO, 2006, pp:319-333 [Conf]
- Doina Bein, Ajoy Kumar Datta, Lawrence L. Larmore
Self-stabilizing Space Optimal Synchronization Algorithms on Trees. [Citation Graph (0, 0)][DBLP] SIROCCO, 2006, pp:334-348 [Conf]
- Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan
Distance-k Information in Self-stabilizing Algorithms. [Citation Graph (0, 0)][DBLP] SIROCCO, 2006, pp:349-356 [Conf]
|