SIROCCO B

23 papers

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