2 papers
cs.DS2024
Extending the Burrows-Wheeler Transform for Cartesian Tree Matching and Constructing It
Eric M. Osterkamp, Dominik Köppl
Cartesian tree matching is a form of generalized pattern matching where a substring of the text matches with the pattern if they share the same Cartesian tree. This form of matchin…
cs.DS2019
Dynamic Path-Decomposed Tries
Shunsuke Kanda, Dominik Köppl, Yasuo Tabei +2
A keyword dictionary is an associative array whose keys are strings. Recent applications handling massive keyword dictionaries in main memory have a need for a space-efficient impl…