Author of the publication

Discovering instances of poetic allusion from anthologies of classical Japanese poems.

, , , , and . Theor. Comput. Sci., 292 (2): 497-524 (2003)

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.

 

Other publications of authors with the same name

A comparison study between genetic algorithms and bayesian optimize algorithms by novel indices., , and . GECCO, page 1485-1492. ACM, (2005)A fully compressed pattern matching algorithm for simple collage systems., , and . Int. J. Found. Comput. Sci., 16 (6): 1155-1166 (2005)Discovering instances of poetic allusion from anthologies of classical Japanese poems., , , , and . Theor. Comput. Sci., 292 (2): 497-524 (2003)Computing Smallest and Largest Repetition Factorizations in O(n log n) Time., , , , , and . Stringology, page 135-145. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2016)Computing q-gram Non-overlapping Frequencies on SLP Compressed Texts, , , and . CoRR, (2011)Computing Abelian regularities on RLE strings., , , , and . CoRR, (2017)A new characterization of maximal repetitions by Lyndon trees., , , , , and . CoRR, (2014)Time and Space Efficient Lempel-Ziv Factorization based on Run Length Encoding, , , and . CoRR, (2012)Multiple Pattern Matching in LZW Compressed Text., , , , and . Data Compression Conference, page 103-112. IEEE Computer Society, (1998)From Run Length Encoding to LZ78 and Back Again., , , , and . DCC, page 143-152. IEEE, (2013)