Wojciech Plandowski
Wojciech Plandowski
Afiliación desconocida
Dirección de correo verificada de uw.edu.pl
Título
Citado por
Citado por
Año
Speeding up two string-matching algorithms
M Crochemore, A Czumaj, L Gasieniec, S Jarominek, T Lecroq, ...
Algorithmica 12 (4), 247-267, 1994
2541994
Testing equivalence of morphisms on context-free languages
W Plandowski
European Symposium on Algorithms, 460-470, 1994
1831994
Satisfiability of word equations with constants is in PSPACE
W Plandowski
40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039 …, 1999
1301999
Efficient algorithms for Lempel-Ziv encoding
L Gasieniec, M Karpinski, W Plandowski, W Rytter
Scandinavian Workshop on Algorithm Theory, 392-403, 1996
1291996
Satisfiability of word equations with constants is in PSPACE
W Plandowski
Journal of the ACM (JACM) 51 (3), 483-496, 2004
1262004
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
961999
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
851998
An efficient algorithm for solving word equations
W Plandowski
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006
762006
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
692000
Complexity of language recognition problems for compressed words
W Plandowski, W Rytter
Jewels are forever, 262-272, 1999
561999
Satisfiability of word equations with constants is in NEXPTIME
W Plandowski
Proceedings of the thirty-first annual ACM symposium on Theory of Computing …, 1999
531999
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
412016
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
391996
The complexity of the morphism equivalence problem for context-free languages
W Plandowski
PhD thesis, Department of Mathematics, Informatics and Mechanics, Warsaw …, 1995
381995
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
342002
Two-variable word equations
L Ilie, W Plandowski
RAIRO-Theoretical Informatics and Applications 34 (6), 467-501, 2000
302000
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
301997
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
281997
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
281995
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
251992
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20