| Publication | Date of Publication | Type |
|---|
| Turning machines | 2023-10-27 | Paper |
| Small tile sets that compute while solving mazes | 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 | 2021-07-06 | Paper |
| Intrinsic universality and the computational power of self-assembly | 2021-06-10 | Paper |
| AND and/or OR: uniform polynomial-size circuits | 2021-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5145159 | 2021-01-20 | Paper |
| The program-size complexity of self-assembled paths | 2021-01-19 | Paper |
| Parallel computation using active self-assembly | 2019-07-08 | Paper |
| Intrinsic universality in tile self-assembly requires cooperation | 2019-06-20 | Paper |
| Thermodynamic binding networks | 2018-02-02 | Paper |
| The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation | 2017-08-17 | Paper |
| Active self-assembly of algorithmic shapes and patterns in polylogarithmic time | 2017-05-16 | Paper |
| Yurii Rogozhin's contributions to the field of small universal Turing machines | 2016-05-11 | Paper |
| The two-handed tile assembly model is not intrinsically universal | 2016-03-29 | Paper |
| Tag systems and the complexity of simple programs | 2015-08-07 | Paper |
| Uniformity is Weaker than Semi-Uniformity for Some Membrane Systems | 2015-06-26 | Paper |
| Maurice Margenstern's contributions to the field of small universal Turing machines | 2015-04-14 | Paper |
| Fast algorithmic self-assembly of simple shapes using random agitation | 2014-10-08 | Paper |
| Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy | 2014-07-31 | Paper |
| Parallel Computation Using Active Self-assembly | 2014-07-07 | Paper |
| One tile to rule them all: simulating any tile assembly system with a single universal tile | 2014-07-01 | Paper |
| The Two-Handed Tile Assembly Model Is Not Intrinsically Universal | 2013-08-06 | Paper |
| The Complexity of Small Universal Turing Machines: A Survey | 2012-06-15 | Paper |
| Intrinsic universality in self-assembly | 2012-01-23 | Paper |
| The computational power of membrane systems under tight uniformity conditions | 2011-05-23 | Paper |
| Optical computing | 2009-11-13 | Paper |
| Random Number Selection in Self-assembly | 2009-10-22 | Paper |
| Membrane Dissolution and Division in P | 2009-10-22 | Paper |
| Small Weakly Universal Turing Machines | 2009-10-20 | Paper |
| Small Semi-Weakly Universal Turing Machines | 2009-06-23 | Paper |
| Four Small Universal Turing Machines | 2009-06-23 | Paper |
| P-completeness of Cellular Automaton Rule 110 | 2009-03-12 | Paper |
| Small Semi-weakly Universal Turing Machines | 2009-03-05 | Paper |
| Four Small Universal Turing Machines | 2009-03-05 | Paper |
| The complexity of small universal Turing machines: A survey | 2009-03-02 | Paper |
| A Characterisation of NL Using Membrane Systems without Charges and Dissolution | 2008-12-02 | Paper |
| Lower bounds on the computational power of an optical model of computation | 2008-05-20 | Paper |
| Active Membrane Systems Without Charges and Using Only Symmetric Elementary Division Characterise P | 2008-03-28 | Paper |
| Optical Computing and Computational Complexity | 2007-11-29 | Paper |
| The Complexity of Small Universal Turing Machines | 2007-11-13 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Small fast universal Turing machines | 2006-10-20 | Paper |
| Unconventional Computation | 2006-07-07 | Paper |
| New Computational Paradigms | 2006-01-11 | Paper |
| An optical model of computation | 2005-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4530007 | 2002-05-07 | Paper |
