| Publication | Date of Publication | Type |
|---|
Realizations of crystal nets. I: (Generalized) derived graphs
Acta Crystallographica. Section A | 2025-01-16 | Paper |
Cut-and-project graphs and other complexes
Theoretical Computer Science | 2021-11-11 | Paper |
Counter machines and crystallographic structures
Natural Computing | 2019-07-08 | Paper |
Traversal languages capturing isomorphism classes of Sierpiński gaskets
Unconventional Computation and Natural Computation | 2016-09-28 | Paper |
Prospects for mathematical crystallography
Acta Crystallographica. Section A | 2016-05-27 | Paper |
Languages associated with crystallographic symmetry
Unconventional Computation and Natural Computation | 2015-09-14 | Paper |
Is logic necessary?
Logica Universalis | 2013-01-25 | Paper |
Generating geometric graphs using automorphisms
Journal of Graph Algorithms and Applications | 2012-12-04 | Paper |
On stoichiometry for the assembly of flexible tile DNA complexes
Natural Computing | 2012-11-15 | Paper |
| Periodic Euclidean Graphs on Integer Points | 2011-05-11 | Paper |
When is betweenness preserved?
Rocky Mountain Journal of Mathematics | 2009-04-07 | Paper |
Expectation and Variance of Self-assembled Graph Structures
DNA Computing | 2009-04-02 | Paper |
Complexity classes for self-assembling flexible tiles
Theoretical Computer Science | 2009-03-02 | Paper |
Spectrum of a Pot for DNA Complexes
DNA Computing | 2008-04-04 | Paper |
Describing Self-assembly of Nanostructures
SOFSEM 2008: Theory and Practice of Computer Science | 2008-03-07 | Paper |
Flexible Versus Rigid Tile Assembly
Lecture Notes in Computer Science | 2007-11-29 | Paper |
Pebble games and subroutines in least fixed point logic
Information and Computation | 2006-10-10 | Paper |
| Unconventional Computation | 2006-07-07 | Paper |
An introduction to random trees
Research on Language and Computation | 2005-03-15 | Paper |
Threshold Functions for Random Graphs on a Line Segment
Combinatorics, Probability and Computing | 2004-09-24 | Paper |
| scientific article; zbMATH DE number 2076813 (Why is no real title available?) | 2004-06-22 | Paper |
Guarded quantification in least fixed point logic
Journal of Logic, Language and Information | 2004-03-15 | Paper |
On the structure of random unlabelled acyclic graphs.
Discrete Mathematics | 2004-03-14 | Paper |
MSO zero-one laws on random labelled acyclic graphs
Discrete Mathematics | 2002-08-29 | Paper |
| scientific article; zbMATH DE number 1286037 (Why is no real title available?) | 2000-02-15 | Paper |
An Application of Spanning Trees to k -Point Separating Families of Functions
Journal of the London Mathematical Society | 1999-09-27 | Paper |
| scientific article; zbMATH DE number 1256653 (Why is no real title available?) | 1999-04-22 | Paper |
A splitting inequality
The Ramanujan Journal | 1999-02-17 | Paper |
Hierarchies in transitive closure logic, stratified Datalog and infinitary logic
Annals of Pure and Applied Logic | 1996-10-13 | Paper |
The dimension of the negation of transitive closure
Journal of Symbolic Logic | 1995-11-28 | Paper |
On the power of deterministic transitive closures
Information and Computation | 1995-08-01 | Paper |
Dimension Versus Number of Variables, and Connectivity, too
Mathematical Logic Quarterly | 1995-07-27 | Paper |
Eventual periodicity and ``one-dimensional queries
Notre Dame Journal of Formal Logic | 1993-02-22 | Paper |
On the complexity of deadlock-free programs on a ring of processors
Journal of Parallel and Distributed Computing | 1993-01-17 | Paper |
A Ramseyian theorem on products of trees
Journal of Combinatorial Theory. Series A | 1992-06-25 | Paper |
SOME RAMSEY THEORY IN BOOLEAN ALGEBRA FOR COMPLEXITY CLASSES
Mathematical Logic Quarterly | 1992-01-01 | Paper |
Parametrization over inductive relations of a bounded number of variables
Annals of Pure and Applied Logic | 1990-01-01 | Paper |
When is arithmetic possible?
Annals of Pure and Applied Logic | 1990-01-01 | Paper |
Some restrictions on simple fixed points of the integers
Journal of Symbolic Logic | 1989-01-01 | Paper |
