Skip to search formSkip to main contentSkip to account menu

Cartesian tree

Known as: Cartesian 
In computer science, a Cartesian tree is a binary tree derived from a sequence of numbers; it can be uniquely defined from the properties that it is… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
To assess the concepts of philosophy, a spherical coordinate system is proposed. The introduction of a unified approach allows… 
2019
2019
In this paper we compare two finite words u and v by the lexicographical order of the infinite words uω and vω. Informally, we… 
2011
2011
One can build a Cartesian tree from an n-element sequence in O(n) time, and from an n-node free tree in O(n log n) time (with a… 
2008
2008
. Approximate string matching is an important problem in Computer Science. The standard solution for this problem is an O ( mn… 
2007
2007
ACKNOWLEDGEMENTS I would like to thank my advisor Robert Krasny, without whom this thesis would never have been possible. The…