Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4. SIROCCO 1997: Monte Veritá, Ascona, Switzerland
- Danny Krizanc, Peter Widmayer:
SIROCCO'97, 4th International Colloquium on Structural Information & Communication Complexity, Monte Verita, Ascona, Switzerland, July 24-26, 1997. Carleton Scientific 1997 - David Peleg:
Approximating Minimum Communication Spanning Trees. SIROCCO 1997: 1-11 - Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan:
On Computing Nearly Optimal Multi-Tree Paths and s, t-Numberings. SIROCCO 1997: 12-23 - Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano:
Bandwidth Allocation Algorithms on Tree-Shaped All-Optical Networks with Wavelength Converters. SIROCCO 1997: 24-39 - Pascal Berthomé, Johanne Cohen, Afonso Ferreira:
Embedding Tori in Partitioned Optical Passive Star Networks. SIROCCO 1997: 40-52 - Stefan Dobrev, Peter Ruzicka:
Linear Broadcasting and N loglog N Election in Unoriented Hypercubes. SIROCCO 1997: 53-68 - Krzysztof Diks, Andrzej Lingas, Andrzej Pelc:
An Optimal Algorithm for Broadcasting Multiple Messages in Trees. SIROCCO 1997: 69-80 - Michalis Faloutsos, Rajesh Pankaj, Kenneth C. Sevcik:
Bounds for the On-line Multicast Problem in Directed Graphs. SIROCCO 1997: 81-98 - Tamar Eilam, Shlomo Moran, Shmuel Zaks:
The Complexity of Characterization of Networks Supporting Shortest-Path Interval Routing. SIROCCO 1997: 99-111 - Savio S. H. Tse, Francis C. M. Lau:
An Optimal Lower Bound for Interval Routing in General Networks. SIROCCO 1997: 112-124 - Lata Narayanan, Jaroslav Opatrny:
Compact Routing on Chordal Rings. SIROCCO 1997: 125-137 - Uwe Schöning:
Better Expanders and Superconcentrators by Kolmogorov Complexity. SIROCCO 1997: 138-150 - David Peleg:
Size Bounds for Dynamic Monopolies. SIROCCO 1997: 151-161 - Cyril Gavoille, Marc Gengler:
An Omega(n2)-Lower Bound for Space-Efficiency of Routing Schemes of Stretch Factor Three. SIROCCO 1997: 162-175 - Fred S. Annexstein, Chris Giannella:
An Empirical Study of "Lazy" Protocols for Routing Information in Dynamic Networks. SIROCCO 1997: 176-187 - Yves Métivier, Anca Muscholl, Pierre-André Wacrenier:
About the local detection of termination of local computations in graphs. SIROCCO 1997: 188-200 - Paolo Boldi, Sebastiano Vigna:
Computing Vector Functions on Anonymous Networks. SIROCCO 1997: 201-214 - Lata Narayanan, Sunil M. Shende:
Static Frequency Assignment in Cellular Networks. SIROCCO 1997: 215-227 - Marcelo Feighelstein, Shmuel Zaks:
Duality in Chain ATM Virtual Path Layouts. SIROCCO 1997: 228-239 - Pierre Fraigniaud, Sandrine Vial:
Heuristics Algorithms for Personalized Communication Problems in Point-to-Point Networks. SIROCCO 1997: 240-252 - Michal Soch, Pavel Tvrdík:
Optimal gossip in noncombining 2D-meshes. SIROCCO 1997: 253-265 - Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis:
Advances in Rate-Based Flow Control. SIROCCO 1997: 266-281 - Arnold L. Rosenberg:
Theoretical research on networks: models and methodology. SIROCCO 1997: 282-293
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-22 20:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
