Structural Information and Communication Complexity : 26th International Colloquium, SIROCCO 2019, L'Aquila, Italy, July 1-4, 2019, Proceedings /: 26th International Colloquium, SIROCCO 2019, L'Aquila, Italy, July 1-4, 2019, Proceedings. (2019)

• Record Type: Book
• Other Titles: SIROCCO 2019
• Further Information: Note: Keren Censor-Hillel, Michele Flammini (eds.).
• Other Names: Censor-Hillel, Keren; Flammini, Michele; International Colloquium on Structural Information and Communication Complexity, 26th
• Contents: 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 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 Minimizin g the Idle-time of High Priority Points.
• Publisher Details: Cham : Springer
• Publication Date: 2019
• Extent: 1 online resource, illustrations
• Subjects: 005.1; Electronic data processing -- Distributed processing -- Congresses; Computer networks -- Congresses; Digital communications -- Congresses; Electronic books
• Languages: English
• ISBNs: 9783030249229; 3030249220
• Related ISBNs: 9783030249212
• Notes: Note: Includes bibliographical references and author index.
• Access Rights: Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
• Access Usage: Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.