Fault tolerant network constructors
From MaRDI portal
Publication:6536337
DOI10.1007/978-3-030-34992-9_19zbMATH Open1539.68048MaRDI QIDQ6536337FDOQ6536337
Othon Michail, Michail Theofilatos, P. G. Spirakis
Publication date: 19 April 2024
fairnessself-organizationself-stabilizationdistributed protocolnetwork constructionfault-tolerant protocoldynamic graph formation
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network design and communication in computer systems (68M10) Network protocols (68M12)
Cites Work
- Computation in networks of passively mobile finite-state sensors
- Self-stabilization
- The computational power of population protocols
- Mediated population protocols
- Simple and efficient local codes for distributed stable network construction
- Self-stabilization of dynamic systems assuming only read/write atomicity
- Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
- A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
- Self-stabilization with r-operators
- On the transformation capability of feasible mechanisms for programmable matter
- 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 Runtime of Universal Coating for Programmable Matter
- On space complexity of self-stabilizing leader election in mediated population protocol
- Constructing self-stabilizing oscillators in population protocols
- Network Constructors: A Model for Programmable Matter
This page was built for publication: Fault tolerant network constructors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536337)
