Structural Information and Communication Complexity
From MaRDI portal
Publication:5315244
DOI10.1007/b98251zbMath1085.68697OpenAlexW2499215041MaRDI QIDQ5315244
Publication date: 7 September 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b98251
Related Items (17)
Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots ⋮ Optimal strategies for maintaining a chain of relays between an explorer and a base camp ⋮ Gathering Anonymous, Oblivious Robots on a Grid ⋮ Impossibility of gathering by a set of autonomous mobile robots ⋮ Computing without communicating: ring exploration by asynchronous oblivious robots ⋮ Gathering asynchronous oblivious agents with local vision in regular bipartite graphs ⋮ Energy-efficient strategies for building short chains of mobile robots locally ⋮ How many oblivious robots can explore a line ⋮ A New Approach for Analyzing Convergence Algorithms for Mobile Robots ⋮ Gathering asynchronous oblivious mobile robots in a ring ⋮ ``Robot cloud gradient climbing with point measurements ⋮ Gathering of asynchronous robots with limited visibility ⋮ Optimal Byzantine-resilient convergence in uni-dimensional robot networks ⋮ Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring ⋮ Synchronous gathering without multiplicity detection: a certified algorithm ⋮ Distributed algorithms for partitioning a swarm of autonomous mobile robots ⋮ Gathering anonymous, oblivious robots on a grid
This page was built for publication: Structural Information and Communication Complexity
