Stand up indulgent gathering (Q5918709)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7547810

Language	Label	Description	Also known as
English	Stand up indulgent gathering	scientific article; zbMATH DE number 7547810

Statements

scholarly article

0 references

Stand up indulgent gathering (English)

0 references

0 references

0 references

Sébastien Tixeuil

0 references

Algorithms for Sensor Systems

0 references

publication date

24 June 2022

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-89240-1_2

0 references

Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots

0 references

Synchronous gathering without multiplicity detection: a certified algorithm

0 references

Fault-Tolerant Gathering of Asynchronous Oblivious Mobile Robots under One-Axis Agreement

0 references

The Complexity of Data Aggregation in Static and Dynamic Wireless Sensor Networks

0 references

Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems

0 references

Impossibility of gathering, a certification

0 references

Fault-Tolerant and Self-stabilizing Mobile Robots Gathering

0 references

Self-stabilizing gathering of mobile robots under crash or Byzantine faults

0 references

0 references

Impossibility of gathering by a set of autonomous mobile robots

0 references

Distributed Anonymous Mobile Robots: Formation of Geometric Patterns

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-030-89240-1_2

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5918709

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5918709&oldid=36822653"