9. SIROCCO 2002: Andros, Greece

@proceedings{DBLP:conf/sirocco/2002,
  editor    = {Christos Kaklamanis and
               Lefteris M. Kirousis},
  title     = {SIROCCO 9, Proceedings of the 9th International Colloquium on
               Structural Information and Communication Complexity, Andros,
               Greece, June 10-12, 2002},
  booktitle = {SIROCCO},
  publisher = {Carleton Scientific},
  series    = {Proceedings in Informatics},
  volume    = {13},
  year      = {2002},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Jean-Claude Bermond, Sébastien Choplin, Stephane Perennes: Hierarchical Ring Network Design. 1-16 BibTeX
• André Berthiaume, Ljubomir Perkovic, Amber Settle, Janos Simon: New Bounds for the Firing Squad Problem on a Ring. 17-31 BibTeX
• Prosenjit Bose, Danny Krizanc, Stefan Langerman, Pat Morin: Asymmetric Communication Protocols via Hotlink Assignments. 33-39 BibTeX
• Bogdan S. Chlebus, Karol Golab, Dariusz R. Kowalski: Finding Spanning Forests by Broadcasting. 41-56 BibTeX
• Mark Cieliebak, Giuseppe Prencipe: Gathering Autonomous Mobile Robots. 57-72 BibTeX
• Francesc Comellas, Margarida Mitjana, Joseph G. Peters: Broadcasting in Small-world Communication Networks. 73-85 BibTeX
• Carole Delporte-Gallet, Hugues Fauconnier: Latency Measures and Lower Bounds for Consensus with Failure Detectors. 87-100 BibTeX
• Stefan Dobrev: Communication-Efficient Broadcasting in Complete Networks with Dynamic Faults. 101-113 BibTeX
• Joachim Giesen, Roger Wattenhofer, Aaron Zollinger: Towards a Theory of Peer-to-Peer Computability. 115-132 BibTeX
• Nikolaos Glinos, Doan B. Hoang, Chi Nguyen, Antonios Symvonis: Algorithmic Support for Video-on-Demand based on the Delayed-multicast Protocol. 133-148 BibTeX
• Emmanuel Godard, Yves Métivier: Equivalence of Structural Knowledges in Distributed Algorithms. 149-164 BibTeX
• Frédéric Havet: Design of Fault Tolerant Satellite Networks with Priorities via Selectors. 165-179 BibTeX
• Michael E. Houle, Antonios Symvonis, David R. Wood: Dimension-Exchange Algorithms for Load Balancing on Trees. 181-196 BibTeX
• Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro: Avoiding Routing Loops on the Internet. 197-210 BibTeX
• Aubin Jarry, Stephane Perennes: Disjoint Paths in Symmetric Digraphs. 211-222 BibTeX
• Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis: Approximate Equilibria and Ball Fusion. 223-235 BibTeX
• Rastislav Kralovic, Peter Ruzicka: Minimum Feedback Vertex Sets in Shuffle-based Interconnection Networks. 237-245 BibTeX
• Fabrizio Luccio, Linda Pagli: Two New Applications of Dynamos. 247-258 BibTeX
• Konrad Schlude, Eljas Soisalon-Soininen, Peter Widmayer: Distributed Highly Available Search Trees. 259-274 BibTeX
• John Tromp, Paul M. B. Vitányi: A Protocol for Randomized Anonymous Two-process Wait-free Test-and-Set with Finite-state Verification. 275-291 BibTeX
• Savio S. H. Tse, Francis C. M. Lau: An Upper Bound Result for Multi-label Interval Routing on Planar Graphs. 293-308 BibTeX