W
Wojciech Plandowski
Researcher at University of Warsaw
Publications - 74
Citations - 2021
Wojciech Plandowski is an academic researcher from University of Warsaw. The author has contributed to research in topics: Word (computer architecture) & Time complexity. The author has an hindex of 21, co-authored 74 publications receiving 1943 citations. Previous affiliations of Wojciech Plandowski include Turku Centre for Computer Science & Max Planck Society.
Papers
More filters
Journal ArticleDOI
Speeding up two string-matching algorithms
Maxime Crochemore,Artur Czumaj,Leszek Gasieniec,Stefan Jarominek,Thierry Lecroq,Wojciech Plandowski,Wojciech Rytter +6 more
TL;DR: It is shown how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm), based on factor graphs for the reverse of the pattern.
Journal ArticleDOI
Satisfiability of word equations with constants is in PSPACE
TL;DR: It is proved that satisfiability problem for word equations is in PSPACE, and the solution to this problem can be deduced from the inequality of the EPTs.
Book ChapterDOI
Testing Equivalence of Morphisms on Context-Free Languages
TL;DR: A polynomial time algorithm for testing if two morphisms are equal on every word of a context-free language and whether or not n first elements of two sequences of words defined by recurrence formulae are the same.
Book ChapterDOI
Efficient algorithms for Lempel-Ziv encoding
TL;DR: In this paper, it was shown that if the input texts are given by their Lempel-Ziv codes then the problems can be solved deterministically in polynomial time in the case when the original (uncompressed) texts are of exponential size.
Book ChapterDOI
Application of Lempel-Ziv Encodings to the Solution of Words Equations
TL;DR: A new approach is introduced and the solvability can be tested in polynomial deterministic time if the lengths of all variables are given in binary and it is proved that each minimal solution of a word equation is highly compressible (exponentially compressible for long solutions) in terms of Lempel-Ziv encoding.