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