结构信息与通信复杂性
2006-12
湖北辞书出版社
Flocchini, Paola; Gasieniec, Leszek;
356
This book constitutes the refereed proceedings of the 13th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2006, held in Chester, UK, in July 2006. The 24 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 68 submissions. The papers address issues such as 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. The papers are organized in topical sections on robots, routing, distributed algorithms, fault tolerance, radio networks, and self-stabilizing alorgithms.
Mobile Agent Rendezvous: A SurveyAdapting to Point Contention with Long-Lived Safe AgreementSensor Networks: Distributed Algorithms Reloaded or Revolutions?Local Algorithms for Autonomous Robot SystemsHow to Meet in Anonymous NetworkSetting Port Numbers for Fast Graph ExplorationDistributed Chasing of Network IntrudersElection in the Qualitative WorldFast Deterministic Distributed Algorithms for Sparse SpannersEfficient Distributed Weighted Matchings on TreesApproximation Strategies for Routing Edge Disjoint Paths in Complete GraphsShort Labels by Traversal and JumpingAn Optimal Rebuilding Strategy for a Decremental Tree ProblemOptimal Delay for Media-on-Demand with Pre-loading and Pre-bufferingStrongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission FailuresOn Fractional Dynamic Faults with ThresholdDiscovering Network Topology in the Presence of Byzantine FaultsMinimum Energy Broadcast and Disk Cover in Grid Wireless Networks3-D Minimum Energy BroadcastingAverage-Time Complexity of Gossiping in Radio NetworksL(h,l,1)-Labeling of Outerplanar GraphsCombinatorial Algorithms for Compressed SensingOn the Existence of Truthful Mechanisms for the Minimum-CostApproximate Shortest-Paths Tree ProblemDynamic Asymmetric Communication Approximate Top-k Queries in Sensor NetworksSelf-stabilizing Space Optimal Synchronization Algorithms on TreesDistance-k Information in Self-stabilizing AlgorithmsAuthor Index
