LEADER 04525nam 22006855 450 001 996465718703316 005 20230222174907.0 024 7 $a10.1007/b136628 035 $a(CKB)1000000000213003 035 $a(SSID)ssj0000320242 035 $a(PQKBManifestationID)11263719 035 $a(PQKBTitleCode)TC0000320242 035 $a(PQKBWorkID)10347464 035 $a(PQKB)10938259 035 $a(DE-He213)978-3-540-32073-9 035 $a(MiAaPQ)EBC3067910 035 $a(PPN)12309481X 035 $a(EXLCZ)991000000000213003 100 $a20100714d2005 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aStructural Information and Communication Complexity$b[electronic resource] $e12th International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005, Proceedings /$fedited by Andrzej Pelc, Michel Raynal 205 $a1st ed. 2005. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2005. 215 $a1 online resource (X, 323 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3499 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$aPrinted edition: 9783540260523 320 $aIncludes bibliographical references and index. 327 $aCellular Networks: Where Are the Mobile Users? -- Distributed Data Structures: A Survey -- On Designing Truthful Mechanisms for Online Scheduling -- On Private Computation in Incomplete Networks -- Traffic Grooming on the Path -- Range Augmentation Problems in Static Ad-Hoc Wireless Networks -- On the Approximability of the L(h,k)-Labelling Problem on Bipartite Graphs (Extended Abstract) -- A Tight Bound for Online Coloring of Disk Graphs -- Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances -- Distributed Exploration of an Unknown Graph -- Two Absolute Bounds for Distributed Bit Complexity -- Finding Short Right-Hand-on-the-Wall Walks in Graphs -- Space Lower Bounds for Graph Exploration via Reduced Automata -- Communications in Unknown Networks: Preserving the Secret of Topology -- An Improved Algorithm for Adaptive Condition-Based Consensus -- Biangular Circle Formation by Asynchronous Mobile Robots -- Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs -- On Semi-perfect 1-Factorizations -- Free-Riders in Steiner Tree Cost-Sharing Games -- On the Feasibility of Gathering by Autonomous Mobile Robots -- Majority and Unanimity in Synchronous Networks with Ubiquitous Dynamic Faults -- Minimizing the Number of ADMs in SONET Rings with Maximum Throughput -- Optimal Gossiping in Square Meshes in All-Port Mode and with Short Packets -- Geometric Routing Without Geometry. 330 $aThis book constitutes the refereed proceedings of the 12th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2005, held in Mont Saint-Michel, France in May 2005. The 22 revised full papers presented were carefully reviewed and selected from 48 submissions. The papers address issues such as topics in distributed and parallel computing, information dissemination, communication complexity, interconnection networks, high speed networks, wireless networking, mobile computing, optical computing, and related areas. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3499 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 $aPelc$b Andrzej$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aRaynal$b Michel$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465718703316 996 $aStructural Information and Communication Complexity$92889850 997 $aUNISA