( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Run Compressed Rank/Select for Large Alphabets.

, , , и . DCC, стр. 315-324. IEEE, (2018)

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.

Dmitry Sveshnikov

Dmitry Suslov

Dmitry Varentsov

Dmitry Chigrin

Dmitry Shvedov

 

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

Lempel-Ziv Parsing for Sequences of Blocks., и . Algorithms, 14 (12): 359 (2021)Construction of Sparse Suffix Trees and LCE Indexes in Optimal Time and Space., и . CPM, том 296 из LIPIcs, стр. 20:1-20:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)LZ-End Parsing in Linear Time., и . ESA, том 87 из LIPIcs, стр. 53:1-53:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)LZ-End Parsing in Compressed Space., и . DCC, стр. 350-359. IEEE, (2017)Lempel-Ziv-like Parsing in Small Space., , , и . CoRR, (2019)Finding Distinct Subpalindromes Online., , и . Stringology, стр. 63-69. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2013)Compressed Multiple Pattern Matching., и . CoRR, (2018)Pal k is Linear Recognizable Online., , и . SOFSEM, том 8939 из Lecture Notes in Computer Science, стр. 289-301. Springer, (2015)Detecting One-Variable Patterns., , и . SPIRE, том 10508 из Lecture Notes in Computer Science, стр. 254-270. Springer, (2017)Run Compressed Rank/Select for Large Alphabets., , , и . DCC, стр. 315-324. IEEE, (2018)