Exact Analysis of Three Tree Contraction Algorithms. - Wojciech Plandowski; Wojciech Rytter; Tomasz Szymacha (FCT, 1991)

On the Defect Effect of Many Identities in Free Semigroups. - Juhani Karhumäki; Wojciech Plandowski (Mathematical Aspects of Natural and Formal Languages, 1994)

Testing Equivalence of Morphisms on Context-Free Languages. - Wojciech Plandowski (ESA, 1994)

Speeding Up Two String-Matching Algorithms. - Maxime Crochemore; Artur Czumaj; Leszek Gasieniec; Stefan Jarominek; Thierry Lecroq; Wojciech Plandowski; Wojciech Rytter (Algorithmica, 1994)

Constant-Space String Matching with Smaller Number of Comparisons: Sequential Sampling. - Leszek Gasieniec; Wojciech Plandowski; Wojciech Rytter (CPM, 1995)

Two-Dimensional Pattern Matching in Linear Time and Small Space. - Maxime Crochemore; Leszek Gasieniec; Wojciech Plandowski; Wojciech Rytter (STACS, 1995)

Work-time-optimal parallel algorithms for string problems. - Artur Czumaj; Zvi Galil; Leszek Gasieniec; Kunsoo Park; Wojciech Plandowski (STOC, 1995)

Polynomial Size Test Sets for Context-Free Languages. - Juhani Karhumäki; Wojciech Plandowski; Wojciech Rytter (J. Comput. Syst. Sci., 1995)

The Zooming Method: A Recursive Approach to Time-Space Efficient String-Matching. - Leszek Gasieniec; Wojciech Plandowski; Wojciech Rytter (Theor. Comput. Sci., 1995)

Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract). - Leszek Gasieniec; Marek Karpinski; Wojciech Plandowski; Wojciech Rytter (CPM, 1996)

Parallel Alternating-Direction Access Machine. - Bogdan S. Chlebus; Artur Czumaj; Leszek Gasieniec; Miroslaw Kowaluk; Wojciech Plandowski (MFCS, 1996)

Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract). - Leszek Gasieniec; Marek Karpinski; Wojciech Plandowski; Wojciech Rytter (SWAT, 1996)

Parallel Tree-Contraction and Fibonacci Numbers. - Wojciech Plandowski; Wojciech Rytter; Tomasz Szymacha (Inf. Process. Lett., 1996)

On the Size of Independent Systems of Equations in Semigroups. - Juhani Karhumäki; Wojciech Plandowski (Theor. Comput. Sci., 1996)

A lower bound for a constant in Shallit's conjecture. - Juhani Karhumäki; Wojciech Plandowski; Filippo Mignosi (Developments in Language Theory, 1997)

Pattern-Matching Problems for 2-Dimensional Images Described by Finite Automata. - Juhani Karhumäki; Wojciech Plandowski; Wojciech Rytter (FCT, 1997)

Compactness of Systems of Equations in Semigroups. - Tero Harju; Juhani Karhumäki; Wojciech Plandowski (Int. J. Algebra Comput., 1997)

Locally Periodic Infinite Words and a Chaotic Behaviour. - Juhani Karhumäki; Arto Lepistö; Wojciech Plandowski (ICALP, 1998)

Application of Lempel-Ziv Encodings to the Solution of Words Equations. - Wojciech Plandowski; Wojciech Rytter (ICALP, 1998)

On Defect Effect of Bi-Infinite Words. - Juhani Karhumäki; Ján Manuch; Wojciech Plandowski (MFCS, 1998)

Complexity of Language Recognition Problems for Compressed Words. - Wojciech Plandowski; Wojciech Rytter (Jewels are Forever, 1999)

The Compression of Subsegments of Images Described by Finite Automata. - Juhani Karhumäki; Wojciech Plandowski; Wojciech Rytter (CPM, 1999)

On the complexity of computing the order of repetition of a string. - Juhani Karhumäki; Wojciech Plandowski (Developments in Language Theory, 1999)

Satisfiability of Word Equations with Constants is in NEXPTIME. - Wojciech Plandowski (STOC, 1999)

Fast Practical Multi-Pattern Matching. - Maxime Crochemore; Artur Czumaj; Leszek Gasieniec; Thierry Lecroq; Wojciech Plandowski; Wojciech Rytter (Inf. Process. Lett., 1999)

