Speeding up two string-matching algorithms M Crochemore, A Czumaj, L Gasieniec, S Jarominek, T Lecroq, ... Algorithmica 12 (4), 247-267, 1994 | 255 | 1994 |

Testing equivalence of morphisms on context-free languages W Plandowski European Symposium on Algorithms, 460-470, 1994 | 183 | 1994 |

Efficient algorithms for Lempel-Ziv encoding L Gasieniec, M Karpinski, W Plandowski, W Rytter Scandinavian Workshop on Algorithm Theory, 392-403, 1996 | 132 | 1996 |

Satisfiability of word equations with constants is in PSPACE W Plandowski 40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039 …, 1999 | 131 | 1999 |

Satisfiability of word equations with constants is in PSPACE W Plandowski Journal of the ACM (JACM) 51 (3), 483-496, 2004 | 127 | 2004 |

Fast practical multi-pattern matching M Crochemore, A Czumaj, L Gasieniec, T Lecroq, W Plandowski, W Rytter Information Processing Letters 71 (3-4), 107-113, 1999 | 96 | 1999 |

Application of Lempel-Ziv encodings to the solution of word equations W Plandowski, W Rytter International Colloquium on Automata, Languages, and Programming, 731-742, 1998 | 87 | 1998 |

An efficient algorithm for solving word equations W Plandowski Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006 | 77 | 2006 |

The expressibility of languages and relations by word equations J Karhumäki, F Mignosi, W Plandowski Journal of the ACM (JACM) 47 (3), 483-505, 2000 | 69 | 2000 |

Complexity of language recognition problems for compressed words W Plandowski, W Rytter Jewels are forever, 262-272, 1999 | 57 | 1999 |

Satisfiability of word equations with constants is in NEXPTIME W Plandowski Proceedings of the thirty-first annual ACM symposium on Theory of Computing …, 1999 | 54 | 1999 |

Finding all solutions of equations in free groups and monoids with involution V Diekert, A Jeż, W Plandowski Information and Computation 251, 263-286, 2016 | 42 | 2016 |

Randomized efficient algorithms for compressed strings: The finger-print approach L Gasieniec, M Karpinski, W Plandowski, W Rytter Annual Symposium on Combinatorial Pattern Matching, 39-49, 1996 | 39 | 1996 |

The complexity of the morphism equivalence problem for context-free languages W Plandowski PhD thesis, Department of Mathematics, Informatics and Mechanics, Warsaw …, 1995 | 38 | 1995 |

On the complexity of pattern matching for highly compressed two-dimensional texts P Berman, M Karpinski, LL Larmore, W Plandowski, W Rytter Journal of Computer and System Sciences 65 (2), 332-350, 2002 | 35 | 2002 |

Two-variable word equations L Ilie, W Plandowski RAIRO-Theoretical Informatics and Applications 34 (6), 467-501, 2000 | 30 | 2000 |

On the complexity of pattern matching for highly compressed two-dimensional texts P Berman, M Karpinski, LL Larmore, W Plandowski, W Rytter Annual Symposium on Combinatorial Pattern Matching, 40-51, 1997 | 30 | 1997 |

The expressibility of languages and relations by word equations J Karhumäki, W Plandowski, F Mignosi International Colloquium on Automata, Languages, and Programming, 98-109, 1997 | 28 | 1997 |

Constant-space string matching with smaller number of comparisons: sequential sampling L Gasieniec, W Plandowski, W Rytter Annual Symposium on Combinatorial Pattern Matching, 78-89, 1995 | 28 | 1995 |

Speeding up two string-matching algorithms M Crochemore, T Lecroq, A Czumaj, L Gasieniec, S Jarominek, ... Annual Symposium on Theoretical Aspects of Computer Science, 589-600, 1992 | 27 | 1992 |