Author of the publication

Space-Efficient Construction Algorithm for the Circular Suffix Tree.

, , , and . CPM, volume 7922 of Lecture Notes in Computer Science, page 142-152. Springer, (2013)

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

Compressing Dictionary Matching Index via Sparsification Technique., , , , , , and . Algorithmica, 72 (2): 515-538 (2015)Compressed text indexing with wildcards., , , , and . J. Discrete Algorithms, (2013)Efficient Algorithm for Circular Burrows-Wheeler Transform., , , , and . CPM, volume 7354 of Lecture Notes in Computer Science, page 257-268. Springer, (2012)Position-Restricted Substring Searching over Small Alphabets., , , and . SPIRE, volume 8214 of Lecture Notes in Computer Science, page 29-36. Springer, (2013)Space-Efficient Construction Algorithm for the Circular Suffix Tree., , , and . CPM, volume 7922 of Lecture Notes in Computer Science, page 142-152. Springer, (2013)Faster compressed dictionary matching., , , , and . Theor. Comput. Sci., (2013)Position-restricted substring searching over small alphabets., , , and . J. Discrete Algorithms, (2017)Compressed Dictionary Matching with One Error., , , , and . DCC, page 113-122. IEEE Computer Society, (2011)Faster Compressed Dictionary Matching., , , , and . SPIRE, volume 6393 of Lecture Notes in Computer Science, page 191-200. Springer, (2010)Compressed Text Indexing with Wildcards., , , , and . SPIRE, volume 7024 of Lecture Notes in Computer Science, page 267-277. Springer, (2011)