The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Jean-Claude Bermond, Sébastien Choplin, Stephane Perennes
    Hierarchical Ring Network Design. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2002, pp:1-16 [Conf]
  2. André Berthiaume, Ljubomir Perkovic, Amber Settle, Janos Simon
    New Bounds for the Firing Squad Problem on a Ring. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2002, pp:17-31 [Conf]
  3. Prosenjit Bose, Danny Krizanc, Stefan Langerman, Pat Morin
    Asymmetric Communication Protocols via Hotlink Assignments. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2002, pp:33-39 [Conf]
  4. Bogdan S. Chlebus, Karol Golab, Dariusz R. Kowalski
    Finding Spanning Forests by Broadcasting. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2002, pp:41-56 [Conf]
  5. Mark Cieliebak, Giuseppe Prencipe
    Gathering Autonomous Mobile Robots. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2002, pp:57-72 [Conf]
  6. Francesc Comellas, Margarida Mitjana, Joseph G. Peters
    Broadcasting in Small-world Communication Networks. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2002, pp:73-85 [Conf]
  7. Carole Delporte-Gallet, Hugues Fauconnier
    Latency Measures and Lower Bounds for Consensus with Failure Detectors. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2002, pp:87-100 [Conf]
  8. Stefan Dobrev
    Communication-Efficient Broadcasting in Complete Networks with Dynamic Faults. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2002, pp:101-113 [Conf]
  9. Joachim Giesen, Roger Wattenhofer, Aaron Zollinger
    Towards a Theory of Peer-to-Peer Computability. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2002, pp:115-132 [Conf]
  10. Nikolaos Glinos, Doan B. Hoang, Chi Nguyen, Antonios Symvonis
    Algorithmic Support for Video-on-Demand based on the Delayed-multicast Protocol. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2002, pp:133-148 [Conf]
  11. Emmanuel Godard, Yves Métivier
    Equivalence of Structural Knowledges in Distributed Algorithms. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2002, pp:149-164 [Conf]
  12. Frédéric Havet
    Design of Fault Tolerant Satellite Networks with Priorities via Selectors. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2002, pp:165-179 [Conf]
  13. Michael E. Houle, Antonios Symvonis, David R. Wood
    Dimension-Exchange Algorithms for Load Balancing on Trees. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2002, pp:181-196 [Conf]
  14. Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro
    Avoiding Routing Loops on the Internet. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2002, pp:197-210 [Conf]
  15. Aubin Jarry, Stephane Perennes
    Disjoint Paths in Symmetric Digraphs. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2002, pp:211-222 [Conf]
  16. Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis
    Approximate Equilibria and Ball Fusion. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2002, pp:223-235 [Conf]
  17. Rastislav Kralovic, Peter Ruzicka
    Minimum Feedback Vertex Sets in Shuffle-based Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2002, pp:237-245 [Conf]
  18. Fabrizio Luccio, Linda Pagli
    Two New Applications of Dynamos. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2002, pp:247-258 [Conf]
  19. Konrad Schlude, Eljas Soisalon-Soininen, Peter Widmayer
    Distributed Highly Available Search Trees. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2002, pp:259-274 [Conf]
  20. John Tromp, Paul M. B. Vitányi
    A Protocol for Randomized Anonymous Two-process Wait-free Test-and-Set with Finite-state Verification. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2002, pp:275-291 [Conf]
  21. Savio S. H. Tse, Francis C. M. Lau
    An Upper Bound Result for Multi-label Interval Routing on Planar Graphs. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2002, pp:293-308 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002