Conferences in DBLP

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

1. Lali Barrière, Stefan Dobrev
   Leader Election in Abelian Cayley Graphs. [Citation Graph (0, 0)][DBLP]
   SIROCCO, 2001, pp:5-20 [Conf]
   
2. Jean-Claude Bermond, Lilian Chacon, David Coudert, François Tillerot
   Cycle Covering. [Citation Graph (0, 0)][DBLP]
   SIROCCO, 2001, pp:21-34 [Conf]
   
3. Prosenjit Bose, Pat Morin
   Competitive Online Routing in Geometric Graphs. [Citation Graph (0, 0)][DBLP]
   SIROCCO, 2001, pp:35-44 [Conf]
   
4. Stefan D. Bruda, Selim G. Akl
   Parallel Real-Time Complexity A Strong Infinite Hierarchy. [Citation Graph (0, 0)][DBLP]
   SIROCCO, 2001, pp:45-60 [Conf]
   
5. Sébastien Cantarell, Ajoy Kumar Datta, Franck Petit, Vincent Villain
   Group Mutual Exclusion in Token Rings. [Citation Graph (0, 0)][DBLP]
   SIROCCO, 2001, pp:61-76 [Conf]
   
6. Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
   New Bounds on the Size of the Minimum Feedback Vertex Set in Meshes and Butterflies. [Citation Graph (0, 0)][DBLP]
   SIROCCO, 2001, pp:77-88 [Conf]
   
7. Victor Chepoi, Alexis Rollin
   Interval Routing in Some Planar Quadrangulations. [Citation Graph (0, 0)][DBLP]
   SIROCCO, 2001, pp:89-104 [Conf]
   
8. Peter Damaschke
   Worst-case bounds for blind broadcasting in small-degree networks. [Citation Graph (0, 0)][DBLP]
   SIROCCO, 2001, pp:105-116 [Conf]
   
9. Michael Elkin, David Peleg
   The Client-Server 2-Spanner Problem with Applications to Network Design. [Citation Graph (0, 0)][DBLP]
   SIROCCO, 2001, pp:117-132 [Conf]
   
10. Guillaume Fertin, André Raspaud
    k-Neighborhood Broadcasting. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2001, pp:133-146 [Conf]
    
11. Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer
    Pattern Formation by Anonymous Robots Without Chirality. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2001, pp:147-162 [Conf]
    
12. Yashar Ganjali
    Characterization of Networks Supporting Multi-dimensional Linear Interval Routing Schemes. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2001, pp:163-178 [Conf]
    
13. Emmanuel Godard, Yves Métivier
    A Characterization of Classes of GraphsRecognizable by Local Computations with Initial Knowledge. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2001, pp:179-194 [Conf]
    
14. Peter Gvozdjak, Joseph G. Peters
    Modelling Links in Inclined LEO Satellite Networks. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2001, pp:195-208 [Conf]
    
15. Paul R. Hafner
    On the graphs of McKay-Miller-Sirán. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2001, pp:209-216 [Conf]
    
16. Alexander Kesselman, Yishay Mansour
    QoS-Competitive Video Buffering. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2001, pp:217-230 [Conf]
    
17. Rastislav Kralovic, Peter Ruzicka
    On Immunity and Catastrophic Indices of Graphs. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2001, pp:231-242 [Conf]
    
18. Martin Makuch, Peter Ruzicka
    On the Complexity of Path Layouts in Bounded Degree ATM Networks A Case Study for Butterfly Networks. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2001, pp:243-258 [Conf]
    
19. Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman
    Optimal Scheduling for Distributed Cooperation Without Communication. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2001, pp:259-274 [Conf]
    
20. Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, Matthieu Roy
    Efficient Condition-Based Consensus. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2001, pp:275-292 [Conf]
    
21. Toshio Nakata, Masafumi Yamashita
    Some Upper Bounds on Expected Agreement Time of a Probabilistic Local Majority Polling Game. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2001, pp:293-304 [Conf]
    
22. Andre Osterloh
    Oblivious Routing on d-Dimensional Meshes. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2001, pp:305-320 [Conf]
    
23. Petr Salinger, Pavel Tvrdík
    Broadcasting in all-output-port cube-connected cycles with distance-insensitive routing. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2001, pp:321-336 [Conf]
    
24. John Watkinson, Micah Adler, Faith E. Fich
    New Protocols for Asymmetric Communication Channels. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2001, pp:337-350 [Conf]
    
25. Norbert Zeh, Nicola Santoro
    On Finding Minimum Deadly Sets for Directed Networks. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2001, pp:351-366 [Conf]