Wojciech Plandowski

Aleksy Schubert

Theor. Comput. Sci., 2019

On <i>PSPACE</i> generation of a solution set of a word equation and its applications.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Generalized Word Equations: A New Approach to Data Compresion.

[BibT_eX]

[DOI]

Michal Kutwin

Artur Zaroda

Proceedings of the Data Compression Conference, 2019

2015

Complete Characterization of Zero-expressible Functions.

[BibT_eX]

[DOI]

Robert Dabrowski

Fundam. Informaticae, 2015

2014

Finding All Solutions of Equations in Free Groups and Monoids with Involution.

[BibT_eX]

[DOI]

Volker Diekert

Artur Jez

Proceedings of the Computer Science - Theory and Applications, 2014

2009

On systems of word equations over three unknowns with at most six occurrences of one of the unknowns.

[BibT_eX]

[DOI]

Elena Czeizler

Theor. Comput. Sci., 2009

Shortest synchronizing strings for Huffman codes.

[BibT_eX]

[DOI]

Marek Tomasz Biskup

Theor. Comput. Sci., 2009

Word Equations with One Unknown.

[BibT_eX]

[DOI]

Markku Laine

Proceedings of the Developments in Language Theory, 13th International Conference, 2009

Guaranteed Synchronization of Huffman Codes with Known Position of Decoder.

[BibT_eX]

[DOI]

Marek Tomasz Biskup

Proceedings of the 2009 Data Compression Conference (DCC 2009), 2009

2006

An efficient algorithm for solving word equations.

[BibT_eX]

[DOI]

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

2004

Solving Two-Variable Word Equations (Extended Abstract).

[BibT_eX]

[DOI]

Robert Dabrowski

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003

A defect theorem for bi-infinite words.

[BibT_eX]

[DOI]

Ján Manuch

Theor. Comput. Sci., 2003

On special families of morphisms related to [delta]-matching and don't care symbols.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

The complexity of compressing subsegments of images described by finite automata.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

Test Sets for Large Families of Languages.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 7th International Conference, 2003

2002

Locally Periodic Versus Globally Periodic Infinite Words.

[BibT_eX]

[DOI]

Arto Lepistö

J. Comb. Theory A, 2002

On Word Equations in One Variable.

[BibT_eX]

[DOI]

Robert Dabrowski

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

Three Heuristics for delta-Matching: delta-BM Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

2001

On the Complexity of Decidable Cases of Commutation Problem for Languages.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

2000

Algorithms for the parallel alternating direction access machine.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Pattern-Matching Problems for Two-Dimensional Images Described by Finite Automata.

[BibT_eX]

Nord. J. Comput., 2000

Two-Variable Word Equations.

[BibT_eX]

[DOI]

Lucian Ilie

Proceedings of the STACS 2000, 2000

1999

Generalized Factorizations of Words and Their Algorithmic Properties.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

Fast Practical Multi-Pattern Matching.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1999

Satisfiability of Word Equations with Constants is in NEXPTIME.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Satisfiability of Word Equations with Constants is in PSPACE.

[BibT_eX]

[DOI]

Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

On the complexity of computing the order of repetition of a string.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 1999

The Compression of Subsegments of Images Described by Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 10th Annual Symposium, 1999

Complexity of Language Recognition Problems for Compressed Words.

[BibT_eX]

Proceedings of the Jewels are Forever, 1999

1998

On Defect Effect of Bi-Infinite Words.

[BibT_eX]

[DOI]

Ján Manuch

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

Application of Lempel-Ziv Encodings to the Solution of Words Equations.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

Locally Periodic Infinite Words and a Chaotic Behaviour.

[BibT_eX]

[DOI]

Arto Lepistö

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997

The Expressibility of Languages and Relations by Word Equations.

[BibT_eX]

[DOI]

Filippo Mignosi

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Pattern-Matching Problems for 2-Dimensional Images Described by Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

A lower bound for a constant in Shallit's conjecture.

[BibT_eX]

Filippo Mignosi

Proceedings of the 3rd International Conference Developments in Language Theory, 1997

On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 8th Annual Symposium, 1997

1996

Parallel Tree-Contraction and Fibonacci Numbers.

[BibT_eX]

[DOI]

Tomasz Szymacha

Inf. Process. Lett., 1996

Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 1996

Parallel Alternating-Direction Access Machine.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 7th Annual Symposium, 1996

1995

The Zooming Method: A Recursive Approach to Time-Space Efficient String-Matching.

[BibT_eX]

[DOI]

Leszek Gasieniec

Theor. Comput. Sci., 1995

Work-time-optimal parallel algorithms for string problems.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Two-Dimensional Pattern Matching in Linear Time and Small Space.

[BibT_eX]

[DOI]

Proceedings of the STACS 95, 1995

Compactness of Systems of Equations in Semigroups.

[BibT_eX]

[DOI]

Tero Harju

Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

Constant-Space String Matching with Smaller Number of Comparisons: Sequential Sampling.

[BibT_eX]

[DOI]

Leszek Gasieniec

Proceedings of the Combinatorial Pattern Matching, 6th Annual Symposium, 1995

1994

On the Size of Independent Systems of Equations in Semigroups.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

Testing Equivalence of Morphisms on Context-Free Languages.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1994

On the Defect Effect of Many Identities in Free Semigroups.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Aspects of Natural and Formal Languages, 1994

1992

Speeding Up Two String-Matching Algorithms.

[BibT_eX]

[DOI]

Proceedings of the STACS 92, 1992

Polynomial Size Test Sets for Context-Free Languages.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

1991

Exact Analysis of Three Tree Contraction Algorithms.

[BibT_eX]

[DOI]