Publications

Wojciech Plandowski

Number of publications: 34

2019

• Wojciech Plandowski , On PSPACE generation of a solution set of a word equation and its applications, Theoretical Computer Science, 792 2019, p. 20-61. See in PBN
• Wojciech Plandowski , Aleksy Schubert , On the complexity of computation maximal exponent of periodicity of word equations and expressible relations (note), Theoretical Computer Science, 792 2019, p. 62-68. See in PBN

2016

• Volker Diekert, Artur Jeż, Wojciech Plandowski , Finding all solutions of equations in free groups and monoids with involution, Information and Computation, 2016. See in PBN

2015

• Robert Dąbrowski, Wojciech Plandowski , Complete characterization of zero-expressible functions, Fundamenta Informaticae, 2015. See in PBN

2014

• Volker Diekert, Artur Jeż, Wojciech Plandowski , Finding All Solutions of Equations in Free Groups and Monoids with Involuton, Lecture Notes in Computer Science, 9th International Computer Science Symposium in Russia, the Russian Federation, 2014. See in PBN

2011

• Robert Dąbrowski, Wojciech Plandowski , On Word Equations in One Variable, Algorithmica, 2011. See in PBN
• Markku Laine, Wojciech Plandowski , Word Equations with One Unknown, International Journal of Foundations of Computer Science, 2011. See in PBN

2009

• Marek Biskup, Wojciech Plandowski , Guaranteed Synchronization of Huffman Codes with Known Position of Decoder, 2009. See in PBN
• Elena Czeizler, Wojciech Plandowski , On systems of word equations over three unknowns with at most six occurrences of one of the unknowns, Theoretical Computer Science, 2009. See in PBN
• Robert Dąbrowski, Wojciech Plandowski , On Word Equations in One Variable, Algorithmica, 2009. See in PBN
• Marek Biskup, Wojciech Plandowski , Shortest synchronizing strings for Huffman codes, Theoretical Computer Science, 2009. See in PBN
• Markku Laine, Wojciech Plandowski , Word equations with one unknown, Lecture Notes in Computer Science, 2009. See in PBN

2007

• Wojciech Plandowski , Palindromes in Mathematics, 2007. See in PBN

2006

• Wojciech Plandowski , An efficient algorithm for solving word equations, 2006. See in PBN

2005

• Juhani Karhumäki, Wojciech Plandowski , Wojciech Rytter , On the complexity of decidable cases of the commutation problem of languages, Theoretical Computer Science, 2005. See in PBN

2004

• Wojciech Plandowski , Satisfiability of word equations with constants is in PSPACE, Journal of the ACM, 2004. See in PBN
• Robert Dąbrowski, Wojciech Plandowski , Solving Word Equations in Two Variables, Lecture Notes in Computer Science, 2004. See in PBN

2003

• Juhani Karhumaeki, Jan Manuch, Wojciech Plandowski , A defect theorem for bi-infinite words, Theoretical Computer Science, 2003. See in PBN
• Juhani Karhumaeki, Arto Lepisto, Wojciech Plandowski , Locally periodic versus globally periodic infinite words, Journal of Combinatorial Theory - Series A, 2003. See in PBN
• Maxime Crochemore, Costas Iliopoulos, Thierry Lecroq, Yoan Pinzon, Wojciech Plandowski , Wojciech Rytter , Occurrence and substring heuristics for delta-matching, Fundamenta Informaticae, 2003. See in PBN
• Richard Cole, Costas Iliopoulos, Thierry Lecroq, Wojciech Plandowski , Wojciech Rytter , Relations between delta-matching and matching with don, Information Processing Letters, 2003. See in PBN
• Wojciech Plandowski , Test Sets for Large Families of Languages, Lecture Notes in Computer Science, 2003. See in PBN
• Juhani Karhumaeki, Wojciech Plandowski , Wojciech Rytter , The complexity of compressing subsegments of images described by finite automata, Discrete Applied Mathematics, 2003. See in PBN

2002

• Tero Harju, Juhani Karhumaki, Wojciech Plandowski , Independent systems of equations, 2002. See in PBN
• Piotr Berman, Marek Karpinski, Lawrence Larmore, Wojciech Plandowski , Wojciech Rytter , On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts, Journal of Computer and System Sciences, 2002. See in PBN
• Robert Dąbrowski, Wojciech Plandowski , On word equations in one variable, Lecture Notes in Computer Science, 2002. See in PBN
• P. Berman, M. Karpinski, L. Larmore, Wojciech Plandowski , The complexity of pattern matching of highly compressed two-dimensional texts, Journal of Computer and System Sciences, 2002. See in PBN
• Maxime Crochemore, Costas Iliopoulos, Thierry Lecroq, Wojciech Plandowski , Wojciech Rytter , Three heuristics for delta-matching: delta-BM algorithms, Lecture Notes in Computer Science, 2002. See in PBN

2001

• J. Karhumaki, Wojciech Plandowski , Wojciech Rytter , On the complexity of decidable cases of commutation problem for languages, Lecture Notes in Computer Science, 2001. See in PBN
• J. Karhumaki, F. Mignosi, Wojciech Plandowski , On the expressibility of languages by word equations with a bounded number of variables, Bulletin of the Belgian Mathematical Society - Simon Stevin, 2001. See in PBN

2000

• Bogdan Chlebus, A. Czumaj, Leszek Gąsieniec, Mirosław Kowaluk , Wojciech Plandowski , Algorithms for the parallel alternating direction access machine, Theoretical Computer Science, 2000. See in PBN
• j Karhumaki, Wojciech Plandowski , Wojciech Rytter , Pattern matching for images generated by finite automata, 2000. See in PBN
• J Karhumaki, F Mignosi, Wojciech Plandowski , The expressibility of languages and relations by word equations, Journal of the ACM, 2000. See in PBN
• L. Ilie, Wojciech Plandowski , Two-Variable Word Equations, RAIRO - Theoretical Informatics and Applications, 2000. See in PBN