Conferences in DBLP

Colloquium on Structural Information & Communication Complexity (sirocco)
1997 (conf/sirocco/1997)

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