Network Constructors: A Model for Programmable Matter

DOI10.1007/978-3-319-51963-0_3zbMath1433.68142OpenAlexW2570309248MaRDI QIDQ2971122

Othon Michail, Paul G. Spirakis

Publication date: 4 April 2017

Published in: SOFSEM 2017: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-51963-0_3

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Network protocols (68M12) Other nonclassical models of computation (68Q09)

Related Items (3)

Fault tolerant network constructors ⋮ Threshold-based network structural dynamics ⋮ Threshold-based network structural dynamics

Cites Work

• Connectivity preserving network transformers
• Mediated population protocols
• Computation in networks of passively mobile finite-state sensors
• Terminating Distributed Construction of Shapes and Patterns in a Fair Solution of Automata
• On the Runtime of Universal Coating for Programmable Matter
• Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
• The program-size complexity of self-assembled squares (extended abstract)
• Simple and efficient local codes for distributed stable network construction

This page was built for publication: Network Constructors: A Model for Programmable Matter