Skip to main content
  • Conference proceedings
  • © 2005

Structural Information and Communication Complexity

12th International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005, Proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 3499)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): SIROCCO: International Colloquium on Structural Information and Communication Complexity

Conference proceedings info: SIROCCO 2005.

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (24 papers)

  1. Front Matter

  2. Distributed Data Structures: A Survey

    • Cyril Gavoille
    Pages 2-2
  3. On Designing Truthful Mechanisms for Online Scheduling

    • Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano
    Pages 3-17
  4. Traffic Grooming on the Path

    • Jean-Claude Bermond, Laurent Braud, David Coudert
    Pages 34-48
  5. Range Augmentation Problems in Static Ad-Hoc Wireless Networks

    • Davide Bilò, Guido Proietti
    Pages 49-64
  6. A Tight Bound for Online Coloring of Disk Graphs

    • Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou
    Pages 78-88
  7. Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances

    • Andrea E. F. Clementi, Miriam Di Ianni, Angelo Monti, Massimo Lauria, Gianluca Rossi, Riccardo Silvestri
    Pages 89-98
  8. Distributed Exploration of an Unknown Graph

    • Shantanu Das, Paola Flocchini, Amiya Nayak, Nicola Santoro
    Pages 99-114
  9. Two Absolute Bounds for Distributed Bit Complexity

    • Yefim Dinitz, Noam Solomon
    Pages 115-126
  10. Finding Short Right-Hand-on-the-Wall Walks in Graphs

    • Stefan Dobrev, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
    Pages 127-139
  11. Space Lower Bounds for Graph Exploration via Reduced Automata

    • Pierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum, Sébastien Tixeuil
    Pages 140-154
  12. Communications in Unknown Networks: Preserving the Secret of Topology

    • Markus Hinkelmann, Andreas Jakoby
    Pages 155-169
  13. An Improved Algorithm for Adaptive Condition-Based Consensus

    • Taisuke Izumi, Toshimitsu Masuzawa
    Pages 170-184
  14. Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs

    • Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco
    Pages 200-215
  15. On Semi-perfect 1-Factorizations

    • Rastislav Královič, Richard Královič
    Pages 216-230
  16. Free-Riders in Steiner Tree Cost-Sharing Games

    • Paolo Penna, Carmine Ventre
    Pages 231-245

Other Volumes

  1. Structural Information and Communication Complexity

About this book

This book constitutes the refereed proceedings of the 12th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2005, held in Mont Saint-Michel, France in May 2005.

The 22 revised full papers presented were carefully reviewed and selected from 48 submissions. The papers address issues such as topics in distributed and parallel computing, information dissemination, communication complexity, interconnection networks, high speed networks, wireless networking, mobile computing, optical computing, and related areas.

Keywords

  • Routing
  • algorithms
  • approximation
  • automata
  • combinatorial optimization
  • communication complexity
  • complexity
  • consens algorithms
  • data structures
  • game theory
  • gossiping
  • graphs algorithms
  • network routing
  • networking complexity
  • structural complexity
  • algorithm analysis and problem complexity

Editors and Affiliations

  • Département d’informatique, Université du Québec en Outaouais, Gatineau, Canada

    Andrzej Pelc

  • IRISA, Université de Rennes, France

    Michel Raynal

Bibliographic Information

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions