( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
R-enum: Enumeration of Characteristic Substrings in BWT-runs Bounded Space.

, и . CPM, том 191 из LIPIcs, стр. 21:1-21:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

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.

Yoshihiko Nishimoto

Takaaki Ishizawa

Takaaki Yamasaki

 

Другие публикации лиц с тем же именем

Compressed Automata for Dictionary Matching., , , , и . CIAA, том 7982 из Lecture Notes in Computer Science, стр. 319-330. Springer, (2013)Small-Space LCE Data Structure with Constant-Time Queries., , , , и . MFCS, том 83 из LIPIcs, стр. 10:1-10:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)A compressed dynamic self-index for highly repetitive text collections., , и . CoRR, (2017)Dynamic Index and LZ Factorization in Compressed Space., , , , и . Stringology, стр. 158-170. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2016)R-enum: Enumeration of Characteristic Substrings in BWT-runs Bounded Space., и . CPM, том 191 из LIPIcs, стр. 21:1-21:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)A compressed dynamic self-index for highly repetitive text collections., , и . Inf. Comput., (2020)LZRR: LZ77 Parsing with Right Reference., и . DCC, стр. 211-220. IEEE, (2019)Dynamic Suffix Array in Optimal Compressed Space., и . CoRR, (2024)Conversion from RLBWT to LZ77., и . CPM, том 128 из LIPIcs, стр. 9:1-9:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)An Optimal-Time RLBWT Construction in BWT-Runs Bounded Space., , и . ICALP, том 229 из LIPIcs, стр. 99:1-99:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)