| Publication | Date of Publication | Type |
|---|
| The equivalence of pebbles and sensing heads for finite automata | 2022-12-09 | Paper |
| LIKE patterns and complexity | 2020-02-24 | Paper |
| Simpler, faster and shorter labels for distances in graphs | 2018-07-16 | Paper |
| Busy beaver scores and alphabet size | 2017-11-22 | Paper |
| Backing up in singly linked lists | 2016-09-29 | Paper |
| A Note on Pushdown Automata Systems | 2014-08-07 | Paper |
| The Power of Centralized PC Systems of Pushdown Automata | 2013-08-09 | Paper |
| Bounded Counter Languages | 2012-11-02 | Paper |
| SIMULATIONS BY TIME-BOUNDED COUNTER MACHINES | 2011-03-30 | Paper |
| Range mode and range median queries in constant time and sub-quadratic space | 2010-06-16 | Paper |
| String matching with simple devices | 2010-03-24 | Paper |
| On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's | 2009-08-07 | Paper |
| Simulations by Time-Bounded Counter Machines | 2009-07-07 | Paper |
| Backing up in singly linked lists | 2008-12-21 | Paper |
| Sorting and Element Distinctness on One-Way Turing Machines | 2008-11-20 | Paper |
| Element Distinctness and Sorting on One-Tape Off-Line Turing Machines | 2008-03-07 | Paper |
| Improved Bounds for Range Mode and Range Median Queries | 2008-03-07 | Paper |
| Efficient Simulations by Queue Machines | 2006-06-01 | Paper |
| Complexity results for prefix grammars | 2005-07-13 | Paper |
| A NOTE ON REBOUND TURING MACHINES | 2005-04-18 | Paper |
| Regular frequency computations | 2005-02-22 | Paper |
| Element distinctness on one-tape Turing machines: a complete solution | 2004-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736867 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551361 | 2002-09-05 | Paper |
| Bounds for the Element Distinctness Problem on one-tape Turing machines | 2002-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536395 | 2002-06-25 | Paper |
| Improved bounds for functions related to busy beavers | 2002-05-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2742600 | 2001-09-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4503148 | 2000-09-04 | Paper |
| Cryptographic copyright protection for digital images based on watermarking techniques | 2000-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941906 | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4939575 | 2000-02-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4699321 | 1999-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218105 | 1999-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4387315 | 1998-11-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4387323 | 1998-11-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4341792 | 1997-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4338855 | 1997-05-30 | Paper |
| A note on the commutative closure of star-free languages | 1997-02-28 | Paper |
| The Computation of Partial Recursive Word‐Functions Without Read Instructions | 1996-07-28 | Paper |
| Cancellation in context-free languages: enrichment by reduction | 1995-01-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281522 | 1994-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3471701 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3766878 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783607 | 1987-01-01 | Paper |
