Conferences in DBLP

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

1. Mike Paterson, Heiko Schröder, Ondrej Sýkora, Imrich Vrto
   On permutation communications in all-optical rings. [Citation Graph (0, 0)][DBLP]
   SIROCCO, 1998, pp:1-9 [Conf]
   
2. Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano
   Wavelength Routing of Symmetric Communication Requests in Directed Fiber Trees. [Citation Graph (0, 0)][DBLP]
   SIROCCO, 1998, pp:10-19 [Conf]
   
3. Savio S. H. Tse, Francis C. M. Lau
   Adaptive broadcast-confirm algorithms in general networks and their analysis. [Citation Graph (0, 0)][DBLP]
   SIROCCO, 1998, pp:20-35 [Conf]
   
4. Olivier Delmas
   Trade-off for broadcast protocols. [Citation Graph (0, 0)][DBLP]
   SIROCCO, 1998, pp:36-50 [Conf]
   
5. Bertrand Ducourthial
   New operators for computing with associative nets. [Citation Graph (0, 0)][DBLP]
   SIROCCO, 1998, pp:51-65 [Conf]
   
6. Amber Settle, Janos Simon
   Improved bounds for the firing synchronization problem. [Citation Graph (0, 0)][DBLP]
   SIROCCO, 1998, pp:66-81 [Conf]
   
7. Evangelos Kranakis, Andrzej Pelc, Anthony Spatharis
   Optimal Adaptive Fault Diagnosis for Simple Multiprocessor Systems. [Citation Graph (0, 0)][DBLP]
   SIROCCO, 1998, pp:82-97 [Conf]
   
8. Pierre Fraigniaud, Cyril Gavoille
   A Theoretical Model for Routing Complexity. [Citation Graph (0, 0)][DBLP]
   SIROCCO, 1998, pp:98-113 [Conf]
   
9. Stefan Dobrev
   An Alternative View on Sense of Direction (Position paper). [Citation Graph (0, 0)][DBLP]
   SIROCCO, 1998, pp:114-128 [Conf]
   
10. Esther Jennings, Svante Carlsson
    An optimal distributed 3-edge-connected component algorithm. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1998, pp:129-144 [Conf]
    
11. Roger Wattenhofer, Peter Widmayer
    The counting pyramid: an adaptive distributed counting scheme. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1998, pp:145-157 [Conf]
    
12. Satoshi Fujita
    Neighbourhood Information Dissemination in the Star Graph. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1998, pp:158-172 [Conf]
    
13. Stefan Dobrev, Peter Ruzicka, Gerard Tel
    Time and Bit Optimal Broadcasting on Anonymous Unoriented Hypercubes. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1998, pp:173-187 [Conf]
    
14. Fabrizio Luccio, Mohammed Mahafzah, Mahmoud Al-Omari, Linda Pagli
    Routing with the use of masks. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1998, pp:188-200 [Conf]
    
15. Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan
    Characterization results of all shortest paths interval routing schemes. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1998, pp:201-213 [Conf]
    
16. Pilar de la Torre, Lata Narayanan, David Peleg
    Thy Neighbor's Interval is Greener: A Proposal for Exploiting Interval Routing Schemes (Position paper). [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1998, pp:214-228 [Conf]
    
17. Ajoy Kumar Datta, Colette Johnen, Franck Petit, Vincent Villain
    Self-stabilizing depth-first token circulation in arbitrary rooted networks. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1998, pp:229-243 [Conf]
    
18. Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis
    The Global Efficiency of Distributed, Rate-Based, Flow Control Algorithms. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1998, pp:244-258 [Conf]
    
19. Michal Soch, Pavel Tvrdík
    Time-optimal gossip in noncombining 3-D tori. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1998, pp:259-271 [Conf]