Connectivity preserving network transformers
From MaRDI portal
Publication:529024
DOI10.1016/j.tcs.2016.02.040zbMath1370.68023MaRDI QIDQ529024
Othon Michail, Paul G. Spirakis
Publication date: 18 May 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.02.040
termination; network construction; population protocol; dynamic topology; network transformation; continuous connectivity; random scheduler; turing machine simulation
Related Items
Distributed computation and reconfiguration in actively dynamic networks, Search by a metamorphic robotic system in a finite 2D square grid, Network Constructors: A Model for Programmable Matter, A Glimpse at Paul G. Spirakis
Cites Work
- Unnamed Item
- The computational power of simple protocols for self-awareness on graphs
- Mediated population protocols
- Passively mobile communicating machines that use restricted space
- Causality, influence, and computation in possibly disconnected synchronous dynamic networks
- The computational power of population protocols
- Forming sequences of geometric patterns with oblivious mobile robots
- Computation in networks of passively mobile finite-state sensors
- Terminating Distributed Construction of Shapes and Patterns in a Fair Solution of Automata
- Distributed computation in dynamic networks
- Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
- Naming and Counting in Anonymous Unknown Dynamic Networks
- The program-size complexity of self-assembled squares (extended abstract)
- Keeping Mobile Robot Swarms Connected
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Asynchronous Pattern Formation by Anonymous Oblivious Mobile Robots
- Universal Computation with Arbitrary Polyomino Tiles in Non-Cooperative Self-Assembly
- Timing in chemical reaction networks
- Simple and efficient local codes for distributed stable network construction
