| Publication | Date of Publication | Type |
|---|
| Turning machines | 2023-10-27 | Paper |
Small tile sets that compute while solving mazes
(available as arXiv preprint) | 2023-09-21 | Paper |
| On the hardness of knowing busy beaver values BB(15) and BB(5,4) | 2021-07-26 | Paper |
The Collatz process embeds a base conversion algorithm
(available as arXiv preprint) | 2021-07-06 | Paper |
| Intrinsic universality and the computational power of self-assembly | 2021-06-10 | Paper |
Intrinsic universality and the computational power of self-assembly
(available as arXiv preprint) | 2021-06-10 | Paper |
| AND and/or OR: uniform polynomial-size circuits | 2021-06-10 | Paper |
AND and/or OR: uniform polynomial-size circuits
(available as arXiv preprint) | 2021-06-10 | Paper |
| scientific article; zbMATH DE number 7298595 (Why is no real title available?) | 2021-01-20 | Paper |
scientific article; zbMATH DE number 7298595 (Why is no real title available?)
(available as arXiv preprint) | 2021-01-20 | Paper |
The program-size complexity of self-assembled paths
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Parallel computation using active self-assembly
Natural Computing | 2019-07-08 | Paper |
Intrinsic universality in tile self-assembly requires cooperation
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
| Thermodynamic binding networks | 2018-02-02 | Paper |
Thermodynamic binding networks
(available as arXiv preprint) | 2018-02-02 | Paper |
The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
Yurii Rogozhin's contributions to the field of small universal Turing machines
Fundamenta Informaticae | 2016-05-11 | Paper |
The two-handed tile assembly model is not intrinsically universal
Algorithmica | 2016-03-29 | Paper |
The two-handed tile assembly model is not intrinsically universal
Algorithmica | 2016-03-29 | Paper |
Tag systems and the complexity of simple programs
Cellular Automata and Discrete Complex Systems | 2015-08-07 | Paper |
Uniformity is Weaker than Semi-Uniformity for Some Membrane Systems
Fundamenta Informaticae | 2015-06-26 | Paper |
Maurice Margenstern's contributions to the field of small universal Turing machines
Automata, Universality, Computation | 2015-04-14 | Paper |
Fast algorithmic self-assembly of simple shapes using random agitation
Lecture Notes in Computer Science | 2014-10-08 | Paper |
Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy
Journal of Complexity | 2014-07-31 | Paper |
Parallel Computation Using Active Self-assembly
Lecture Notes in Computer Science | 2014-07-07 | Paper |
Parallel Computation Using Active Self-assembly
Lecture Notes in Computer Science | 2014-07-07 | Paper |
One tile to rule them all: simulating any tile assembly system with a single universal tile
Automata, Languages, and Programming | 2014-07-01 | Paper |
The Two-Handed Tile Assembly Model Is Not Intrinsically Universal
Automata, Languages, and Programming | 2013-08-06 | Paper |
The Complexity of Small Universal Turing Machines: A Survey
SOFSEM 2012: Theory and Practice of Computer Science | 2012-06-15 | Paper |
| Intrinsic universality in self-assembly | 2012-01-23 | Paper |
The computational power of membrane systems under tight uniformity conditions
Natural Computing | 2011-05-23 | Paper |
Optical computing
Applied Mathematics and Computation | 2009-11-13 | Paper |
Random Number Selection in Self-assembly
Lecture Notes in Computer Science | 2009-10-22 | Paper |
Membrane Dissolution and Division in P
Lecture Notes in Computer Science | 2009-10-22 | Paper |
Small Weakly Universal Turing Machines
Fundamentals of Computation Theory | 2009-10-20 | Paper |
Small Semi-Weakly Universal Turing Machines
Fundamenta Informaticae | 2009-06-23 | Paper |
Four Small Universal Turing Machines
Fundamenta Informaticae | 2009-06-23 | Paper |
P-completeness of Cellular Automaton Rule 110
Automata, Languages and Programming | 2009-03-12 | Paper |
Small Semi-weakly Universal Turing Machines
Lecture Notes in Computer Science | 2009-03-05 | Paper |
Four Small Universal Turing Machines
Lecture Notes in Computer Science | 2009-03-05 | Paper |
The complexity of small universal Turing machines: A survey
Theoretical Computer Science | 2009-03-02 | Paper |
A Characterisation of NL Using Membrane Systems without Charges and Dissolution
Unconventional Computing | 2008-12-02 | Paper |
Lower bounds on the computational power of an optical model of computation
Natural Computing | 2008-05-20 | Paper |
Active Membrane Systems Without Charges and Using Only Symmetric Elementary Division Characterise P
Membrane Computing | 2008-03-28 | Paper |
Optical Computing and Computational Complexity
Lecture Notes in Computer Science | 2007-11-29 | Paper |
The Complexity of Small Universal Turing Machines
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Small fast universal Turing machines
Theoretical Computer Science | 2006-10-20 | Paper |
Unconventional Computation
Lecture Notes in Computer Science | 2006-07-07 | Paper |
New Computational Paradigms
Lecture Notes in Computer Science | 2006-01-11 | Paper |
An optical model of computation
Theoretical Computer Science | 2005-06-01 | Paper |
| scientific article; zbMATH DE number 1738670 (Why is no real title available?) | 2002-05-07 | Paper |
