( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Suffix Trays and Suffix Trists: Structures for Faster Text Indexing.

, , и . ICALP (1), том 4051 из Lecture Notes in Computer Science, стр. 358-369. Springer, (2006)

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.

Alexandra Tsvilina

 

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

Fully Dynamic Connectivity in O(log n(log log n)2) Amortized Expected Time., , , и . CoRR, (2016)Sparse Text Indexing in Small Space., , , , , и . ACM Trans. Algorithms, 12 (3): 39:1-39:19 (2016)Persistency in Suffix Trees with Applications to String Interval Problems., , и . SPIRE, том 7024 из Lecture Notes in Computer Science, стр. 67-80. Springer, (2011)Streaming Pattern Matching with d Wildcards., , и . Algorithmica, 81 (5): 1988-2015 (2019)Introduction to the ACM-SIAM Symposium on Discrete Algorithms (SODA) 2019 Special Issue., и . ACM Trans. Algorithms, 18 (1): 4e:1-4e:2 (2022)Faster Worst Case Deterministic Dynamic Connectivity., , , и . ESA, том 57 из LIPIcs, стр. 53:1-53:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Color-Distance Oracles and Snippets., и . CPM, том 54 из LIPIcs, стр. 24:1-24:10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap., , , , , и . ISAAC, том 64 из LIPIcs, стр. 12:1-12:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Towards Real-Time Suffix Tree Construction., , , и . SPIRE, том 3772 из Lecture Notes in Computer Science, стр. 67-78. Springer, (2005)Contention resolution with log-logstar channel accesses., , , и . STOC, стр. 499-508. ACM, (2016)