1 citations · 1 across the 4 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.DS2025
Cartesian Forest Matching
Bastien Auvray, Julien David, Richard Groult +1
In this paper, we introduce the notion of Cartesian Forest, which generalizes Cartesian Trees, in order to deal with partially ordered sequences. We show that algorithms that solve…
cs.DS2025
Approximate Cartesian Tree Matching with One Difference
Bastien Auvray, Julien David, Samah Ghazawi +3
Cartesian tree pattern matching consists of finding all the factors of a text that have the same Cartesian tree than a given pattern. There already exist theoretical and practical…