References

  1. Leonard Adleman, Qi Cheng, Ashish Goel & Ming-Deh Huang (2001): Running time and program size for self-assembled squares. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, Hersonissos, Greece, pp. 740–748, doi:10.1145/380752.380881.
  2. Pablo Arrighi, Nicolas Schabanel & Guillaume Theyssier (2012): Intrinsic Simulations between Stochastic Cellular Automata. In: JAC 2012: 3rd international symposium Journées Automates Cellulaires, Electronic Proceedings in Theoretical Computer Science 90. Open Publishing Association, pp. 208–224, doi:10.4204/EPTCS.90.17.
  3. Sarah Cannon, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Matthew J. Patitz, Robert Schweller, Scott M. Summers & Andrew Winslow (2013): Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM. In: STACS: Proceedings of the Thirtieth International Symposium on Theoretical Aspects of Computer Science, LIPIcs 20, pp. 172–184, doi:10.4230/LIPIcs.STACS.2013.172.
  4. Eric Goles Ch., Pierre-Etienne Meunier, Ivan Rapaport & Guillaume Theyssier (2011): Communication complexity and intrinsic universality in cellular automata. Theoretical Computer Science 412(1-2), pp. 2–21, doi:10.1016/j.tcs.2010.10.005.
  5. Matthew Cook, Yunhui Fu & Robert T. Schweller (2011): Temperature 1 self-assembly: deterministic assembly in 3D and probabilistic assembly in 2D. In: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 570–589.
  6. Marianne Delorme, Jacques Mazoyer, Nicolas Ollinger & Guillaume Theyssier (2011): Bulking I: an abstract theory of bulking. Theoretical Computer Science 412(30), pp. 3866–3880, doi:10.1016/j.tcs.2011.02.023.
  7. Marianne Delorme, Jacques Mazoyer, Nicolas Ollinger & Guillaume Theyssier (2011): Bulking II: Classifications of cellular automata. Theoretical Computer Science 412(30), pp. 3881–3905, doi:10.1016/j.tcs.2011.02.024.
  8. Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Matthew J. Patitz, Robert T. Schweller, Andrew Winslow & Damien Woods (2012): One tile to rule them all: simulating any Turing machine, tile assembly system, or tiling system with a single puzzle piece. Technical Report. Arxiv preprint http://arxiv.org/abs/1212.4756arXiv:1212.4756 [cs.DS].
  9. Erik D. Demaine, Matthew J. Patitz, Trent A. Rogers, Robert T. Schweller, Scott M. Summers & Damien Woods (2013): The two-handed tile assembly model is not intrinsically universal. In: ICALP: 40th International Colloquium on Automata, Languages and Programming. Proceedings, part 1, LNCS 7965, Riga, Latvia, pp. 400–412, doi:10.1007/978-3-642-39206-1_34. Arxiv preprint http://arxiv.org/abs/1306.6710arXiv:1306.6710 [cs.CG].
  10. David Doty (2012): Theory of Algorithmic Self-Assembly. Communications of the ACM 55(12), pp. 78–88, doi:10.1145/2380656.2380675.
  11. David Doty, Jack H. Lutz, Matthew J. Patitz, Robert T. Schweller, Scott M. Summers & Damien Woods (2012): The tile assembly model is intrinsically universal. In: FOCS: Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, pp. 439–446, doi:10.1109/FOCS.2012.76.
  12. David Doty, Jack H. Lutz, Matthew J. Patitz, Scott M. Summers & Damien Woods (2009): Intrinsic Universality in Self-Assembly. In: STACS: Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, pp. 275–286, doi:10.4230/LIPIcs.STACS.2010.2461.
  13. Jacob Hendricks, Jennifer E Padilla, Matthew J Patitz & Trent A Rogers (2013): Signal Transmission Across Tile Assemblies: 3D Static Tiles Simulate Active Self-Assembly by 2D Signal-Passing Tiles. Technical Report. Arxiv preprint http://arxiv.org/abs/1306.5005arXiv:1306.5005 [cs.ET].
  14. Jacob Hendricks & Matthew J. Patitz: On the Equivalence of Cellular Automata and the Tile Assembly Model. In: Proceedings of Machines, Computations and Universality (MCU 2013), University of Zürich, Switzerland. September 9-12, 2013. To appear.
  15. Natasha Jonoska & Daria Karpenko (2012): Active tile self-assembly, self-similar structures and recursion. Technical Report. Arxiv preprint http://arxiv.org/abs/1211.3085arXiv:1211.3085 [cs.ET].
  16. Lila Kari, Shinnosuke Seki & Zhi Xu (2012): Triangular and hexagonal tile self-assembly systems. In: Computation, Physics and Beyond. Springer, pp. 357–375, doi:10.1007/978-3-642-27654-5_28.
  17. Grégory Lafitte & Michael Weiss (2007): Universal Tilings. In: STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings, LNCS 4393. Springer, pp. 367–380, doi:10.1007/978-3-540-70918-3_32.
  18. Grégory Lafitte & Michael Weiss (2009): An Almost Totally Universal Tile Set. In: TAMC: Theory and Applications of Models of Computation, 6th Annual Conference, Changsha, China, May 18-22, 2009. Proceedings, LNCS 5532. Springer, pp. 271–280, doi:10.1007/978-3-642-02017-9_30.
  19. Pierre-Étienne Meunier, Matthew J. Patitz, Scott M. Summers, Guillaume Theyssier, Andrew Winslow & Damien Woods (2013): Intrinsic universality in tile self-assembly requires cooperation. Technical Report. Arxiv preprint http://arxiv.org/abs/1304.1679arXiv:1304.1679 [cs.CC].
  20. Nicolas Ollinger: Universalities in cellular automata a (short) survey. In: JAC: Symposium on Cellular Automata Journées Automates Cellulaires, 2008, pp. 102–118. http://hal.archives-ouvertes.fr/hal-00271840hal-00271840.
  21. Nicolas Ollinger & Gaétan Richard (2011): Four states are enough!. Theoretical Computer Science 412(1-2), pp. 22–32, doi:10.1016/j.tcs.2010.08.018.
  22. Matthew J Patitz (2013): An introduction to tile-based self-assembly and a survey of recent results. Natural Computing, pp. 1–30, doi:10.1007/s11047-013-9379-4.
  23. Paul W. K. Rothemund & Erik Winfree (2000): The Program-size Complexity of Self-Assembled Squares (extended abstract). In: STOC '00: Proceedings of the thirty-second annual ACM Symposium on Theory of Computing. ACM, Portland, Oregon, United States, pp. 459–468, doi:10.1145/335305.335358.
  24. David Soloveichik & Erik Winfree (2007): Complexity of Self-Assembled Shapes. SIAM Journal on Computing 36(6), pp. 1544–1569, doi:10.1137/S0097539704446712.
  25. Hao Wang (1961): Proving Theorems by Pattern Recognition – II. The Bell System Technical Journal XL(1), pp. 1–41, doi:10.1002/j.1538-7305.1961.tb03975.x.
  26. Erik Winfree (1998): Algorithmic Self-Assembly of DNA. California Institute of Technology.
  27. Damien Woods, Ho-Lin Chen, Scott Goodfriend, Nadine Dabby, Erik Winfree & Peng Yin (2013): Active self-assembly of algorithmic shapes and patterns in polylogarithmic time. In: ITCS: Proceedings of the 4th conference on Innovations in Theoretical Computer Science. ACM, pp. 353–354, doi:10.1145/2422436.2422476. Arxiv preprint http://arxiv.org/abs/1301.2626arXiv:1301.2626 [cs.DS].
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org