Simone Faro

Fast Multiple Pattern Cartesian Tree Matching

2019 · arXiv (Cornell University)

Cartesian tree matching is the problem of finding all substrings in a given text which have the same Cartesian trees as that of a given pattern. In this paper, we deal with Cartesian tree matching …

The Many Qualities of a New Directly Accessible Compression Scheme

2023 · arXiv (Cornell University)

We present a new variable-length computation-friendly encoding scheme, named SFDC (Succinct Format with Direct aCcesibility), that supports direct and fast accessibility to any element of the compressed sequence and achieves compression ratios often higher than …