106 citations · 239 across the 67 of their papers we have counts for
4 papers · 1 filter
Grammar Index By Induced Suffix Sorting
Tooru Akagi, Dominik Köppl, Yuto Nakashima +3
Pattern matching is the most central task for text indices. Most recent indices leverage compression techniques to make pattern matching feasible for massive but highly-compressibl…
Combinatorics of minimal absent words for a sliding window
Tooru Akagi, Yuki Kuhara, Takuya Mieno +4
A string is called a minimal absent word (MAW) for another string if does not occur in but the proper substrings of occur in . For example, let $Σ= \{\mathtt…
A Separation of and via Thue--Morse Words
Hideo Bannai, Mitsuru Funakoshi, Tomohiro I +3
We prove that for , the size of the smallest bidirectional scheme for the th Thue--Morse word is . Since Kutsukake et al. [SPIRE 2020] show that the…
Compressed Communication Complexity of Hamming Distance
Shiori Mitsuya, Yuto Nakashima, Shunsuke Inenaga +2
We consider the communication complexity of the Hamming distance of two strings. Bille et al. [SPIRE 2018] considered the communication complexity of the longest common prefix (LCP…