LEADER 04140nam  22006975  450 
001 996465936003316
005 20230406052938.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(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$b[electronic resource] $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   $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.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4056
606   $aComputer networks
606   $aAlgorithms
606   $aComputer science?Mathematics
606   $aDiscrete mathematics
606   $aArtificial intelligence?Data 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?Mathematics.
615  0$aDiscrete mathematics.
615  0$aArtificial intelligence?Data processing.
615 14$aComputer Communication Networks.
615 24$aAlgorithms.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aData Science.
676   $a004.6
702   $aFlocchini$b Paola$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aGasieniec$b Leszek$4edt$4http://id.loc.gov/vocabulary/relators/edt
712 12$aColloquium on Structural Information and Communication Complexity
906   $aBOOK
912   $a996465936003316
996   $aStructural Information and Communication Complexity$92889850
997   $aUNISA