Follow
Wojciech Plandowski
Wojciech Plandowski
Unknown affiliation
Verified email at uw.edu.pl
Title
Cited by
Cited by
Year
Speeding up two string-matching algorithms
M Crochemore, A Czumaj, L Gasieniec, S Jarominek, T Lecroq, ...
Algorithmica 12, 247-267, 1994
2671994
Testing equivalence of morphisms on context-free languages
W Plandowski
European Symposium on Algorithms, 460-470, 1994
1881994
Satisfiability of word equations with constants is in PSPACE
W Plandowski
Journal of the ACM (JACM) 51 (3), 483-496, 2004
1442004
Satisfiability of word equations with constants is in PSPACE
W Plandowski
40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039 …, 1999
1421999
Efficient algorithms for Lempel-Ziv encoding
L Gasieniec, M Karpinski, W Plandowski, W Rytter
Algorithm Theory—SWAT'96: 5th Scandinavian Workshop on Algorithm Theory …, 1996
1401996
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
1001999
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
991998
An efficient algorithm for solving word equations
W Plandowski
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006
882006
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
842000
Satisfiability of word equations with constants is in NEXPTIME
W Plandowski
Proceedings of the thirty-first annual ACM symposium on Theory of Computing …, 1999
621999
Complexity of language recognition problems for compressed words
W Plandowski, W Rytter
Jewels are Forever: Contributions on Theoretical Computer Science in Honor …, 1999
591999
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
552016
Randomized efficient algorithms for compressed strings: The finger-print approach
L Gasieniec, M Karpinski, W Plandowski, W Rytter
Combinatorial Pattern Matching: 7th Annual Symposium, CPM 96 Laguna Beach …, 1996
381996
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
372002
The complexity of the morphism equivalence problem for context-free languages
W Plandowski
PhD thesis, Department of Mathematics, Informatics and Mechanics, Warsaw …, 1995
361995
Two-variable word equations
L Ilie, W Plandowski
RAIRO-Theoretical Informatics and Applications 34 (6), 467-501, 2000
342000
On the complexity of pattern matching for highly compressed two-dimensional texts
P Berman, M Karpinski, LL Larmore, W Plandowski, W Rytter
Combinatorial Pattern Matching: 8th Annual Symposium, CPM 97 Aarhus, Denmark …, 1997
341997
Constant-space string matching with smaller number of comparisons: sequential sampling
L Gasieniec, W Plandowski, W Rytter
Combinatorial Pattern Matching: 6th Annual Symposium, CPM 95 Espoo, Finland …, 1995
341995
The expressibility of languages and relations by word equations
J Karhumäki, W Plandowski, F Mignosi
Automata, Languages and Programming: 24th International Colloquium, ICALP'97 …, 1997
301997
On word equations in one variable
R Dąbrowski, W Plandowski
Algorithmica 60 (4), 819-828, 2011
272011
The system can't perform the operation now. Try again later.
Articles 1–20