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.

Produktinformation

Utgivningsdatum2019-07-13
Mått155 x 235 x 22 mm
Vikt593 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor368
Upplaga19001
FörlagSpringer Nature Switzerland AG
ISBN9783030249212

Tillhör följande kategorier

Operativsystem inom Data och it
Programmeringsböcker inom Data och it
Hårdvara inom Data och it
Elektronik och kommunikationer inom Naturvetenskap och teknik

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.

Mer från samma serie

Del 16477

Passive and Active Measurement

Simone Ferlin-Reiter, Romain Fontugne, Johanna Ullrich

Häftad, 2026

1 409 kr

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

739 kr

Del 15427

Internet of Things – ICIOT 2024

Shunli Zhang, Liang-Jie Zhang

Häftad, 2024

819 kr

COLOG-88

Per Martin-Löf, Grigori Mints

Häftad, 1990

719 kr

Compiler Construction

Albert Cohen

Häftad, 2014

709 kr

Del 16375

Interactive Storytelling

María Cecilia Reyes, Frank Nack

Häftad, 2025

719 kr

Theory of Cryptography

Yehuda Lindell

Häftad, 2014

739 kr

Computer Science Logic

Dirk van Dalen, Marc Bezem

Häftad, 1997

739 kr

Reliable Software Technology – Ada-Europe 2005

Tullio Vardanega, Andy Wellings

Häftad, 2005

739 kr

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki - Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries, Häftad

Del 16376

Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki

Häftad, 2026

1 209 kr

Du kanske också är intresserad av

Del 12156

Structural Information and Communication Complexity

Andrea Werneck Richa, Christian Scheideler

Häftad, 2020

739 kr

Structural Information and Communication Complexity

Shay Kutten, Janez Žerovnik

Häftad, 2010

719 kr

Del 16488

Structural Information and Communication Complexity

Chryssis Georgiou

Häftad, 2026

1 099 kr

Del 12810

Structural Information and Communication Complexity

Tomasz Jurdziński, Stefan Schmid

Häftad, 2021

739 kr

Del 9439

Structural Information and Communication Complexity

Christian Scheideler

Häftad, 2015

719 kr

Structural Information and Communication Complexity

Andrzej Pelc, Michel Raynal

Häftad, 2005

739 kr

Structural Information and Communication Complexity

Pascal Felber

Häftad, 2008

739 kr

Del 10641

Structural Information and Communication Complexity

Shantanu Das, Sebastien Tixeuil

Häftad, 2017

719 kr

Structural Information and Communication Complexity

Giuseppe Prencipe, Shmuel Zaks

Häftad, 2007

739 kr

Del 9988

Structural Information and Communication Complexity

Jukka Suomela

Häftad, 2016

739 kr

Del 11639 i serien Lecture Notes in Computer Science

Structural Information and Communication Complexity

26th International Colloquium, SIROCCO 2019, L'Aquila, Italy, July 1–4, 2019, Proceedings

Häftad, Engelska, 2019

AvKeren Censor-Hillel,Michele Flammini

719 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (10)

Häftad

739 kr

Skickas inom 10-15 vardagar

Häftad

739 kr

Skickas inom 10-15 vardagar

Häftad

739 kr

Skickas inom 10-15 vardagar

Häftad

1 109 kr

Skickas inom 10-15 vardagar

Häftad

1 479 kr

Skickas inom 10-15 vardagar

Häftad

2 059 kr

Skickas inom 10-15 vardagar

Häftad

2 359 kr

Skickas inom 5-8 vardagar

Häftad

1 099 kr

Skickas inom 10-15 vardagar

Häftad

729 kr

Skickas inom 10-15 vardagar

Häftad

719 kr

Skickas inom 10-15 vardagar

Produktinformation

Utgivningsdatum2019-07-13
Mått155 x 235 x 22 mm
Vikt593 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor368
Upplaga19001
FörlagSpringer Nature Switzerland AG
ISBN9783030249212

Tillhör följande kategorier

Operativsystem inom Data och it
Programmeringsböcker inom Data och it
Hårdvara inom Data och it
Elektronik och kommunikationer inom Naturvetenskap och teknik

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.