Cantitate/Preț
Produs
Total produse
Vezi coșul
Structural Information and Communication Complexity: 26th International Colloquium, SIROCCO 2019, L'Aquila, Italy, July 1–4, 2019, Proceedings de Keren Censor-Hillel

Structural Information and Communication Complexity: 26th International Colloquium, SIROCCO 2019, L'Aquila, Italy, July 1–4, 2019, Proceedings: Lecture Notes in Computer Science, cartea 11639

Editat de Keren Censor-Hillel, Michele Flammini
en Limba Engleză Paperback – 13 iul 2019
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 33039 lei

Preț vechi: 41300 lei
-20% Nou

Puncte Express: 496
Preț estimativ în valută:
6323€ • 6568$ • 5252£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030249212
ISBN-10: 3030249212
Pagini: 362
Ilustrații: XXI, 368 p. 301 illus., 26 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.55 kg
Ediția:1st ed. 2019
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Cuprins

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 Minimizing the Idle-time of High Priority Points.