1 citations · 1 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2019
Fast Multiple Pattern Cartesian Tree Matching
Geonmo Gu, Siwoo Song, Simone Faro +2
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 Cartesi…
cs.DS2019★ 1 cited
Fast Cartesian Tree Matching
Siwoo Song, Cheol Ryu, Simone Faro +2
Cartesian tree matching is the problem of finding all substrings of a given text which have the same Cartesian trees as that of a given pattern. So far there is one linear-time sol…