| Publication | Date of Publication | Type |
|---|
The equivalence of pebbles and sensing heads for finite automata
Fundamentals of Computation Theory | 2022-12-09 | Paper |
LIKE patterns and complexity
(available as arXiv preprint) | 2020-02-24 | Paper |
Simpler, faster and shorter labels for distances in graphs
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Busy beaver scores and alphabet size
(available as arXiv preprint) | 2017-11-22 | Paper |
Backing up in singly linked lists
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
A Note on Pushdown Automata Systems
Descriptional Complexity of Formal Systems | 2014-08-07 | Paper |
The power of centralized PC systems of pushdown automata
Descriptional Complexity of Formal Systems | 2013-08-09 | Paper |
Bounded counter languages
Descriptional Complexity of Formal Systems | 2012-11-02 | Paper |
Simulations by time-bounded counter machines
International Journal of Foundations of Computer Science | 2011-03-30 | Paper |
Range mode and range median queries in constant time and sub-quadratic space
Information Processing Letters | 2010-06-16 | Paper |
String matching with simple devices
Information Processing Letters | 2010-03-24 | Paper |
On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's
Theoretical Computer Science | 2009-08-07 | Paper |
Simulations by Time-Bounded Counter Machines
Developments in Language Theory | 2009-07-07 | Paper |
Backing up in singly linked lists
Journal of the ACM | 2008-12-21 | Paper |
Sorting and Element Distinctness on One-Way Turing Machines
Language and Automata Theory and Applications | 2008-11-20 | Paper |
Improved Bounds for Range Mode and Range Median Queries
SOFSEM 2008: Theory and Practice of Computer Science | 2008-03-07 | Paper |
Element Distinctness and Sorting on One-Tape Off-Line Turing Machines
SOFSEM 2008: Theory and Practice of Computer Science | 2008-03-07 | Paper |
Efficient Simulations by Queue Machines
SIAM Journal on Computing | 2006-06-01 | Paper |
Complexity results for prefix grammars
RAIRO - Theoretical Informatics and Applications | 2005-07-13 | Paper |
Complexity results for prefix grammars
RAIRO - Theoretical Informatics and Applications | 2005-07-13 | Paper |
Complexity results for prefix grammars
RAIRO - Theoretical Informatics and Applications | 2005-07-13 | Paper |
A NOTE ON REBOUND TURING MACHINES
International Journal of Foundations of Computer Science | 2005-04-18 | Paper |
Regular frequency computations
Theoretical Computer Science | 2005-02-22 | Paper |
Element distinctness on one-tape Turing machines: a complete solution
Acta Informatica | 2004-12-09 | Paper |
| scientific article; zbMATH DE number 2086412 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 1796967 (Why is no real title available?) | 2002-09-05 | Paper |
Bounds for the Element Distinctness Problem on one-tape Turing machines
Information Processing Letters | 2002-07-14 | Paper |
| scientific article; zbMATH DE number 1759445 (Why is no real title available?) | 2002-06-25 | Paper |
Improved bounds for functions related to busy beavers
Theory of Computing Systems | 2002-05-30 | Paper |
Regular frequency computations
RIMS Kokyuroku | 2001-09-23 | Paper |
| scientific article; zbMATH DE number 1502107 (Why is no real title available?) | 2000-09-04 | Paper |
Cryptographic copyright protection for digital images based on watermarking techniques
Theoretical Computer Science | 2000-09-03 | Paper |
| scientific article; zbMATH DE number 1418343 (Why is no real title available?) | 2000-03-19 | Paper |
| scientific article; zbMATH DE number 1400022 (Why is no real title available?) | 2000-02-06 | Paper |
| scientific article; zbMATH DE number 1361502 (Why is no real title available?) | 1999-11-10 | Paper |
| scientific article; zbMATH DE number 1222567 (Why is no real title available?) | 1999-03-02 | Paper |
| scientific article; zbMATH DE number 1149903 (Why is no real title available?) | 1998-11-17 | Paper |
| scientific article; zbMATH DE number 1149911 (Why is no real title available?) | 1998-11-17 | Paper |
| scientific article; zbMATH DE number 1024098 (Why is no real title available?) | 1997-10-20 | Paper |
| scientific article; zbMATH DE number 1015106 (Why is no real title available?) | 1997-05-30 | Paper |
A note on the commutative closure of star-free languages
Information Processing Letters | 1997-02-28 | Paper |
The Computation of Partial Recursive Word‐Functions Without Read Instructions
Mathematical Logic Quarterly | 1996-07-28 | Paper |
Cancellation in context-free languages: enrichment by reduction
Theoretical Computer Science | 1995-01-26 | Paper |
| scientific article; zbMATH DE number 512829 (Why is no real title available?) | 1994-03-10 | Paper |
| scientific article; zbMATH DE number 4139308 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4047162 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4024816 (Why is no real title available?) | 1987-01-01 | Paper |
