Michael Itzhaki
YOU?
Author Swipe
View article: Asymptotically Optimal Representation of Palindromic Structure
Asymptotically Optimal Representation of Palindromic Structure Open
We introduce an asymptotically optimal representation of the Manacher array of a string that supports constant-time access. The approach relies on the combinatorial properties of palindromes, yielding a compact yet efficient structure. Thi…
View article: Explicit Combinatoric Structures of Palindromes and Chromatic Number of Restriction Graphs
Explicit Combinatoric Structures of Palindromes and Chromatic Number of Restriction Graphs Open
The palindromic fingerprint of a string $S[1\ldots n]$ is the set $PF(S) = \{(i,j)~|~ S[i\ldots j] \textit{ is a maximal }\\ \textit{palindrome substring of } S\}$. In this work, we consider the problem of string reconstruction from a pali…
View article: Analysis of the Period Recovery Error Bound
Analysis of the Period Recovery Error Bound Open
The recovery problem is the problem whose input is a corrupted text T that was originally periodic, and where one wishes to recover its original period. The algorithm’s input is T without any information about either the period’s length or…