| Publication | Date of Publication | Type |
|---|
| Learning strongly deterministic even linear languages from positive examples | 2023-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4615189 | 2019-02-01 | Paper |
| REINFORCING THE SPRING ALGORITHMS: THE TAGUCHI APPROACH | 2017-03-10 | Paper |
| A Note on the Emptiness of Intersection Problem for Left Szilard Languages | 2016-09-09 | Paper |
| On inferring linear single-tree languages | 2016-06-16 | Paper |
| Inferring uniquely terminating regular languages from positive data | 2016-05-26 | Paper |
| An annotated bibliography on the thickness, outerthickness, and arboricity of a graph | 2016-04-05 | Paper |
| On some derivation mechanisms and the complexity of their Szilard languages | 2014-06-10 | Paper |
| Searching for Traces of Communication in Szilard Languages of Parallel Communicating Grammar Systems - Complexity Views | 2013-08-09 | Paper |
| The Complexity of Szilard Languages of Matrix Grammars Revisited | 2013-06-27 | Paper |
| On the Complexity of Szilard Languages of Regulated Grammars | 2012-01-06 | Paper |
| One- and two-page crossing numbers for some types of graphs | 2010-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3581766 | 2010-09-02 | Paper |
| Three New Algorithms for Regular Language Enumeration | 2009-07-23 | Paper |
| Finding the permutations corresponding to a given Young tableau | 2009-02-24 | Paper |
| On a parallel machine scheduling problem with precedence constraints | 2007-05-15 | Paper |
| Parallelisation of genetic algorithms for the 2-page crossing number problem | 2007-02-14 | Paper |
| Remarks on the thickness and outerthickness of a graph | 2006-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5715559 | 2006-01-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4827900 | 2004-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4465343 | 2004-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4431367 | 2003-10-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4430319 | 2003-10-20 | Paper |
| A note on Rémy's algorithm for generating random binary trees | 2003-09-16 | Paper |
| A Comparison of Random Binary Tree Generators | 2003-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796536 | 2003-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4793109 | 2003-02-18 | Paper |
| A family of languages which is polynomial-time learnable from positive data in pitt's sense | 2002-12-19 | Paper |
| SE-SYSTEMS, TIMING MECHANISMS, AND TIME-VARYING CODES | 2002-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551610 | 2002-08-28 | Paper |
| Minimally adequate teacher synthesizes statechart diagrams | 2002-08-14 | Paper |
| A note on synchronized extension systems | 2002-07-14 | Paper |
| A genetic algorithm for determining the thickness of a graph | 2002-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4330728 | 2002-05-14 | Paper |
| A Survey on Binary Tree Codings | 2002-01-17 | Paper |
| Left distance binary tree representations | 2002-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2730722 | 2001-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753908 | 2001-12-09 | Paper |
| On the longest upsequence problem for permutations | 2001-10-28 | Paper |
| Synchronized extension systems | 2001-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4505705 | 2001-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2714262 | 2001-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2714263 | 2001-06-13 | Paper |
| Comment on 'A Framework for Modelling Trojans and Computer Virus Infection' | 2001-01-01 | Paper |
| Constructing a binary tree efficiently from its traversals | 2000-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4704591 | 2000-07-19 | Paper |
| Searching neural network structures with L systems and genetic algorithms | 2000-01-31 | Paper |
| Generating random binary trees -- a survey | 2000-01-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4235439 | 1999-12-13 | Paper |
| Remarks on the thickness of a graph | 1999-06-22 | Paper |
| Binary Tree Code Words as Context-Free Languages | 1999-05-31 | Paper |
| Inferring regular languages by merging nonterminals | 1999-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4231580 | 1999-03-14 | Paper |
| Ranking and unranking left szilard languages | 1998-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4399255 | 1998-07-28 | Paper |
| Learning deterministic even linear languages from positive examples | 1998-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4358451 | 1997-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4896950 | 1996-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4864474 | 1996-06-27 | Paper |
| Genetic algorithms for drawing bipartite graphs | 1996-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763516 | 1995-04-18 | Paper |
| On homomorphic images of left szilard languages | 1995-03-30 | Paper |
| Remarks on the structural grammatical inference problem for context-free grammars | 1993-04-01 | Paper |
| On the structural grammatical inference problem for some classes of context-free grammars | 1993-01-16 | Paper |
| On drawing regular bipartite graphs | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4015487 | 1993-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4005191 | 1992-09-27 | Paper |
| Splay trees as priority queues | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3993679 | 1992-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3982062 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4712662 | 1992-06-25 | Paper |
| A linear time and space algorithm for finding isomorphic subtrees of a binary tree | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3200545 | 1991-01-01 | Paper |
| The grammatical inference problem for the Szilard languages of linear grammars | 1990-01-01 | Paper |
| TREE COMPRESSION AND OPTIMIZATION WITH APPLICATIONS | 1990-01-01 | Paper |
| How to draw a hypergraph | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3477984 | 1990-01-01 | Paper |
| Experiments on drawing 2-level hierarchical graphs | 1990-01-01 | Paper |
| Experiments on drawing 2-level hierarchical graphs | 1990-01-01 | Paper |
| On the subtree isomorphism problem for ordered trees | 1989-01-01 | Paper |
| Constructing a binary tree from its traversals | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4207581 | 1989-01-01 | Paper |
| On linear search heuristics | 1988-01-01 | Paper |
| On circular layouts∗ | 1988-01-01 | Paper |
| Two complexity measures for context-free languages | 1988-01-01 | Paper |
| On top-down splaying | 1987-01-01 | Paper |
| A note on the inclusion problem for szilard languages† | 1987-01-01 | Paper |
| A note on pure grammars | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3028359 | 1986-01-01 | Paper |
| On homomorphic images of szilard languages | 1986-01-01 | Paper |
| A note on depth-first derivations | 1985-01-01 | Paper |
| An undecidable problem for context-free grammars | 1985-01-01 | Paper |
| On permutative grammars generating context-free languages | 1985-01-01 | Paper |
| A note on undercover relation | 1985-01-01 | Paper |
| On context-free and Szilard languages | 1984-01-01 | Paper |
| On derivation preservation | 1984-01-01 | Paper |
| Boundedness testing for unambiguous context-free grammars | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3325061 | 1983-01-01 | Paper |
