Distributed agreement in tile self-assembly

DOI10.1007/s11047-010-9233-xzbMath1213.68127arXiv0902.3631OpenAlexW2900396373MaRDI QIDQ537848

Aaron Sterling

Publication date: 23 May 2011

Published in: Lecture Notes in Computer Science, Natural Computing (Search for Journal in Brave)

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

zbMATH Keywords

consensus problemtile self-assemblyconsensus hierarchy

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (1)

An optimal maximal independent set algorithm for bounded-independence graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Error suppression mechanisms for DNA tile self-assembly and their simulation
• The program-size complexity of self-assembled squares (extended abstract)
• Computability and Complexity in Self-assembly
• A Limit to the Power of Multiple Nucleation in Self-assembly
• Self-assembly of Decidable Sets
• Impossibility of distributed consensus with one faulty process
• Randomized wait-free concurrent objects (extended abstract)
• Strict Self-assembly of Discrete Sierpinski Triangles
• Complexity of Self‐Assembled Shapes
• DNA Computing
• Reliable cellular automata with self-organization

This page was built for publication: Distributed agreement in tile self-assembly