7. SIROCCO 2000:
Laquila,
Italy
Michele Flammini, Enrico Nardelli, Guido Proietti, Paul G. Spirakis (Eds.):
SIROCCO 7, Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity, Laquila, Italy, June 20-22, 2000.
Carleton Scientific 2000 
@proceedings{DBLP:conf/sirocco/2000,
editor = {Michele Flammini and
Enrico Nardelli and
Guido Proietti and
Paul G. Spirakis},
title = {SIROCCO 7, Proceedings of the 7th International Colloquium on
Structural Information and Communication Complexity, Laquila,
Italy, June 20-22, 2000},
booktitle = {SIROCCO},
publisher = {Carleton Scientific},
year = {2000},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
- Roberto Baldoni, Jean-Michel Hélary, Michel Raynal, Lénaick Tanguy:
Consensus in byzantine asynchronous systems.
1-15
- René Beier, Jop F. Sibeyn:
A powerful heuristic for telephone gossiping.
17-35
- Paolo Boldi, Sebastiano Vigna:
Lower bounds for (weak) sense of direction.
37-46
- Marc Bui, Sajal K. Das, Ajoy Kumar Datta, Dai Tho Nguyen:
Randomized mobile agent based routing in wireless networks.
47-61
- Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum:
Exact communication costs for consensus and leader in a tree.
63-77
- Stefan Dobrev:
Efficient wakeup in anonymous oriented complete graphs.
79-93
- Bertrand Ducourthial, Sébastien Tixeuil:
Self-stabilization with path algebra.
95-109
- Paola Flocchini, Rastislav Kralovic, Alessandro Roncato, Peter Ruzicka, Nicola Santoro:
On time versus size for monotone dynamic monopolies in regular topologies.
111-125
- Cyril Gavoille, Akka Zemmari:
The compactness of adaptive routing tables.
127-139
- Chryssis Georgiou, Alexander A. Shvartsman:
Cooperative computing with fragmentable and mergeable groups.
141-156
- Hovhannes A. Harutyunyan:
Multiple message broadcasting in modified Knödel graph.
157-165
- Yehuda Hassin, David Peleg:
Extremal bounds for probabilistic polling in graphs.
167-180
- Jean-Michel Hélary, Giovanna Melideo, Michel Raynal:
Tracking causality in distributed systems: a suite of efficient protocols.
181-195
- Alexis Irlande, Jean-Claude König, Christian Laforest:
Construction of low-cost and low-diameter Steiner trees for multipoint groups.
197-210
- Ben H. H. Juurlink, Petr Kolman, Friedhelm Meyer auf der Heide, Ingo Rieping:
Optimal broadcast on parallel locality models.
221-225
- Fabrizio Luccio, Linda Pagli:
An algorithmic definition of interval with applications to routing.
227-236
- Yves Métivier, Gerard Tel:
Termination detection and universal graph reconstruction.
237-251
- Koji Nakano, Stephan Olariu:
A randomized leader election protocol for ad-hoc networks.
253-267
- André Raspaud, Ondrej Sýkora, Imrich Vrto:
Congestion and dilation, similarities and differences: A survey.
269-280
- Alan Roberts, Antonios Symvonis, David R. Wood:
Lower bounds for hot-potato permutation routing on trees.
281-295
- Frank K. Hwang, S. K. Chen:
The 1.5-loop network and the mixed 1.5-loop network.
297-306
Last update Fri May 25 08:39:37 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
