{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":27,"n_cols":5,"rows_kept":27,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[20,2,20,3],[21,2,21,3],[24,2,24,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996466215803316"]
[null,null,"Titolo",null,"Structural Information and Communication Complexity [[electronic resource] ] : 26th International Colloquium, SIROCCO 2019, L'Aquila, Italy, July 1–4, 2019, Proceedings / / edited by Keren Censor-Hillel, Michele Flammini"]
[null,null,"Pubbl/distr/stampa",null,"Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019"]
[null,null,"ISBN",null,"3-030-24922-0"]
[null,null,"Edizione",null,"[1st ed. 2019.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XXI, 368 p. 301 illus., 26 illus. in color.)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 11639"]
[null,null,"Disciplina",null,"004.36"]
[null,null,"Soggetti",null,"Algorithms"]
[{"$nulls":4},"Computer engineering"]
[{"$nulls":4},"Computer networks"]
[{"$nulls":4},"Operating systems (Computers)"]
[{"$nulls":4},"Robotics"]
[{"$nulls":4},"Computer science - Mathematics"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Artificial intelligence - Data processing"]
[{"$nulls":4},"Computer Engineering and Networks"]
[{"$nulls":4},"Operating Systems"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[{"$nulls":4},"Data Science"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Includes index."]
[null,null,"Nota di contenuto",null,"A 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 "]
[{"$nulls":4},"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."]
[null,null,null,"Sommario/riassunto","This 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."]