13 citations · 30 across the 11 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019★ 7 cited
Cartesian Tree Matching and Indexing
Sung Gwan Park, Amihood Amir, Gad M. Landau +1
We introduce a new metric of match, called Cartesian tree matching, which means that two strings match if they have the same Cartesian trees. Based on Cartesian tree matching, we d…
cs.DS2019
Top Tree Compression of Tries
Philip Bille, Inge Li Gørtz, Paweł Gawrychowski +2
We present a compressed representation of tries based on top tree compression [ICALP 2013] that works on a standard, comparison-based, pointer machine model of computation and supp…