03709nam 2200601 a 450 991048478560332120200520144314.03-540-35475-110.1007/11780823(CKB)1000000000236513(SSID)ssj0000320243(PQKBManifestationID)11229378(PQKBTitleCode)TC0000320243(PQKBWorkID)10347699(PQKB)11357543(DE-He213)978-3-540-35475-8(MiAaPQ)EBC3068176(PPN)123136156(EXLCZ)99100000000023651320060519d2006 uy 0engurnn|008mamaatxtccrStructural information and communication complexity 13th international colloquium, SIROCCO 2006, Chester, UK, July 2-5, 2006 : proceedings /Paola Flocchini, Leszek Gasieniec (eds.)1st ed. 2006.Berlin Springer20061 online resource (X, 362 p.) Lecture notes in computer science,0302-9743 ;4056LNCS sublibrary. SL 1, Theoretical computer science and general issuesBibliographic Level Mode of Issuance: Monograph3-540-35474-3 Includes bibliographical references and index.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.Lecture notes in computer science ;4056.LNCS sublibrary.SL 1,Theoretical computer science and general issues.SIROCCO 2006Electronic data processingDistributed processingCongressesComputer networksCongressesElectronic data processingDistributed processingComputer networks004.6Flocchini Paola478313Gasieniec Leszek1761720Colloquium on Structural Information and Communication ComplexityMiAaPQMiAaPQMiAaPQBOOK9910484785603321Structural information and communication complexity4201324UNINA