The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Amotz Bar-Noy
    Cellular Networks: Where Are the Mobile Users? [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:1- [Conf]
  2. Cyril Gavoille
    Distributed Data Structures: A Survey. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:2- [Conf]
  3. Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano
    On Designing Truthful Mechanisms for Online Scheduling. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:3-17 [Conf]
  4. Amos Beimel
    On Private Computation in Incomplete Networks. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:18-33 [Conf]
  5. Jean-Claude Bermond, Laurent Braud, David Coudert
    Traffic Grooming on the Path. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:34-48 [Conf]
  6. Davide Bilò, Guido Proietti
    Range Augmentation Problems in Static Ad-Hoc Wireless Networks. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:49-64 [Conf]
  7. Tiziana Calamoneri, Paola Vocca
    On the Approximability of the L(h, k)-Labelling Problem on Bipartite Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:65-77 [Conf]
  8. Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou
    A Tight Bound for Online Coloring of Disk Graphs. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:78-88 [Conf]
  9. Andrea E. F. Clementi, Miriam Di Ianni, Angelo Monti, Massimo Lauria, Gianluca Rossi, Riccardo Silvestri
    Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:89-98 [Conf]
  10. Shantanu Das, Paola Flocchini, Amiya Nayak, Nicola Santoro
    Distributed Exploration of an Unknown Graph. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:99-114 [Conf]
  11. Yefim Dinitz, Noam Solomon
    Two Absolute Bounds for Distributed Bit Complexity. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:115-126 [Conf]
  12. Shlomi Dobrev, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
    Finding Short Right-Hand-on-the-Wall Walks in Graphs. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:127-139 [Conf]
  13. Pierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum, Sébastien Tixeuil
    Space Lower Bounds for Graph Exploration via Reduced Automata. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:140-154 [Conf]
  14. Markus Hinkelmann, Andreas Jakoby
    Communications in Unknown Networks: Preserving the Secret of Topology. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:155-169 [Conf]
  15. Taisuke Izumi, Toshimitsu Masuzawa
    An Improved Algorithm for Adaptive Condition-Based Consensus. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:170-184 [Conf]
  16. Branislav Katreniak
    Biangular Circle Formation by Asynchronous Mobile Robots. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:185-199 [Conf]
  17. Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco
    Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:200-215 [Conf]
  18. Rastislav Kralovic, Richard Královic
    On Semi-perfect 1-Factorizations. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:216-230 [Conf]
  19. Paolo Penna, Carmine Ventre
    Free-Riders in Steiner Tree Cost-Sharing Games. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:231-245 [Conf]
  20. Giuseppe Prencipe
    On the Feasibility of Gathering by Autonomous Mobile Robots. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:246-261 [Conf]
  21. Nicola Santoro, Peter Widmayer
    Majority and Unanimity in Synchronous Networks with Ubiquitous Dynamic Faults. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:262-276 [Conf]
  22. Mordechai Shalom, Shmuel Zaks
    Minimizing the Number of ADMs in SONET Rings with Maximum Throughput. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:277-291 [Conf]
  23. Rui Wang, Francis C. M. Lau
    Optimal Gossiping in Square Meshes in All-Port Mode and with Short Packets. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:292-306 [Conf]
  24. Mirjam Wattenhofer, Roger Wattenhofer, Peter Widmayer
    Geometric Routing Without Geometry. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:307-322 [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