| Publication | Date of Publication | Type |
|---|
| Cut-and-project graphs and other complexes | 2021-11-11 | Paper |
| Counter machines and crystallographic structures | 2019-07-08 | Paper |
| Traversal Languages Capturing Isomorphism Classes of Sierpiński Gaskets | 2016-09-28 | Paper |
| Prospects for mathematical crystallography | 2016-05-27 | Paper |
| Languages Associated with Crystallographic Symmetry | 2015-09-14 | Paper |
| Is logic necessary? | 2013-01-25 | Paper |
| Generating Geometric Graphs Using Automorphisms | 2012-12-04 | Paper |
| On stoichiometry for the assembly of flexible tile DNA complexes | 2012-11-15 | Paper |
| Periodic Euclidean Graphs on Integer Points | 2011-05-11 | Paper |
| When is betweenness preserved? | 2009-04-07 | Paper |
| Expectation and Variance of Self-assembled Graph Structures | 2009-04-02 | Paper |
| Complexity classes for self-assembling flexible tiles | 2009-03-02 | Paper |
| Spectrum of a Pot for DNA Complexes | 2008-04-04 | Paper |
| Describing Self-assembly of Nanostructures | 2008-03-07 | Paper |
| Flexible Versus Rigid Tile Assembly | 2007-11-29 | Paper |
| Pebble games and subroutines in least fixed point logic | 2006-10-10 | Paper |
| Unconventional Computation | 2006-07-07 | Paper |
| An introduction to random trees | 2005-03-15 | Paper |
| Threshold Functions for Random Graphs on a Line Segment | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470244 | 2004-06-22 | Paper |
| Guarded quantification in least fixed point logic | 2004-03-15 | Paper |
| On the structure of random unlabelled acyclic graphs. | 2004-03-14 | Paper |
| MSO zero-one laws on random labelled acyclic graphs | 2002-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4242579 | 2000-02-15 | Paper |
| An Application of Spanning Trees to k -Point Separating Families of Functions | 1999-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230339 | 1999-04-22 | Paper |
| A splitting inequality | 1999-02-17 | Paper |
| Hierarchies in transitive closure logic, stratified Datalog and infinitary logic | 1996-10-13 | Paper |
| The dimension of the negation of transitive closure | 1995-11-28 | Paper |
| On the power of deterministic transitive closures | 1995-08-01 | Paper |
| Dimension Versus Number of Variables, and Connectivity, too | 1995-07-27 | Paper |
| Eventual periodicity and ``one-dimensional queries | 1993-02-22 | Paper |
| On the complexity of deadlock-free programs on a ring of processors | 1993-01-17 | Paper |
| A Ramseyian theorem on products of trees | 1992-06-25 | Paper |
| SOME RAMSEY THEORY IN BOOLEAN ALGEBRA FOR COMPLEXITY CLASSES | 1992-01-01 | Paper |
| Parametrization over inductive relations of a bounded number of variables | 1990-01-01 | Paper |
| When is arithmetic possible? | 1990-01-01 | Paper |
| Some restrictions on simple fixed points of the integers | 1989-01-01 | Paper |
