This book constitutes the refereed proceedings of the 13th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2006, held in Chester, UK, July 2006. The book presents 24 revised full papers together with three invited talks, on topics in distributed and parallel computing, information dissemination, communication complexity, interconnection networks, high speed networks, wireless and sensor networks, mobile computing, optical computing, autonomous robots, and related areas.
Reihe
Auflage
Sprache
Verlagsort
Verlagsgruppe
Zielgruppe
Für Beruf und Forschung
Research
Illustrationen
Maße
Höhe: 23.5 cm
Breite: 15.5 cm
Gewicht
ISBN-13
978-3-540-35474-1 (9783540354741)
DOI
Schweitzer Klassifikation
Mobile Agent Rendezvous: A Survey.- Adapting to Point Contention with Long-Lived Safe Agreement.- Sensor Networks: Distributed Algorithms Reloaded - or Revolutions?.- Local Algorithms for Autonomous Robot Systems.- How to Meet in Anonymous Network.- Setting Port Numbers for Fast Graph Exploration.- Distributed Chasing of Network Intruders.- Election in the Qualitative World.- Fast Deterministic Distributed Algorithms for Sparse Spanners.- Efficient Distributed Weighted Matchings on Trees.- Approximation Strategies for Routing Edge Disjoint Paths in Complete Graphs.- Short Labels by Traversal and Jumping.- An Optimal Rebuilding Strategy for a Decremental Tree Problem.- Optimal Delay for Media-on-Demand with Pre-loading and Pre-buffering.- Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures.- On Fractional Dynamic Faults with Threshold.- Discovering Network Topology in the Presence of Byzantine Faults.- Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks.- 3-D Minimum Energy Broadcasting.- Average-Time Complexity of Gossiping in Radio Networks.- L(h,1,1)-Labeling of Outerplanar Graphs.- Combinatorial Algorithms for Compressed Sensing.- On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem.- Dynamic Asymmetric Communication.- Approximate Top-k Queries in Sensor Networks.- Self-stabilizing Space Optimal Synchronization Algorithms on Trees.- Distance-k Information in Self-stabilizing Algorithms.
