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)

Related topics

Related topics

30 relations
All nearest smaller valuesBinary heapBinary treeCommunications of the ACM

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Finding Periods in Cartesian Tree Matching
In Cartesian tree matching, two strings match if the Cartesian trees of the strings are the same. In this paper we define full… 
2019
2019
Hyperbolic Cartesian Tree
To assess the concepts of philosophy, a spherical coordinate system is proposed. The introduction of a unified approach allows… 
2019
2019
Some variations on Lyndon words
In this paper we compare two finite words $u$ and $v$ by the lexicographical order of the infinite words $u^\omega$ and $v^\omega… 
2018
2018
D ec 2 01 7 Cartesian trees and Lyndon trees
The article describes the structural and algorithmic relations between Cartesian trees and Lyndon Trees. This leads to a uniform… 
2017
2017
Cartesian trees and Lyndon trees
The article describes the structural and algorithmic relations between Cartesian trees and Lyndon Trees. This leads to a uniform… 
2012
2012
Discrete range searching primitive for the GPU and its applications
Graphics processing units (GPUs) provide large computational power at a very low price, which position GPUs well as an ubiquitous… 
2011
2011
Building Cartesian Trees from Free Trees
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… 
2007
2007
Vortex Sheet Simulations of 3D Flows Using an Adaptive Triangular Panel/Particle Method.
ACKNOWLEDGEMENTS I would like to thank my advisor Robert Krasny, without whom this thesis would never have been possible. The… 
1997
1997
A three-dimensional Cartesian tree-code and applications to vortex sheet roll-up.
A THREE-DIMENSIONAL CARTESIAN TREE-CODE AND APPLICATIONS TO VORTEX SHEET ROLL-UP 
1994
1994
On Random Cartesian Trees
  • L. Devroye
  • Random Struct. Algorithms
  • 1994
  • Corpus ID: 12606773
Cartesian trees are binary search trees in which the nodes exhibit the heap property according to a second (priority) key. If the… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)