LEADER 05258nam 22007815 450 001 996466215803316 005 20240112223117.0 010 $a3-030-24922-0 024 7 $a10.1007/978-3-030-24922-9 035 $a(CKB)4100000008707665 035 $a(DE-He213)978-3-030-24922-9 035 $a(MiAaPQ)EBC5922298 035 $a(PPN)238488489 035 $a(EXLCZ)994100000008707665 100 $a20190712d2019 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aStructural Information and Communication Complexity$b[electronic resource] $e26th International Colloquium, SIROCCO 2019, L'Aquila, Italy, July 1?4, 2019, Proceedings /$fedited by Keren Censor-Hillel, Michele Flammini 205 $a1st ed. 2019. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2019. 215 $a1 online resource (XXI, 368 p. 301 illus., 26 illus. in color.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v11639 300 $aIncludes index. 311 0 $a3-030-24921-2 327 $aA Topological Perspective on Distributed Network Algorithms -- On Sense of Direction and Mobile Agents -- Locality of not-so-weak coloring -- Near-gathering of energy-constrained mobile agents -- Optimal Multi Broadcast with Beeps using Group Testing -- Tracking Routes in Communication Networks -- Positional Encoding by Robots with Non-Rigid Movements -- Arbitrary Pattern Formation by Asynchronous Opaque Robots with Lights -- Breaking the Linear-Memory Barrier in MPC: Fast MIS on Trees with Strongly Sublinear Memory -- Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Robots -- Asynchronous Rendezvous with Different Maps -- Gathering Synchronous Robots in Graphs: from general properties to dense and symmetric topologies -- Time-Energy Tradeoffs for Evacuation by Two Robots in the Wireless Model -- Evacuating Two Robots from a Disk: A Second Cut -- Distributed pattern formation in a ring -- On Distributed Merlin-Arthur Decision Protocols -- Anonymous Read/Write Memory: Leader Election and Desanonymization -- Faster Construction of Overlay Networks -- Partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings -- Set Agreement Power is not a Precise Characterization for Oblivious Deterministic Anonymous Objects -- Making Randomized Algorithms Self-Stabilizing -- How to Color a French Flag{Biologically Inspired Algorithms for Scale-Invariant Patterning -- Self-Adjusting Line Networks -- Mutual Visibility for Asynchronous Robots -- Infinite Grid Exploration by Disoriented Robots -- A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks -- Mobile Robots with Uncertain Visibility Sensors: Possibility Results and Lower Bounds -- A strongly-stabilizing protocol for spanning tree construction against a mobile Byzantine fault -- Average-based Population Protocols : Explicit and Tight Bounds of the Convergence Time -- Visiting Infinitely Often the Unit Interval while Minimizing the Idle-time of High Priority Points. 330 $aThis book constitutes the refereed conference proceedings of the 26th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2019, held in L?Aquila, Italy, in July 2019. The 19 full papers and 9 short papers presented in this book were carefully reviewed and selected from 39 submissions. They are devoted to the study of the interplay between structural knowledge, communication, and computing in decentralized systems of multiple communicating entities. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v11639 606 $aAlgorithms 606 $aComputer engineering 606 $aComputer networks 606 $aOperating systems (Computers) 606 $aRobotics 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aArtificial intelligence$xData processing 606 $aAlgorithms 606 $aComputer Engineering and Networks 606 $aOperating Systems 606 $aRobotics 606 $aDiscrete Mathematics in Computer Science 606 $aData Science 615 0$aAlgorithms. 615 0$aComputer engineering. 615 0$aComputer networks. 615 0$aOperating systems (Computers). 615 0$aRobotics. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aArtificial intelligence$xData processing. 615 14$aAlgorithms. 615 24$aComputer Engineering and Networks. 615 24$aOperating Systems. 615 24$aRobotics. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aData Science. 676 $a004.36 702 $aCensor-Hillel$b Keren$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aFlammini$b Michele$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466215803316 996 $aStructural Information and Communication Complexity$92889850 997 $aUNISA LEADER 00905nam0 22002531i 450 001 UON00306102 005 20231205104032.808 100 $a20080108d1910 |0itac50 ba 101 $ager 102 $aDE 105 $a|||| 1|||| 200 1 $aAlte Nester$ezwei Bücher Lebensgeschichten$fvon Wilhelm Raabee 210 $aBerlin$cOtto Janke$d1910 215 $a319 p.$d19 cm. 620 $aDE$dBerlin$3UONL003157 676 $a833$cLetteratura narrativa tedesca$v21 700 1$aRAABE$bWilhelm$3UONV112893$0132069 712 $aOtto Janke$3UONV274066$4650 801 $aIT$bSOL$c20240220$gRICA 899 $aSIBA - SISTEMA BIBLIOTECARIO DI ATENEO$2UONSI 912 $aUON00306102 950 $aSIBA - SISTEMA BIBLIOTECARIO DI ATENEO$dSI TED 23 I RAA 04 c $eSI LO 33677 5 04 c 996 $aAlte Nester$91185635 997 $aUNIOR