ACM Transactions on Programming Languages and Systems (TOPLAS)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
The program-size complexity of self-assembled squares (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
DNA Self-Assembly For Constructing 3D Boxes
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Algorithmic self-assembly of dna
Algorithmic self-assembly of dna
Theory and experiments in algorithmic self-assembly
Theory and experiments in algorithmic self-assembly
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Complexity of Self-Assembled Shapes
SIAM Journal on Computing
Combining self-healing and proofreading in self-assembly
Natural Computing: an international journal
Strict Self-assembly of Discrete Sierpinski Triangles
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Computability and Complexity in Self-assembly
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Self-assembly of Decidable Sets
UC '08 Proceedings of the 7th international conference on Unconventional Computing
A Limit to the Power of Multiple Nucleation in Self-assembly
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Error suppression mechanisms for DNA tile self-assembly and their simulation
Natural Computing: an international journal
The Art of Multiprocessor Programming
The Art of Multiprocessor Programming
Error free self-assembly using error prone tiles
DNA'04 Proceedings of the 10th international conference on DNA computing
| Hi-index | 0.00 |
Laboratory investigations have shown that a formal theory of fault-tolerance will be essential to harness nanoscale self-assembly as a medium of computation. Several researchers have voiced an intuition that self-assembly phenomena are related to the field of distributed computing. This paper formalizes some of that intuition. We construct tile assembly systems that are able to simulate the solution of the wait-free consensus problem in some distributed systems. (For potential future work, this may allow binding errors in tile assembly to be analyzed, and managed, with positive results in distributed computing, as a "blockage" in our tile assembly model is analogous to a crash failure in a distributed computing model.) We also define a strengthening of the "traditional" consensus problem, to make explicit an expectation about consensus algorithms that is often implicit in distributed computing literature. We show that solution of this strengthened consensus problem can be simulated by a two-dimensional tile assembly model only for two processes, whereas a three-dimensional tile assembly model can simulate its solution in a distributed system with any number of processes.