LEADER 05418nam 22008055 450 001 9910767568503321 005 20251226195447.0 010 $a3-540-72951-8 024 7 $a10.1007/978-3-540-72951-8 035 $a(CKB)1000000000491009 035 $a(EBL)3061597 035 $a(SSID)ssj0000320240 035 $a(PQKBManifestationID)11258714 035 $a(PQKBTitleCode)TC0000320240 035 $a(PQKBWorkID)10344011 035 $a(PQKB)10646180 035 $a(DE-He213)978-3-540-72951-8 035 $a(MiAaPQ)EBC3061597 035 $a(MiAaPQ)EBC6705968 035 $a(Au-PeEL)EBL6705968 035 $a(PPN)123727855 035 $a(BIP)34164863 035 $a(BIP)14225073 035 $a(EXLCZ)991000000000491009 100 $a20100301d2007 u| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aStructural Information and Communication Complexity $e14th International Colloquium, SIROCCO 2007, Castiglioncello, Italy, June 5-8, 2007, Proceedings /$fedited by Giuseppe Prencipe, Shmuel Zaks 205 $a1st ed. 2007. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2007. 215 $a1 online resource (351 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4474 300 $aIncludes index. 311 08$a3-540-72918-6 320 $aIncludes bibliographical references and index. 327 $aSession 1. Invited Talks -- Fast Distributed Algorithms Via Primal-Dual (Extended Abstract) -- Time Optimal Gathering in Sensor Networks -- Treewidth: Structure and Algorithms -- Session 2. Autonomous Systems: Graph Exploration -- Fast Periodic Graph Exploration with Constant Memory -- Why Robots Need Maps -- Graph Searching with Advice -- Session 3. Distributed Algorithms: Fault Tolerance -- From Renaming to Set Agreement -- A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives -- A New Self-stabilizing Maximal Matching Algorithm -- Session 4. Distributed Algorithms and Data Structures -- Labeling Schemes with Queries -- A Simple Optimistic Skiplist Algorithm -- Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs -- Session 5. Autonomous Systems: Location Problems -- Optimal Moves for Gossiping Among Mobile Agents -- Swing Words to Make Circle Formation Quiescent -- Distributed Algorithms for Partitioning a Swarm of Autonomous Mobile Robots -- Session 6. Wireless Networks -- Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs -- Proxy Assignments for Filling Gaps in Wireless Ad-Hoc Lattice Computers -- Location Oblivious Distributed Unit Disk Graph Coloring -- Session 7. Communication Networks: Fault Tolerance -- Edge Fault-Diameter of Cartesian Product of Graphs -- Rapid Almost-Complete Broadcasting in Faulty Networks -- Design of Minimal Fault Tolerant On-Board Networks: Practical Constructions -- Session 8. Autonomous Systems: Fault Tolerance -- Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots -- Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents -- Session 9. Communication Networks: Parallel Computing and Selfish Routing -- Optimal Conclusive Sets for Comparator Networks -- Selfish Routing with Oblivious Users -- Upper Bounds and Algorithms for Parallel Knock-Out Numbers. 330 $aThis book constitutes the refereed proceedings of the 14th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2007, held in Castiglioncello, Italy in June 2007. The 23 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 66 submissions. The papers address issues such as distributed computing, high-speed networks, interconnection networks, mobile computing, optical computing, parallel computing, sensor networks, wireless networks, and autonomous robots. The papers are organized in topical sections on graph exploration, fault tolerance, distributed algorithms and data structures, location problems, wireless networks, fault tolerance, as well as parallel computing and selfish routing. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4474 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.36 702 $aPrencipe$b Giuseppe$f1972- 702 $aZaks$b Shmuel$f1949- 712 12$aColloquium on Structural Information and Communication Complexity 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910767568503321 996 $aStructural Information and Communication Complexity$92889850 997 $aUNINA