Wojciech Plandowski

Publication Activity (10 Years)

Years Active: 1991-2019
Publications (10 Years): 4

Top Topics

Polynomial Equations

Boundary Value Problem

Top Venues

Theor. Comput. Sci.

Fundam. Informaticae

Publications

Wojciech Plandowski
generation of a solution set of a word equation and its applications. Theor. Comput. Sci. 792 (2019)
Wojciech Plandowski, Aleksy Schubert
On the complexity of computation maximal exponent of periodicity of word equations and expressible relations (note). Theor. Comput. Sci. 792 (2019)
Michal Kutwin, Wojciech Plandowski, Artur Zaroda
Generalized Word Equations: A New Approach to Data Compresion. DCC (2019)
Volker Diekert, Artur Jez, Wojciech Plandowski
Finding all solutions of equations in free groups and monoids with involution. Inf. Comput. 251 (2016)
Robert Dabrowski, Wojciech Plandowski
Complete Characterization of Zero-expressible Functions. Fundam. Informaticae 138 (3) (2015)
Volker Diekert, Artur Jez, Wojciech Plandowski
Finding All Solutions of Equations in Free Groups and Monoids with Involution. CSR (2014)
Volker Diekert, Artur Jez, Wojciech Plandowski
Finding All Solutions of Equations in Free Groups and Monoids with Involution. CoRR (2014)
Robert Dabrowski, Wojciech Plandowski
On Word Equations in One Variable. Algorithmica 60 (4) (2011)
Markku Laine, Wojciech Plandowski
Word Equations with One Unknown. Int. J. Found. Comput. Sci. 22 (2) (2011)
Marek Tomasz Biskup, Wojciech Plandowski
Guaranteed Synchronization of Huffman Codes with Known Position of Decoder. DCC (2009)
Markku Laine, Wojciech Plandowski
Word Equations with One Unknown. Developments in Language Theory (2009)
Elena Czeizler, Wojciech Plandowski
On systems of word equations over three unknowns with at most six occurrences of one of the unknowns. Theor. Comput. Sci. 410 (30-32) (2009)
Marek Tomasz Biskup, Wojciech Plandowski
Shortest synchronizing strings for Huffman codes. Theor. Comput. Sci. 410 (38-40) (2009)
Wojciech Plandowski
An efficient algorithm for solving word equations. STOC (2006)
Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
On the complexity of decidable cases of the commutation problem of languages. Theor. Comput. Sci. 337 (1-3) (2005)
Robert Dabrowski, Wojciech Plandowski
Solving Two-Variable Word Equations (Extended Abstract). ICALP (2004)
Wojciech Plandowski
Satisfiability of word equations with constants is in PSPACE. J. ACM 51 (3) (2004)
Juhani Karhumäki, Ján Manuch, Wojciech Plandowski
A defect theorem for bi-infinite words. Theor. Comput. Sci. 292 (1) (2003)
Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
The complexity of compressing subsegments of images described by finite automata. Discret. Appl. Math. 125 (2-3) (2003)
Wojciech Plandowski
Test Sets for Large Families of Languages. Developments in Language Theory (2003)
Richard Cole, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
On special families of morphisms related to [delta]-matching and don't care symbols. Inf. Process. Lett. 85 (5) (2003)
Robert Dabrowski, Wojciech Plandowski
On Word Equations in One Variable. MFCS (2002)
Juhani Karhumäki, Arto Lepistö, Wojciech Plandowski
Locally Periodic Versus Globally Periodic Infinite Words. J. Comb. Theory, Ser. A 100 (2) (2002)
Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter
On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts. J. Comput. Syst. Sci. 65 (2) (2002)
Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
Three Heuristics for delta-Matching: delta-BM Algorithms. CPM (2002)
Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
On the Complexity of Decidable Cases of Commutation Problem for Languages. FCT (2001)
Juhani Karhumäki, Filippo Mignosi, Wojciech Plandowski
The expressibility of languages and relations by word equations. J. ACM 47 (3) (2000)
Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
Pattern-Matching Problems for Two-Dimensional Images Described by Finite Automata. Nord. J. Comput. 7 (1) (2000)
Lucian Ilie, Wojciech Plandowski
Two-variable word equations. RAIRO Theor. Informatics Appl. 34 (6) (2000)
Bogdan S. Chlebus, Artur Czumaj, Leszek Gasieniec, Miroslaw Kowaluk, Wojciech Plandowski
Algorithms for the parallel alternating direction access machine. Theor. Comput. Sci. 245 (2) (2000)
Lucian Ilie, Wojciech Plandowski
Two-Variable Word Equations. STACS (2000)
Wojciech Plandowski
Satisfiability of Word Equations with Constants is in NEXPTIME. STOC (1999)
Wojciech Plandowski
Satisfiability of Word Equations with Constants is in PSPACE. FOCS (1999)
Maxime Crochemore, Artur Czumaj, Leszek Gasieniec, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
Fast Practical Multi-Pattern Matching. Inf. Process. Lett. 71 (3-4) (1999)
Wojciech Plandowski, Wojciech Rytter
Complexity of Language Recognition Problems for Compressed Words. Jewels are Forever (1999)
Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
Generalized Factorizations of Words and Their Algorithmic Properties. Theor. Comput. Sci. 218 (1) (1999)
Juhani Karhumäki, Wojciech Plandowski
On the complexity of computing the order of repetition of a string. Developments in Language Theory (1999)
Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
The Compression of Subsegments of Images Described by Finite Automata. CPM (1999)
Wojciech Plandowski, Wojciech Rytter
Application of Lempel-Ziv Encodings to the Solution of Words Equations. ICALP (1998)
Juhani Karhumäki, Ján Manuch, Wojciech Plandowski
On Defect Effect of Bi-Infinite Words. MFCS (1998)
Juhani Karhumäki, Arto Lepistö, Wojciech Plandowski
Locally Periodic Infinite Words and a Chaotic Behaviour. ICALP (1998)
Tero Harju, Juhani Karhumäki, Wojciech Plandowski
Compactness of Systems of Equations in Semigroups. Int. J. Algebra Comput. 7 (4) (1997)
Juhani Karhumäki, Wojciech Plandowski, Filippo Mignosi
The Expressibility of Languages and Relations by Word Equations. ICALP (1997)
Juhani Karhumäki, Wojciech Plandowski, Filippo Mignosi
A lower bound for a constant in Shallit's conjecture. Developments in Language Theory (1997)
Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
Pattern-Matching Problems for 2-Dimensional Images Described by Finite Automata. FCT (1997)
Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter
On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts. CPM (1997)
Bogdan S. Chlebus, Artur Czumaj, Leszek Gasieniec, Miroslaw Kowaluk, Wojciech Plandowski
Parallel Alternating-Direction Access Machine. MFCS (1996)
Leszek Gasieniec, Marek Karpinski, Wojciech Plandowski, Wojciech Rytter
Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract). CPM (1996)
Wojciech Plandowski, Wojciech Rytter, Tomasz Szymacha
Parallel Tree-Contraction and Fibonacci Numbers. Inf. Process. Lett. 59 (5) (1996)
Juhani Karhumäki, Wojciech Plandowski
On the Size of Independent Systems of Equations in Semigroups. Theor. Comput. Sci. 168 (1) (1996)
Leszek Gasieniec, Marek Karpinski, Wojciech Plandowski, Wojciech Rytter
Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract). SWAT (1996)
Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
Polynomial Size Test Sets for Context-Free Languages. J. Comput. Syst. Sci. 50 (1) (1995)
Leszek Gasieniec, Wojciech Plandowski, Wojciech Rytter
The Zooming Method: A Recursive Approach to Time-Space Efficient String-Matching. Theor. Comput. Sci. 147 (1&2) (1995)
Maxime Crochemore, Leszek Gasieniec, Wojciech Plandowski, Wojciech Rytter
Two-Dimensional Pattern Matching in Linear Time and Small Space. STACS (1995)
Artur Czumaj, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Plandowski
Work-time-optimal parallel algorithms for string problems. STOC (1995)
Leszek Gasieniec, Wojciech Plandowski, Wojciech Rytter
Constant-Space String Matching with Smaller Number of Comparisons: Sequential Sampling. CPM (1995)
Tero Harju, Juhani Karhumäki, Wojciech Plandowski
Compactness of Systems of Equations in Semigroups. ICALP (1995)
Wojciech Plandowski
Testing Equivalence of Morphisms on Context-Free Languages. ESA (1994)
Juhani Karhumäki, Wojciech Plandowski
On the Size of Independent Systems of Equations in Semigroups. MFCS (1994)
Maxime Crochemore, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
Speeding Up Two String-Matching Algorithms. Algorithmica 12 (4/5) (1994)
Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
Polynomial Size Test Sets for Context-Free Languages. ICALP (1992)
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Wojciech Plandowski, Wojciech Rytter
Speeding Up Two String-Matching Algorithms. STACS (1992)
Wojciech Plandowski, Wojciech Rytter, Tomasz Szymacha
Exact Analysis of Three Tree Contraction Algorithms. FCT (1991)