000 04811nam a22005415i 4500
001 978-3-319-09620-9
003 DE-He213
005 20200420221259.0
007 cr nn 008mamaa
008 140716s2014 gw | s |||| 0|eng d
020 _a9783319096209
_9978-3-319-09620-9
024 7 _a10.1007/978-3-319-09620-9
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
245 1 0 _aStructural Information and Communication Complexity
_h[electronic resource] :
_b21st International Colloquium, SIROCCO 2014, Takayama, Japan, July 23-25, 2014. Proceedings /
_cedited by Magn�us M. Halld�orsson.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2014.
300 _aXX, 372 p. 59 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8576
505 0 _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.
520 _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.
650 0 _aComputer science.
650 0 _aComputer communication systems.
650 0 _aData structures (Computer science).
650 0 _aAlgorithms.
650 0 _aComputer science
_xMathematics.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aComputer Communication Networks.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aData Structures.
650 2 4 _aAlgorithms.
700 1 _aHalld�orsson, Magn�us M.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783319096193
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8576
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-319-09620-9
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _cEBK
999 _c53126
_d53126