LEADER 05380nam 22007455 450 001 9910484856403321 005 20230329135806.0 010 $a3-319-09620-6 024 7 $a10.1007/978-3-319-09620-9 035 $a(CKB)3710000000219431 035 $a(SSID)ssj0001298631 035 $a(PQKBManifestationID)11710080 035 $a(PQKBTitleCode)TC0001298631 035 $a(PQKBWorkID)11241639 035 $a(PQKB)10744194 035 $a(DE-He213)978-3-319-09620-9 035 $a(MiAaPQ)EBC6285486 035 $a(MiAaPQ)EBC5578669 035 $a(Au-PeEL)EBL5578669 035 $a(OCoLC)884893335 035 $a(PPN)179925938 035 $a(EXLCZ)993710000000219431 100 $a20140716d2014 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aStructural Information and Communication Complexity $e21st International Colloquium, SIROCCO 2014, Takayama, Japan, July 23-25, 2014, Proceedings /$fedited by Magnús M. Halldórsson 205 $a1st ed. 2014. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2014. 215 $a1 online resource (XX, 372 p. 59 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8576 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-319-09619-2 327 $aInvited Presentations -- Algorithmic Aspects of Resource Management in the Cloud -- From Turing to the Clouds (On the Computability Power of Distributed Systems) -- Communication Complexity Lower Bounds in Distributed Message-Passing -- Biological Distributed Computing -- Distributed Algorithmic Foundations of Dynamic Networks -- Best Student Paper -- The Beachcombers' Problem: Walking and Searching with Mobile Robots -- Shared Memory and Multiparty Communication -- Reliable Shared Memory Abstractions on Top of Asynchronous t-Resilient Byzantine Message-passing Systems -- Distributed Transactional Contention Management as the Traveling Salesman Problem -- The complexity gap between consensus and safe-consensus (Extended Abstract) -- The simultaneous number-in-hand communication model for networks: private coins, public coins and determinism -- Network Optimization -- Approximation of the Degree-Constrained Minimum Spanning Hierarchies -- Secluded Path via Shortest Path -- CONGEST Algorithms and Lower Bounds -- Distributed Approximation of Minimum Routing Cost Trees -- Randomized Lower Bound for Distributed Spanning-Tree Verification.-Lessons from the Congested Clique Applied to MapReduce -- Wireless networks -- Oblivious Rendezvous in Cognitive Radio Networks -- Local Broadcasting with Arbitrary Transmission Power in the SINR Model -- Aggregation and Creation Games in Networks -- Continuous Aggregation in Dynamic Ad-Hoc Networks -- Network Creation Games with Traceroute-Based Strategies -- Patrolling and Barrier Coverage.-Patrolling by Robots Equipped with Visibility -- Distributed Barrier Coverage with Relocatable Sensors -- Exploration -- Exploration of Constantly Connected Dynamic Graphs Based on Cactuses -- How Many Ants Does It Take To Find the Food? -- What Do We Need to Know to Elect in Networks with Unknown Participants? -- Rendezvous.-Rendezvous of Distance-aware Mobile Agents in Unknown Graphs -- Rendezvous of Heterogeneous Mobile Agents in Edge-weighted Networks -- Mobile Agents.-Move-optimal partial gathering of mobile agents in asynchronous trees -- A Recursive Approach to Multi-Robot Exploration of Trees.-Improved Periodic Data Retrieval in Asynchronous Rings with a Faulty Host. 330 $aThis book constitutes the refereed proceedings of the 21st International Colloquium on Structural Information and Communication Complexity, SIROCCO 2014, held in Takayama, Japan, in July 2014. The 24  full papers presented  together with 5 invited talks were carefully reviewed and selected from 51 submissions. The focus of the colloquium is on following subjects Shared Memory, and Multiparty Communication, Network Optimization, CONGEST Algorithms and Lower Bounds, Wireless networks, Aggregation and Creation Games in Networks, Patrolling and Barrier Coverage, Exploration, Rendevous, and Mobile Agents. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8576 606 $aAlgorithms 606 $aComputer networks 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aArtificial intelligence?Data processing 606 $aAlgorithms 606 $aComputer Communication Networks 606 $aDiscrete Mathematics in Computer Science 606 $aData Science 615 0$aAlgorithms. 615 0$aComputer networks. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aArtificial intelligence?Data processing. 615 14$aAlgorithms. 615 24$aComputer Communication Networks. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aData Science. 676 $a004.36 702 $aHalldórsson$b Magnús M$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484856403321 996 $aStructural Information and Communication Complexity$92889850 997 $aUNINA