1 citations · 1 across the 1 of their papers we have counts for
3 papers
cs.DS2021
The k-mappability problem revisited
Amihood Amir, Itai Boneh, Eitan Kondratovsky
The -mappability problem has two integers parameters and . For every subword of size in a text , we wish to report the number of indices in in which the word o…
cs.DS2020★ 1 cited
Update Query Time Trade-off for dynamic Suffix Arrays
Amihood Amir, Itai Boneh
The Suffix Array SA(S) of a string S[1 ... n] is an array containing all the suffixes of S sorted by lexicographic order. The suffix array is one of the most well known indexing da…
cs.DS2019
Dynamic Palindrome Detection
Amihood Amir, Itai Boneh
Lately, there is a growing interest in dynamic string matching problems. Specifically, the dynamic Longest Common Factor problem has been researched and some interesting results ha…