( en | de | ru )

 

Disambiguation of "Plandowski, Wojciech"

Author of the publication

copydeleteadd this publication to your clipboard
Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract).

, , , and . CPM, volume 1075 of Lecture Notes in Computer Science, page 39-49. Springer, (1996)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Wojciech Wojtyna

Wojciech Kowalczyk

Wojciech Osinski

Wojciech Derwich

Waldemar Wojciech

 

Other publications of authors with the same name

Work-time-optimal parallel algorithms for string problems., , , , and . STOC, page 713-722. ACM, (1995)Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract)., , , and . CPM, volume 1075 of Lecture Notes in Computer Science, page 39-49. Springer, (1996)Three Heuristics for delta-Matching: delta-BM Algorithms., , , , and . CPM, volume 2373 of Lecture Notes in Computer Science, page 178-189. Springer, (2002)Pattern-Matching Problems for Two-Dimensional Images Described by Finite Automata., , and . Nord. J. Comput., 7 (1): 1-13 (2000)Generalized Factorizations of Words and Their Algorithmic Properties., , and . Theor. Comput. Sci., 218 (1): 123-133 (1999)On systems of word equations over three unknowns with at most six occurrences of one of the unknowns., and . Theor. Comput. Sci., 410 (30-32): 2889-2909 (2009)The Zooming Method: A Recursive Approach to Time-Space Efficient String-Matching., , and . Theor. Comput. Sci., 147 (1&2): 19-30 (1995)On the complexity of computation maximal exponent of periodicity of word equations and expressible relations (note)., and . Theor. Comput. Sci., (2019)On the complexity of decidable cases of the commutation problem of languages., , and . Theor. Comput. Sci., 337 (1-3): 105-118 (2005)The complexity of compressing subsegments of images described by finite automata., , and . Discret. Appl. Math., 125 (2-3): 235-254 (2003)