5. SIROCCO 1998: Amalfi, Italy

@proceedings{DBLP:conf/sirocco/1998,
  editor    = {Luisa Gargano and
               David Peleg},
  title     = {SIROCCO'98, 5th International Colloquium on Structural Information
               {\&} Communication Complexity, Amalfi, Italy, June 22-24, 1998},
  booktitle = {SIROCCO},
  publisher = {Carleton Scientific},
  year      = {1998},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Mike Paterson, Heiko Schröder, Ondrej Sýkora, Imrich Vrto: On permutation communications in all-optical rings. 1-9 BibTeX
• Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano: Wavelength Routing of Symmetric Communication Requests in Directed Fiber Trees. 10-19 BibTeX
• Savio S. H. Tse, Francis C. M. Lau: Adaptive broadcast-confirm algorithms in general networks and their analysis. 20-35 BibTeX
• Olivier Delmas: Trade-off for broadcast protocols. 36-50 BibTeX
• Bertrand Ducourthial: New operators for computing with associative nets. 51-65 BibTeX
• Amber Settle, Janos Simon: Improved bounds for the firing synchronization problem. 66-81 BibTeX
• Evangelos Kranakis, Andrzej Pelc, Anthony Spatharis: Optimal Adaptive Fault Diagnosis for Simple Multiprocessor Systems. 82-97 BibTeX
• Pierre Fraigniaud, Cyril Gavoille: A Theoretical Model for Routing Complexity. 98-113 BibTeX
• Stefan Dobrev: An Alternative View on Sense of Direction (Position paper). 114-128 BibTeX
• Esther Jennings, Svante Carlsson: An optimal distributed 3-edge-connected component algorithm. 129-144 BibTeX
• Roger Wattenhofer, Peter Widmayer: The counting pyramid: an adaptive distributed counting scheme. 145-157 BibTeX
• Satoshi Fujita: Neighbourhood Information Dissemination in the Star Graph. 158-172 BibTeX
• Stefan Dobrev, Peter Ruzicka, Gerard Tel: Time and Bit Optimal Broadcasting on Anonymous Unoriented Hypercubes. 173-187 BibTeX
• Fabrizio Luccio, Mohammed Mahafzah, Mahmoud Al-Omari, Linda Pagli: Routing with the use of masks. 188-200 BibTeX
• Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan: Characterization results of all shortest paths interval routing schemes. 201-213 BibTeX
• Pilar de la Torre, Lata Narayanan, David Peleg: Thy Neighbor's Interval is Greener: A Proposal for Exploiting Interval Routing Schemes (Position paper). 214-228 BibTeX
• Ajoy Kumar Datta, Colette Johnen, Franck Petit, Vincent Villain: Self-stabilizing depth-first token circulation in arbitrary rooted networks. 229-243 BibTeX
• Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis: The Global Efficiency of Distributed, Rate-Based, Flow Control Algorithms. 244-258 BibTeX
• Michal Soch, Pavel Tvrdík: Time-optimal gossip in noncombining 3-D tori. 259-271 BibTeX