( en | de | ru )

 

Disambiguation of "Inenaga, Shunsuke"

Author of the publication

copydeleteadd this publication to your clipboard
Compressed Automata for Dictionary Matching.

, , , , and . CIAA, volume 7982 of Lecture Notes in Computer Science, page 319-330. 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.

Shunsuke Saito

 

Other publications of authors with the same name

Bidirectional Construction of Suffix Trees.. Stringology, page 75-87. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University, (2002)On-line construction of compact directed acyclic word graphs., , , , , , and . Discret. Appl. Math., 146 (2): 156-179 (2005)Computing Abelian regularities on RLE strings., , , , and . CoRR, (2017)Novel Results on the Number of Runs of the Burrows-Wheeler-Transform., , , , , and . SOFSEM, volume 12607 of Lecture Notes in Computer Science, page 249-262. Springer, (2021)Dynamic Edit Distance Table under a General Weighted Cost Function., , and . SOFSEM, volume 5901 of Lecture Notes in Computer Science, page 515-527. Springer, (2010)Ternary Directed Acyclic Word Graphs., , , and . CIAA, volume 2759 of Lecture Notes in Computer Science, page 120-130. Springer, (2003)Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing., , , and . IWOCA, volume 9843 of Lecture Notes in Computer Science, page 213-225. Springer, (2016)Towards Modeling Stored-value Electronic Money Systems., , and . NaBIC, page 902-907. IEEE, (2009)Suffix Trees, DAWGs and CDAWGs for Forward and Backward Tries.. CoRR, (2019)Faster STR-IC-LCS Computation via RLE., , , , and . CPM, volume 78 of LIPIcs, page 20:1-20:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)