From post

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.

 

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

Tight upper and lower bounds on suffix tree breadth., , , , и . Theor. Comput. Sci., (2021)New space-time trade-offs for pattern matching with compressed indexes.. University of Helsinki, Finland, (2024)base-search.net (ftunivhelsihelda:oai:helda.helsinki.fi:10138/570140).Relative Lempel-Ziv Compression of Suffix Arrays., и . SPIRE, том 12303 из Lecture Notes in Computer Science, стр. 89-96. Springer, (2020)On Elias-Fano for Rank Queries in FM-Indexes., , , и . DCC, стр. 223-232. IEEE, (2021)Fast Indexes for Gapped Pattern Matching., , и . SOFSEM, том 12011 из Lecture Notes in Computer Science, стр. 493-504. Springer, (2020)Engineering External Memory Induced Suffix Sorting., , , и . ALENEX, стр. 98-108. SIAM, (2017)Smaller RLZ-Compressed Suffix Arrays., и . DCC, стр. 213-222. IEEE, (2021)Document Retrieval Hacks., и . SEA, том 190 из LIPIcs, стр. 12:1-12:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)