| ||
| 1. | On Word Equations in One Variable
ALGORITHMICA Tom 60 Nr 4 r. 2011, str. 819-828 (Artykuł) Robert D±browski, Wojciech Plandowski | |
| 2. | Word Equations with One Unknown
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE Tom 22 Nr 2 r. 2011, str. 345-375 (Artykuł) Markku Laine, Wojciech Plandowski | |
| 3. | On systems of word equations over three unknowns with at most six occurrences of one of the unknowns
THEORETICAL COMPUTER SCIENCE Tom 410 Nr 30-32 r. 2009, str. 2889-2909 (Artykuł) Elena Czeizler, Wojciech Plandowski | |
| 4. | On Word Equations in One Variable
[ LINK ]
ALGORITHMICA Tom 9375-3 r. 2009, str. 3-3 (Artykuł) Robert D±browski, Wojciech Plandowski | |
| 5. | Shortest synchronizing strings for Huffman codes
THEORETICAL COMPUTER SCIENCE Tom 410 Nr 38-40 r. 2009, str. 3925-3941 (Artykuł) Marek Biskup, Wojciech Plandowski | |
| 6. | Word equations with one unknown
LECTURE NOTES IN COMPUTER SCIENCE Tom 5583 r. 2009, str. 348-359 (Artykuł konferencyjny) Markku Laine, Wojciech Plandowski | |
| 7. | An efficient algorithm for solving word equations
SYMPOSIUM ON THEORY OF COMPUTING Tom 38 r. 2006, str. 467-476 (Artykuł konferencyjny) Wojciech Plandowski | |
| 8. | On the complexity of decidable cases of the commutation problem of languages
THEORETICAL COMPUTER SCIENCE Tom 337 r. 2005, str. 105-118 (Artykuł) Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter | |
| 9. | Satisfiability of word equations with constants is in PSPACE
JOURNAL OF THE ACM Tom 51 Nr 3 r. 2004, str. 483-496 (Artykuł) Wojciech Plandowski | |
| 10. | Solving Word Equations in Two Variables
LECTURE NOTES IN COMPUTER SCIENCE Tom 3142 r. 2004, str. 408-419 (Artykuł konferencyjny) Robert D±browski, Wojciech Plandowski | |
| 11. | A defect theorem for bi-infinite words
THEORETICAL COMPUTER SCIENCE Tom 292 Nr 1 r. 2003, str. 237-243 (Artykuł) Juhani Karhumaeki, Jan Manuch, Wojciech Plandowski | |
| 12. | Locally periodic versus globally periodic infinite words
JOURNAL OF COMBINATORIAL THEORY SERIES A Tom 100 Nr 2 r. 2003, str. 1-10 (Artykuł) Juhani Karhumaeki, Arto Lepisto, Wojciech Plandowski | |
| 13. | Occurrence and substring heuristics for delta-matching
FUNDAMENTA INFORMATICAE Tom 56 Nr 1 r. 2003, str. 1-21 (Artykuł) Maxime Crochemore, Costas Iliopoulos, Thierry Lecroq, Yoan Pinzon, Wojciech Plandowski, Wojciech Rytter | |
| 14. | Relations between delta-matching and matching with don
INFORMATION PROCESSING LETTERS Tom 85 Nr 5 r. 2003, str. 227-233 (Artykuł) Richard Cole, Costas Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter | |
| 15. | Test Sets for Large Families of Languages
LECTURE NOTES IN COMPUTER SCIENCE Tom 2710 r. 2003, str. 75-94 (Artykuł konferencyjny) Wojciech Plandowski | |
| 16. | The complexity of compressing subsegments of images described by finite automata
DISCRETE APPLIED MATHEMATICS Tom 125 r. 2003, str. 235-254 (Artykuł) Juhani Karhumaeki, Wojciech Plandowski, Wojciech Rytter | |
| 17. | On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts
JOURNAL OF COMPUTER AND SYSTEM SCIENCES Tom 65 Nr 2 r. 2002, str. 332-350 (Artykuł) Piotr Berman, Marek Karpinski, Lawrence Larmore, Wojciech Plandowski, Wojciech Rytter | |
| 18. | On word equations in one variable
LECTURE NOTES IN COMPUTER SCIENCE Tom 2420 r. 2002, str. 212-221 (Artykuł konferencyjny) Robert D±browski, Wojciech Plandowski | |
| 19. | The complexity of pattern matching of highly compressed two-dimensional texts
JOURNAL OF COMPUTER AND SYSTEM SCIENCES Tom 65 Nr 2 r. 2002, str. 332-350 (Artykuł) Wojciech Plandowski, P. Berman, M. Karpinski, L. Larmore | |
| 20. | Three heuristics for delta-matching: delta-BM algorithms
LECTURE NOTES IN COMPUTER SCIENCE Tom 2373 r. 2002, str. 178-189 (Artykuł konferencyjny) Maxime Crochemore, Costas Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter | |
| 21. | On the complexity of decidable cases of commutation problem for languages
LECTURE NOTES IN COMPUTER SCIENCE Nr 2138 r. 2001, str. 193-203 (Artykuł) Wojciech Plandowski, Wojciech Rytter, J. Karhumaki | |
| 22. | On the expressibility of languages by word equations with a bounded number of variables
BULLETIN OF THE BELGIAN MATHEMATICAL SOCIETY-SIMON STEVIN Tom 8 Nr 2 r. 2001, str. 293-305 (Artykuł) Wojciech Plandowski, J. Karhumaki, F. Mignosi | |
| 23. | Algorithms for the parallel alternating direction access machine
THEORETICAL COMPUTER SCIENCE Tom 245 r. 2000, str. 151-173 (Artykuł) Bogdan Chlebus, A. Czumaj, Leszek G±sieniec, Mirosław Kowaluk, Wojciech Plandowski | |
| 24. | Pattern matching for images generated by finite automata
NORDIC JOURNAL OF COMPUTING Tom 7 Nr 1 r. 2000, str. 1-13 (Artykuł) Wojciech Plandowski, Wojciech Rytter, j Karhumaki | |
| 25. | The expressibility of languages and relations by word equations
JOURNAL OF THE ACM Tom 47 Nr 3 r. 2000, str. 483-505 (Artykuł) Wojciech Plandowski, J Karhumaki, F Mignosi | |