04140nam 22006975 450 99646593600331620230406052938.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)99100000000023651320100301d2006 u| 0engurnn|008mamaatxtccrStructural Information and Communication Complexity[electronic resource] 13th International Colloquium, SIROCCO 2006, Chester, UK, July 2-5, 2006, Proceedings /edited by Paola Flocchini, Leszek Gasieniec1st ed. 2006.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2006.1 online resource (X, 362 p.) Theoretical Computer Science and General Issues,2512-2029 ;4056Bibliographic 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.Theoretical Computer Science and General Issues,2512-2029 ;4056Computer networksAlgorithmsComputer science—MathematicsDiscrete mathematicsArtificial intelligence—Data processingComputer Communication NetworksAlgorithmsDiscrete Mathematics in Computer ScienceData ScienceComputer networks.Algorithms.Computer science—Mathematics.Discrete mathematics.Artificial intelligence—Data processing.Computer Communication Networks.Algorithms.Discrete Mathematics in Computer Science.Data Science.004.6Flocchini Paolaedthttp://id.loc.gov/vocabulary/relators/edtGasieniec Leszekedthttp://id.loc.gov/vocabulary/relators/edtColloquium on Structural Information and Communication ComplexityBOOK996465936003316Structural Information and Communication Complexity2889850UNISA