Generalized Factorizations of Words and Their Algorithmic Properties. - Juhani Karhumäki; Wojciech Plandowski; Wojciech Rytter (Theor. Comput. Sci., 1999)

Two-variable word equations. - Lucian Ilie; Wojciech Plandowski (RAIRO Theor. Informatics Appl., 2000)

The expressibility of languages and relations by word equations. - Juhani Karhumäki; Filippo Mignosi; Wojciech Plandowski (J. ACM, 2000)

Pattern-Matching Problems for Two-Dimensional Images Described by Finite Automata. - Juhani Karhumäki; Wojciech Plandowski; Wojciech Rytter (Nord. J. Comput., 2000)

Algorithms for the parallel alternating direction access machine. - Bogdan S. Chlebus; Artur Czumaj; Leszek Gasieniec; Miroslaw Kowaluk; Wojciech Plandowski (Theor. Comput. Sci., 2000)

Three Heuristics for delta-Matching: delta-BM Algorithms. - Maxime Crochemore; Costas S. Iliopoulos; Thierry Lecroq; Wojciech Plandowski; Wojciech Rytter (CPM, 2002)

On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts. - Piotr Berman; Marek Karpinski; Lawrence L. Larmore; Wojciech Plandowski; Wojciech Rytter (J. Comput. Syst. Sci., 2002)

Locally Periodic Versus Globally Periodic Infinite Words. - Juhani Karhumäki; Arto Lepistö; Wojciech Plandowski (J. Comb. Theory A, 2002)

Test Sets for Large Families of Languages. - Wojciech Plandowski (Developments in Language Theory, 2003)

The complexity of compressing subsegments of images described by finite automata. - Juhani Karhumäki; Wojciech Plandowski; Wojciech Rytter (Discret. Appl. Math., 2003)

On special families of morphisms related to [delta]-matching and don't care symbols. - Richard Cole 001; Costas S. Iliopoulos; Thierry Lecroq; Wojciech Plandowski; Wojciech Rytter (Inf. Process. Lett., 2003)

A defect theorem for bi-infinite words. - Juhani Karhumäki; Ján Manuch; Wojciech Plandowski (Theor. Comput. Sci., 2003)

Solving Two-Variable Word Equations (Extended Abstract). - Robert Dabrowski; Wojciech Plandowski (ICALP, 2004)

Satisfiability of word equations with constants is in PSPACE. - Wojciech Plandowski (J. ACM, 2004)

On the complexity of decidable cases of the commutation problem of languages. - Juhani Karhumäki; Wojciech Plandowski; Wojciech Rytter (Theor. Comput. Sci., 2005)

An efficient algorithm for solving word equations. - Wojciech Plandowski (STOC, 2006)

Guaranteed Synchronization of Huffman Codes with Known Position of Decoder. - Marek Tomasz Biskup; Wojciech Plandowski (DCC, 2009)

Shortest synchronizing strings for Huffman codes. - Marek Tomasz Biskup; Wojciech Plandowski (Theor. Comput. Sci., 2009)

On systems of word equations over three unknowns with at most six occurrences of one of the unknowns. - Elena Czeizler; Wojciech Plandowski (Theor. Comput. Sci., 2009)

On Word Equations in One Variable. - Robert Dabrowski; Wojciech Plandowski (Algorithmica, 2011)

Word Equations with One Unknown. - Markku Laine; Wojciech Plandowski (Int. J. Found. Comput. Sci., 2011)

Complete Characterization of Zero-expressible Functions. - Robert Dabrowski; Wojciech Plandowski (Fundam. Informaticae, 2015)

Finding all solutions of equations in free groups and monoids with involution. - Volker Diekert; Artur Jez; Wojciech Plandowski (Inf. Comput., 2016)

Generalized Word Equations: A New Approach to Data Compresion. - Michal Kutwin; Wojciech Plandowski; Artur Zaroda (DCC, 2019)

On PSPACE generation of a solution set of a word equation and its applications. - Wojciech Plandowski (Theor. Comput. Sci., 2019)

On the complexity of computation maximal exponent of periodicity of word equations and expressible relations (note). - Wojciech Plandowski; Aleksy Schubert (Theor. Comput. Sci., 2019)