Terminating Distributed Construction of Shapes and Patterns in a Fair Solution of Automata

DOI10.1145/2767386.2767402zbMath1333.68067arXiv1503.01913OpenAlexW2157203763MaRDI QIDQ2796239

Othon Michail

Publication date: 23 March 2016

Published in: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

populationfairnessself-organizationdistributed protocolnetwork constructionprogrammable mattershape formationinteracting automatarandom schedule

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Distributed systems (68M14) Network protocols (68M12)

Related Items (7)

An Introduction to Temporal Graphs: An Algorithmic Perspective ⋮ Terminating distributed construction of shapes and patterns in a fair solution of automata ⋮ Network Constructors: A Model for Programmable Matter ⋮ Connectivity preserving network transformers ⋮ Connectivity Preserving Network Transformers ⋮ Simple and efficient local codes for distributed stable network construction ⋮ An Introduction to Temporal Graphs: An Algorithmic Perspective^*

Cites Work

• Memorization and Association on a Realistic Neural Model
• Unnamed Item

This page was built for publication: Terminating Distributed Construction of Shapes and Patterns in a Fair Solution of Automata