Cantitate/Preț
Produs

Structural Information and Communication Complexity: 29th International Colloquium, SIROCCO 2022, Paderborn, Germany, June 27–29, 2022, Proceedings: Lecture Notes in Computer Science, cartea 13298

Editat de Merav Parter
en Limba Engleză Paperback – 26 iun 2022
This book constitutes the refereed conference proceedings of the 29th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2022, held in Paderborn, Germany, in June 2022. The 16 full papers presented in this book were carefully reviewed and selected from 30 submissions. SIROCCO is devoted to the study of the interplay between structural knowledge, communication, and computing in decentralized systems of multiple communicating entities. Special emphasis is given to innovative approaches leading to better understanding of the relationship between computing and communication.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 50399 lei

Preț vechi: 62999 lei
-20% Nou

Puncte Express: 756

Preț estimativ în valută:
9645 10008$ 8062£

Carte tipărită la comandă

Livrare economică 15-29 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783031099922
ISBN-10: 3031099923
Pagini: 303
Ilustrații: VIII, 303 p. 50 illus., 25 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.44 kg
Ediția:1st ed. 2022
Editura: Springer International Publishing
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

Local Mending.- Proof Labeling Schemes for Reachability-Related Problems in Directed Graphs.- On the Computational Power of Energy-Constrained Mobile Robots: Algorithms and Cross-Model Analysis.- Randomized Strategies for Non-Additive 3-Slope Ski Rental.- Accelerated Information Dissemination on Networks with Local and Global Edges.- Phase Transition of the 3-Majority Dynamics with Uniform Communication Noise.- A Meta-Theorem for Distributed Certification.- The Red-Blue Pebble Game on Trees and DAGs with Large Input.- Local planar domination revisited.- Election in Fully Anonymous Shared Memory Systems: Tight Space Bounds and Algorithms.- Dispersion of Mobile Robots on Directed Anonymous Graphs.- Distributed Interactive Proofs for the Recognition of Some Geometric Intersection Graph Classes.-  Exactly Optimal Deterministic Radio Broadcasting with Collision Detection.- Lower Bounds on Message Passing Implementations of Multiplicity-Relaxed Queues and Stacks.- Fixed Points and 2-Cycles of Synchronous Dynamic Coloring Processes on Trees.