Structural Information and Communication Complexity - 13th International Colloquium, SIROCCO 2006, Chester, UK, July 2-5, 2006, Proceedings

List of contents

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.

Product details

• Assisted by: Paola Flocchini (Editor), Leszek Gasieniec (Editor)
• Publisher: Springer, Berlin
• Languages: English
• Product format: Paperback / Softback
• Released: 01.01.2006
• EAN: 9783540354741
• ISBN: 978-3-540-35474-1
• No. of pages: 362
• Dimensions: 155 mm x 20 mm x 235 mm
• Weight: 622 g
• Illustrations: X, 362 p.
• Series: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues
• Subjects: Natural sciences, medicine, IT, technology > IT, data processing > Data communication, networks; C, Algorithmen und Datenstrukturen, Data Science, Algorithms, Datenbanken, Diskrete Mathematik, Mathematik für Informatiker, computer science, Computer Communication Networks, Discrete Mathematics in Computer Science, Discrete Mathematics, Algorithms & data structures, Numerical analysis, Computer science—Mathematics, Maths for computer scientists, Algorithm Analysis and Problem Complexity, Data structures (Computer science), Data Structures, Computer communication systems, network computing