Wojciech Plandowski

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