Abstract is missing.
- Consensus in byzantine asynchronous systemsRoberto Baldoni, Jean-Michel Hélary, Michel Raynal, Lénaick Tanguy. 1-15
- A powerful heuristic for telephone gossipingRené Beier, Jop F. Sibeyn. 17-35
- Lower bounds for (weak) sense of directionPaolo Boldi, Sebastiano Vigna. 37-46
- Randomized mobile agent based routing in wireless networksMarc Bui, Sajal K. Das, Ajoy Kumar Datta, Dai Tho Nguyen. 47-61
- Exact communication costs for consensus and leader in a treeYefim Dinitz, Shlomo Moran, Sergio Rajsbaum. 63-77
- Efficient wakeup in anonymous oriented complete graphsStefan Dobrev. 79-93
- Self-stabilization with path algebraBertrand Ducourthial, Sébastien Tixeuil. 95-109
- On time versus size for monotone dynamic monopolies in regular topologiesPaola Flocchini, Rastislav Kralovic, Alessandro Roncato, Peter Ruzicka, Nicola Santoro. 111-125
- The compactness of adaptive routing tablesCyril Gavoille, Akka Zemmari. 127-139
- Cooperative computing with fragmentable and mergeable groupsChryssis Georgiou, Alexander A. Shvartsman. 141-156
- Multiple message broadcasting in modified Knödel graphHovhannes A. Harutyunyan. 157-165
- Extremal bounds for probabilistic polling in graphsYehuda Hassin, David Peleg. 167-180
- Tracking causality in distributed systems: a suite of efficient protocolsJean-Michel Hélary, Giovanna Melideo, Michel Raynal. 181-195
- Construction of low-cost and low-diameter Steiner trees for multipoint groupsAlexis Irlande, Jean-Claude König, Christian Laforest. 197-210
- Optimal broadcast on parallel locality modelsBen H. H. Juurlink, Petr Kolman, Friedhelm Meyer auf der Heide, Ingo Rieping. 221-225
- An algorithmic definition of interval with applications to routingFabrizio Luccio, Linda Pagli. 227-236
- Termination detection and universal graph reconstructionYves Métivier, Gerard Tel. 237-251
- A randomized leader election protocol for ad-hoc networksKoji Nakano, Stephan Olariu. 253-267
- Congestion and dilation, similarities and differences: A surveyAndré Raspaud, Ondrej Sýkora, Imrich Vrto. 269-280
- Lower bounds for hot-potato permutation routing on treesAlan Roberts, Antonios Symvonis, David R. Wood. 281-295
- The 1.5-loop network and the mixed 1.5-loop networkFrank K. Hwang, S. K. Chen. 297-306