Conferences in DBLP

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

1. Roberto Baldoni, Jean-Michel Hélary, Michel Raynal, Lénaick Tanguy
   Consensus in byzantine asynchronous systems. [Citation Graph (0, 0)][DBLP]
   SIROCCO, 2000, pp:1-15 [Conf]
   
2. René Beier, Jop F. Sibeyn
   A powerful heuristic for telephone gossiping. [Citation Graph (0, 0)][DBLP]
   SIROCCO, 2000, pp:17-35 [Conf]
   
3. Paolo Boldi, Sebastiano Vigna
   Lower bounds for (weak) sense of direction. [Citation Graph (0, 0)][DBLP]
   SIROCCO, 2000, pp:37-46 [Conf]
   
4. Marc Bui, Sajal K. Das, Ajoy Kumar Datta, Dai Tho Nguyen
   Randomized mobile agent based routing in wireless networks. [Citation Graph (0, 0)][DBLP]
   SIROCCO, 2000, pp:47-61 [Conf]
   
5. Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum
   Exact communication costs for consensus and leader in a tree. [Citation Graph (0, 0)][DBLP]
   SIROCCO, 2000, pp:63-77 [Conf]
   
6. Stefan Dobrev
   Efficient wakeup in anonymous oriented complete graphs. [Citation Graph (0, 0)][DBLP]
   SIROCCO, 2000, pp:79-93 [Conf]
   
7. Bertrand Ducourthial, Sébastien Tixeuil
   Self-stabilization with path algebra. [Citation Graph (0, 0)][DBLP]
   SIROCCO, 2000, pp:95-109 [Conf]
   
8. Paola Flocchini, Rastislav Kralovic, Alessandro Roncato, Peter Ruzicka, Nicola Santoro
   On time versus size for monotone dynamic monopolies in regular topologies. [Citation Graph (0, 0)][DBLP]
   SIROCCO, 2000, pp:111-125 [Conf]
   
9. Cyril Gavoille, Akka Zemmari
   The compactness of adaptive routing tables. [Citation Graph (0, 0)][DBLP]
   SIROCCO, 2000, pp:127-139 [Conf]
   
10. Chryssis Georgiou, Alexander A. Shvartsman
    Cooperative computing with fragmentable and mergeable groups. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2000, pp:141-156 [Conf]
    
11. Hovhannes A. Harutyunyan
    Multiple message broadcasting in modified Knödel graph. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2000, pp:157-165 [Conf]
    
12. Yehuda Hassin, David Peleg
    Extremal bounds for probabilistic polling in graphs. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2000, pp:167-180 [Conf]
    
13. Jean-Michel Hélary, Giovanna Melideo, Michel Raynal
    Tracking causality in distributed systems: a suite of efficient protocols. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2000, pp:181-195 [Conf]
    
14. Alexis Irlande, Jean-Claude König, Christian Laforest
    Construction of low-cost and low-diameter Steiner trees for multipoint groups. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2000, pp:197-210 [Conf]
    
15. Ben H. H. Juurlink, Petr Kolman, Friedhelm Meyer auf der Heide, Ingo Rieping
    Optimal broadcast on parallel locality models. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2000, pp:221-225 [Conf]
    
16. Fabrizio Luccio, Linda Pagli
    An algorithmic definition of interval with applications to routing. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2000, pp:227-236 [Conf]
    
17. Yves Métivier, Gerard Tel
    Termination detection and universal graph reconstruction. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2000, pp:237-251 [Conf]
    
18. Koji Nakano, Stephan Olariu
    A randomized leader election protocol for ad-hoc networks. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2000, pp:253-267 [Conf]
    
19. André Raspaud, Ondrej Sýkora, Imrich Vrto
    Congestion and dilation, similarities and differences: A survey. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2000, pp:269-280 [Conf]
    
20. Alan Roberts, Antonios Symvonis, David R. Wood
    Lower bounds for hot-potato permutation routing on trees. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2000, pp:281-295 [Conf]
    
21. Frank K. Hwang, S. K. Chen
    The 1.5-loop network and the mixed 1.5-loop network. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2000, pp:297-306 [Conf]