Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego
Publikacje
Wojciech Plandowski
2009
- Marek Biskup i Wojciech Plandowski, Guaranteed Synchronization of Huffman Codes with Known Position of Decoder, w: DCC, 2009.zobacz w PBN
- Markku Laine i Wojciech Plandowski, Word Equations with One Unknown, w: Developments in Language Theory, 2009.zobacz w PBN
- Marek Biskup i Wojciech Plandowski, Shortest synchronizing strings for Huffman codes, Theoretical Computer Science 410 (38-40) 2009, s. 3925–3941.zobacz w PBN
- Elena Czeizler i Wojciech Plandowski, On systems of word equations over three unknowns with at most six occurrences of one of the unknowns, Theoretical Computer Science 410 (30-32) 2009, s. 2889–2909.zobacz w PBN
- Markku Laine i Wojciech Plandowski, Word equations with one unknown, Lecture Notes In Computer Science 5583 2009, s. 348–359.zobacz w PBN
- Robert Dąbrowski i Wojciech Plandowski, On Word Equations in One Variable, Algorithmica 9375-3 2009, s. 3.zobacz w PBN
2007
- Wojciech Plandowski, Palindromes in Mathematics, w: XXth Symposium on Photonics Applications in Astronomy, Communications,Industry and High Energy Physics Applications, Warszawa 2007.zobacz w PBN
2003
- Richard Cole, Costas Iliopoulos, Thierry Lecroq, Wojciech Plandowski i Wojciech Rytter, Relations between delta-matching and matching with don, Information Processing Letters 85 (5) 2003, s. 227–233.zobacz w PBN
- Maxime Crochemore, Costas Iliopoulos, Thierry Lecroq, Yoan Pinzon, Wojciech Plandowski i Wojciech Rytter, Occurrence and substring heuristics for delta-matching, Fundamenta Informaticae 56 (1) 2003, s. 1–21.zobacz w PBN
- Juhani Karhumaeki, Jan Manuch i Wojciech Plandowski, A defect theorem for bi-infinite words, Theoretical Computer Science 292 (1) 2003, s. 237–243.zobacz w PBN
- Juhani Karhumaeki, Wojciech Plandowski i Wojciech Rytter, The complexity of compressing subsegments of images described by finite automata, Discrete Applied Mathematics 125 (2-3) 2003, s. 235–254.zobacz w PBN
- Juhani Karhumaeki, Arto Lepisto i Wojciech Plandowski, Locally periodic versus globally periodic infinite words, Journal Of Combinatorial Theory Series A 100 (2) 2003, s. 1–10.zobacz w PBN
- M. Crochemore, C.S. Iliopoulos, T. Lecroq, Y.J. Pinzon, W. Plandowski i W. Rytter, Occurrence and Substring Heuristics for [ro]-Matching, Fundamenta Informaticae Vol. 56, nr 1,2 2003, s. 1–21.zobacz w PBN
- Wojciech Plandowski, Test Sets for Large Families of Languages, Lecture Notes In Computer Science 2710 2003, s. 75–94.zobacz w PBN
2002
- Wojciech Plandowski, P. Berman, M. Karpinski i L. Larmore, The complexity of pattern matching of highly compressed two-dimensional texts, Journal Of Computer And System Sciences 65 (2) 2002, s. 332–350.zobacz w PBN
- Maxime Crochemore, Costas Iliopoulos, Thierry Lecroq, Wojciech Plandowski i Wojciech Rytter, Three heuristics for delta-matching: delta-BM algorithms, Lecture Notes In Computer Science 2373 2002, s. 178–189.zobacz w PBN
- Robert Dąbrowski i Wojciech Plandowski, On word equations in one variable, Lecture Notes In Computer Science 2420 2002, s. 212–221.zobacz w PBN
- Tero Harju, Juhani Karhumaki i Wojciech Plandowski, Independent systems of equations, w: Algebraic Combinatorics on Words, Cambridge University Press, Cambridge 2002.zobacz w PBN
- Piotr Berman, Marek Karpinski, Lawrence Larmore, Wojciech Plandowski i Wojciech Rytter, On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts, Journal Of Computer And System Sciences 65 (2) 2002, s. 332–350.zobacz w PBN
2000
- Bogdan Chlebus, A. Czumaj, Leszek Gąsieniec, Mirosław Kowaluk i Wojciech Plandowski, Algorithms for the parallel alternating direction access machine, Theoretical Computer Science 245 (2) 2000, s. 151–173.zobacz w PBN
- Wojciech Plandowski, J Karhumaki i F Mignosi, The expressibility of languages and relations by word equations, Journal Of The Acm 47 (3) 2000, s. 483–505.zobacz w PBN
- Wojciech Plandowski i L. Ilie, Two-Variable Word Equations, Rairo-theoretical Informatics And Applications 34 2000, s. 467–501.zobacz w PBN
- Wojciech Plandowski, Wojciech Rytter i j Karhumaki, Pattern matching for images generated by finite automata, Nordic Journal Of Computing 7 (1) 2000, s. 1–13.zobacz w PBN
Nie jesteś zalogowany | zaloguj się
