4. SIROCCO 1997: Monte Veritá, Ascona, Switzerland

@proceedings{DBLP:conf/sirocco/1997,
  editor    = {Danny Krizanc and
               Peter Widmayer},
  title     = {SIROCCO'97, 4th International Colloquium on Structural Information
               {\&} Communication Complexity, Monte Verita, Ascona, Switzerland,
               July 24-26, 1997},
  booktitle = {SIROCCO},
  publisher = {Carleton Scientific},
  year      = {1997},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• David Peleg: Approximating Minimum Communication Spanning Trees. 1-11 BibTeX
• Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan: On Computing Nearly Optimal Multi-Tree Paths and s, t-Numberings. 12-23 BibTeX
• Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano: Bandwidth Allocation Algorithms on Tree-Shaped All-Optical Networks with Wavelength Converters. 24-39 BibTeX
• Pascal Berthomé, Johanne Cohen, Afonso Ferreira: Embedding Tori in Partitioned Optical Passive Star Networks. 40-52 BibTeX
• Stefan Dobrev, Peter Ruzicka: Linear Broadcasting and N loglog N Election in Unoriented Hypercubes. 53-68 BibTeX
• Krzysztof Diks, Andrzej Lingas, Andrzej Pelc: An Optimal Algorithm for Broadcasting Multiple Messages in Trees. 69-80 BibTeX
• Michalis Faloutsos, Rajesh Pankaj, Kenneth C. Sevcik: Bounds for the On-line Multicast Problem in Directed Graphs. 81-98 BibTeX
• Tamar Eilam, Shlomo Moran, Shmuel Zaks: The Complexity of Characterization of Networks Supporting Shortest-Path Interval Routing. 99-111 BibTeX
• Savio S. H. Tse, Francis C. M. Lau: An Optimal Lower Bound for Interval Routing in General Networks. 112-124 BibTeX
• Lata Narayanan, Jaroslav Opatrny: Compact Routing on Chordal Rings. 125-137 BibTeX
• Uwe Schöning: Better Expanders and Superconcentrators by Kolmogorov Complexity. 138-150 BibTeX
• David Peleg: Size Bounds for Dynamic Monopolies. 151-161 BibTeX
• Cyril Gavoille, Marc Gengler: An Omega(n2)-Lower Bound for Space-Efficiency of Routing Schemes of Stretch Factor Three. 162-175 BibTeX
• Fred S. Annexstein, Chris Giannella: An Empirical Study of "Lazy" Protocols for Routing Information in Dynamic Networks. 176-187 BibTeX
• Yves Métivier, Anca Muscholl, Pierre-André Wacrenier: About the local detection of termination of local computations in graphs. 188-200 BibTeX
• Paolo Boldi, Sebastiano Vigna: Computing Vector Functions on Anonymous Networks. 201-214 BibTeX
• Lata Narayanan, Sunil M. Shende: Static Frequency Assignment in Cellular Networks. 215-227 BibTeX
• Marcelo Feighelstein, Shmuel Zaks: Duality in Chain ATM Virtual Path Layouts. 228-239 BibTeX
• Pierre Fraigniaud, Sandrine Vial: Heuristics Algorithms for Personalized Communication Problems in Point-to-Point Networks. 240-252 BibTeX
• Michal Soch, Pavel Tvrdík: Optimal gossip in noncombining 2D-meshes. 253-265 BibTeX
• Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis: Advances in Rate-Based Flow Control. 266-281 BibTeX
• Arnold L. Rosenberg: Theoretical research on networks: models and methodology. 282-293 BibTeX