| Publication | Date of Publication | Type |
|---|
Efficient algorithms for Lempel-Ziv encoding
Algorithm Theory — SWAT'96 | 2022-12-09 | Paper |
Pattern-matching problems for 2-dimensional images described by finite automata
Fundamentals of Computation Theory | 2022-12-09 | Paper |
On the size of independent systems of equations in semigroups
Mathematical Foundations of Computer Science 1994 | 2022-08-18 | Paper |
Speeding up two string-matching algorithms
STACS 92 | 2022-08-18 | Paper |
Polynomial size test sets for context-free languages
Automata, Languages and Programming | 2019-12-04 | Paper |
On PSPACE generation of a solution set of a word equation and its applications
Theoretical Computer Science | 2019-10-07 | Paper |
On the complexity of computation maximal exponent of periodicity of word equations and expressible relations (note)
Theoretical Computer Science | 2019-10-07 | Paper |
Compactness of systems of equations in semigroups
Automata, Languages and Programming | 2019-01-10 | Paper |
The expressibility of languages and relations by word equations
Automata, Languages and Programming | 2018-07-04 | Paper |
Two-dimensional pattern matching in linear time and small space
STACS 95 | 2017-12-04 | Paper |
Finding all solutions of equations in free groups and monoids with involution
Information and Computation | 2016-11-18 | Paper |
Satisfiability of word equations with constants is in NEXPTIME
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Complete characterization of zero-expressible functions
Fundamenta Informaticae | 2016-04-28 | Paper |
An efficient algorithm for solving word equations
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Finding All Solutions of Equations in Free Groups and Monoids with Involution
Computer Science - Theory and Applications | 2014-06-24 | Paper |
On word equations in one variable
Algorithmica | 2011-07-01 | Paper |
Word equations with one unknown
International Journal of Foundations of Computer Science | 2011-03-30 | Paper |
Satisfiability of word equations with constants is in PSPACE
Journal of the ACM | 2010-08-17 | Paper |
Shortest synchronizing strings for Huffman codes
Theoretical Computer Science | 2009-09-10 | Paper |
On systems of word equations over three unknowns with at most six occurrences of one of the unknowns
Theoretical Computer Science | 2009-08-07 | Paper |
Word Equations with One Unknown
Developments in Language Theory | 2009-07-07 | Paper |
On special families of morphisms related to \(\delta \)-matching and don't care symbols
Information Processing Letters | 2009-03-23 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
| scientific article; zbMATH DE number 2185641 (Why is no real title available?) | 2005-07-04 | Paper |
On the complexity of decidable cases of the commutation problem of languages
Theoretical Computer Science | 2005-06-30 | Paper |
| scientific article; zbMATH DE number 2087053 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2040897 (Why is no real title available?) | 2004-02-11 | Paper |
| scientific article; zbMATH DE number 1998335 (Why is no real title available?) | 2003-12-15 | Paper |
| On the complexity of computing the order of repetition of a string | 2003-06-26 | Paper |
The expressibility of languages and relations by word equations
Journal of the ACM | 2003-06-25 | Paper |
| scientific article; zbMATH DE number 1929939 (Why is no real title available?) | 2003-06-18 | Paper |
On the complexity of pattern matching for highly compressed two-dimensional texts.
Journal of Computer and System Sciences | 2003-05-14 | Paper |
Locally periodic versus globally periodic infinite words
Journal of Combinatorial Theory. Series A | 2003-03-26 | Paper |
The complexity of compressing subsegments of images described by finite automata
Discrete Applied Mathematics | 2003-03-09 | Paper |
A defect theorem for bi-infinite words.
Theoretical Computer Science | 2003-01-22 | Paper |
| scientific article; zbMATH DE number 1839444 (Why is no real title available?) | 2002-12-02 | Paper |
Fast practical multi-pattern matching
Information Processing Letters | 2002-07-25 | Paper |
| scientific article; zbMATH DE number 1263250 (Why is no real title available?) | 2002-01-30 | Paper |
On the expressibility of languages by word equations with a bounded number of variables
Bulletin of the Belgian Mathematical Society - Simon Stevin | 2002-01-14 | Paper |
Two-variable word equations
RAIRO. Theoretical Informatics and Applications | 2001-07-23 | Paper |
Two-variable word equations
RAIRO. Theoretical Informatics and Applications | 2001-07-23 | Paper |
| scientific article; zbMATH DE number 1496854 (Why is no real title available?) | 2001-04-19 | Paper |
| scientific article; zbMATH DE number 1500512 (Why is no real title available?) | 2000-09-04 | Paper |
Algorithms for the parallel alternating direction access machine
Theoretical Computer Science | 2000-08-21 | Paper |
| scientific article; zbMATH DE number 1408351 (Why is no real title available?) | 2000-02-29 | Paper |
Generalized factorizations of words and their algorithmic properties
Theoretical Computer Science | 1999-06-21 | Paper |
| scientific article; zbMATH DE number 1222603 (Why is no real title available?) | 1999-06-21 | Paper |
| scientific article; zbMATH DE number 1223734 (Why is no real title available?) | 1998-11-15 | Paper |
| scientific article; zbMATH DE number 1223721 (Why is no real title available?) | 1998-11-15 | Paper |
Compactness of Systems of Equations in Semigroups
International Journal of Algebra and Computation | 1998-02-25 | Paper |
The zooming method: A recursive approach to time-space efficient string-matching
Theoretical Computer Science | 1997-09-29 | Paper |
Parallel tree-contraction and Fibonacci numbers
Information Processing Letters | 1997-02-27 | Paper |
On the size of independent systems of equations in semigroups
Theoretical Computer Science | 1997-02-27 | Paper |
Polynomial size test sets for context-free languages
Journal of Computer and System Sciences | 1996-03-18 | Paper |
Speeding up two string-matching algorithms
Algorithmica | 1996-02-26 | Paper |
