Skip to main content
  • Conference proceedings
  • © 2007

Structural Information and Communication Complexity

14th International Colloquium, SIROCCO 2007, Castiglioncello, Italy, June 5-8, 2007, Proceedings

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

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

Buy it now

Buying options

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

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

Table of contents (26 papers)

  1. Front Matter

  2. Session 1. Invited Talks

    1. Treewidth: Structure and Algorithms

      • Hans L. Bodlaender
      Pages 11-25
  3. Session 2. Autonomous Systems: Graph Exploration

    1. Fast Periodic Graph Exploration with Constant Memory

      • Leszek Gąsieniec, Ralf Klasing, Russell Martin, Alfredo Navarra, Xiaohui Zhang
      Pages 26-40
    2. Why Robots Need Maps

      • Miroslaw Dynia, Jakub Łopuszański, Christian Schindelhauer
      Pages 41-50
    3. Graph Searching with Advice

      • Nicolas Nisse, David Soguet
      Pages 51-65
  4. Session 3. Distributed Algorithms: Fault Tolerance

    1. From Renaming to Set Agreement

      • Achour Mostefaoui, Michel Raynal, Corentin Travers
      Pages 66-80
    2. A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives

      • Victor Chepoi, Tristan Fevat, Emmanuel Godard, Yann Vaxès
      Pages 81-95
    3. A New Self-stabilizing Maximal Matching Algorithm

      • Fredrik Manne, Morten Mjelde, Laurence Pilard, Sébastien Tixeuil
      Pages 96-108
  5. Session 4. Distributed Algorithms and Data Structures

    1. Labeling Schemes with Queries

      • Amos Korman, Shay Kutten
      Pages 109-123
    2. A Simple Optimistic Skiplist Algorithm

      • Maurice Herlihy, Yossi Lev, Victor Luchangco, Nir Shavit
      Pages 124-138
    3. Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs

      • Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie, Andrea Vitaletti
      Pages 139-150
  6. Session 5. Autonomous Systems: Location Problems

    1. Optimal Moves for Gossiping Among Mobile Agents

      • Tomoko Suzuki, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa
      Pages 151-165
    2. Swing Words to Make Circle Formation Quiescent

      • Yoann Dieudonné, Franck Petit
      Pages 166-179
  7. Session 6. Wireless Networks

    1. Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs

      • Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Jorge Urrutia
      Pages 195-207
    2. Proxy Assignments for Filling Gaps in Wireless Ad-Hoc Lattice Computers

      • Tiziana Calamoneri, Emanuele G. Fusco, Anil M. Shende, Sunil M. Shende
      Pages 208-221
    3. Location Oblivious Distributed Unit Disk Graph Coloring

      • Mathieu Couture, Michel Barbeau, Prosenjit Bose, Paz Carmi, Evangelos Kranakis
      Pages 222-233
  8. Session 7. Communication Networks: Fault Tolerance

    1. Edge Fault-Diameter of Cartesian Product of Graphs

      • Iztok Banič, Janez Žerovnik
      Pages 234-245

Other Volumes

  1. Structural Information and Communication Complexity

Bibliographic Information

Buy it now

Buying options

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