Skip to main content
SpringerLink
Log in

Structural Information and Communication Complexity

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

  • Conference proceedings
  • © 2005

Overview

Editors:
  1. Andrzej Pelc

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Michel Raynal

    1. IRISA, Université de Rennes, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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)

Included in the following conference series:

Conference proceedings info: SIROCCO 2005.

This is a preview of subscription content, log in via an institution to check access.

Access this book

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

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (24 papers)

  1. Front Matter

    Download chapter PDF

  2. Cellular Networks: Where Are the Mobile Users?

    • Amotz Bar-Noy
    Pages 1-1

  3. Distributed Data Structures: A Survey

    • Cyril Gavoille
    Pages 2-2

  4. On Designing Truthful Mechanisms for Online Scheduling

    • Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano
    Pages 3-17

  5. On Private Computation in Incomplete Networks

    • Amos Beimel
    Pages 18-33

  6. Traffic Grooming on the Path

    • Jean-Claude Bermond, Laurent Braud, David Coudert
    Pages 34-48

  7. Range Augmentation Problems in Static Ad-Hoc Wireless Networks

    • Davide Bilò, Guido Proietti
    Pages 49-64

  8. On the Approximability of the L(h,k)-Labelling Problem on Bipartite Graphs (Extended Abstract)

    • Tiziana Calamoneri, Paola Vocca
    Pages 65-77

  9. A Tight Bound for Online Coloring of Disk Graphs

    • Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou
    Pages 78-88

  10. 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

  11. Distributed Exploration of an Unknown Graph

    • Shantanu Das, Paola Flocchini, Amiya Nayak, Nicola Santoro
    Pages 99-114

  12. Two Absolute Bounds for Distributed Bit Complexity

    • Yefim Dinitz, Noam Solomon
    Pages 115-126

  13. Finding Short Right-Hand-on-the-Wall Walks in Graphs

    • Stefan Dobrev, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
    Pages 127-139

  14. Space Lower Bounds for Graph Exploration via Reduced Automata

    • Pierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum, Sébastien Tixeuil
    Pages 140-154

  15. Communications in Unknown Networks: Preserving the Secret of Topology

    • Markus Hinkelmann, Andreas Jakoby
    Pages 155-169

  16. An Improved Algorithm for Adaptive Condition-Based Consensus

    • Taisuke Izumi, Toshimitsu Masuzawa
    Pages 170-184

  17. Biangular Circle Formation by Asynchronous Mobile Robots

    • Branislav Katreniak
    Pages 185-199

  18. Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs

    • Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco
    Pages 200-215

  19. On Semi-perfect 1-Factorizations

    • Rastislav Královič, Richard Královič
    Pages 216-230

  20. Free-Riders in Steiner Tree Cost-Sharing Games

    • Paolo Penna, Carmine Ventre
    Pages 231-245
Back to top

Other volumes

  1. Structural Information and Communication Complexity

Keywords

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.

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

Publish with us

Policies and ethics

Back to top

Search

Navigation