Fault tolerant network constructors

DOI10.1016/J.IC.2023.105037arXiv1903.05992OpenAlexW2921696522MaRDI QIDQ6044462

Michail Theofilatos, Othon Michail, Paul G. Spirakis

Publication date: 19 May 2023

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1903.05992

zbMATH Keywords

populationfairnessself-organizationdistributed protocolnetwork constructionself stabilizationdynamic graph formationfault tolerant protocol

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Mediated population protocols
• A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
• Self-stabilization of dynamic systems assuming only read/write atomicity
• Population protocols with faulty interactions: the impact of a leader
• Terminating distributed construction of shapes and patterns in a fair solution of automata
• On the transformation capability of feasible mechanisms for programmable matter
• On space complexity of self-stabilizing leader election in mediated population protocol
• The computational power of population protocols
• Constructing self-stabilizing oscillators in population protocols
• Computation in networks of passively mobile finite-state sensors
• Network Constructors: A Model for Programmable Matter
• Unreliable failure detectors for reliable distributed systems
• The weakest failure detector for solving consensus
• Self-stabilization with r-operators
• Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
• Simple and efficient local codes for distributed stable network construction

This page was built for publication: Fault tolerant network constructors