LEADER 04699nam 22007695 450 001 9910484785603321 005 20251226202954.0 010 $a3-540-35475-1 024 7 $a10.1007/11780823 035 $a(CKB)1000000000236513 035 $a(SSID)ssj0000320243 035 $a(PQKBManifestationID)11229378 035 $a(PQKBTitleCode)TC0000320243 035 $a(PQKBWorkID)10347699 035 $a(PQKB)11357543 035 $a(DE-He213)978-3-540-35475-8 035 $a(MiAaPQ)EBC3068176 035 $a(PPN)123136156 035 $a(BIP)34164124 035 $a(BIP)13513380 035 $a(EXLCZ)991000000000236513 100 $a20100301d2006 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aStructural Information and Communication Complexity $e13th International Colloquium, SIROCCO 2006, Chester, UK, July 2-5, 2006, Proceedings /$fedited by Paola Flocchini, Leszek Gasieniec 205 $a1st ed. 2006. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2006. 215 $a1 online resource (X, 362 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4056 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-35474-3 320 $aIncludes bibliographical references and index. 327 $aMobile 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. 330 $aThis 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4056 606 $aComputer networks 606 $aAlgorithms 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aArtificial intelligence$xData processing 606 $aComputer Communication Networks 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aData Science 615 0$aComputer networks. 615 0$aAlgorithms. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aArtificial intelligence$xData processing. 615 14$aComputer Communication Networks. 615 24$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aData Science. 676 $a004.6 701 $aFlocchini$b Paola$0478313 701 $aGa?sieniec$b Leszek$01761720 712 12$aColloquium on Structural Information and Communication Complexity 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484785603321 996 $aStructural information and communication complexity$94201324 997 $aUNINA