From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Computing Smallest and Largest Repetition Factorizations in O(n log n) Time.

H. Inoue, Y. Matsuoka, Y. Nakashima, S. Inenaga, H. Bannai, и M. Takeda. Stringology, стр. 135-145. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2016)

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.

Shortest Unique Palindromic Substring Queries in Optimal Time.Y. Nakashima, H. Inoue, T. Mieno, S. Inenaga, H. Bannai, и M. Takeda. IWOCA, том 10765 из Lecture Notes in Computer Science, стр. 397-408. Springer, (2017)Computing Smallest and Largest Repetition Factorizations in O(n log n) Time.H. Inoue, Y. Matsuoka, Y. Nakashima, S. Inenaga, H. Bannai, и M. Takeda. Stringology, стр. 135-145. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2016)