Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Cartesian_tree> ?p ?o. }
Showing items 1 to 32 of
32
with 100 items per page.
- Cartesian_tree abstract "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 heap-ordered and that a symmetric (in-order) traversal of the tree returns the original sequence. Introduced by Vuillemin (1980) in the context of geometric range searching data structures, Cartesian trees have also been used in the definition of the treap and randomized binary search tree data structures for binary search problems. The Cartesian tree for a sequence may be constructed in linear time using a stack-based algorithm for finding all nearest smaller values in a sequence.".
- Cartesian_tree thumbnail Cartesian_tree.svg?width=300.
- Cartesian_tree wikiPageExternalLink seidel96randomized.html.
- Cartesian_tree wikiPageExternalLink lca.ps.
- Cartesian_tree wikiPageID "15843635".
- Cartesian_tree wikiPageRevisionID "545157540".
- Cartesian_tree hasPhotoCollection Cartesian_tree.
- Cartesian_tree subject Category:Binary_trees.
- Cartesian_tree subject Category:Sorting_algorithms.
- Cartesian_tree type Abstraction100002137.
- Cartesian_tree type Act100030358.
- Cartesian_tree type Activity100407535.
- Cartesian_tree type Algorithm105847438.
- Cartesian_tree type Event100029378.
- Cartesian_tree type Procedure101023820.
- Cartesian_tree type PsychologicalFeature100023100.
- Cartesian_tree type Rule105846932.
- Cartesian_tree type SortingAlgorithm105847658.
- Cartesian_tree type SortingAlgorithms.
- Cartesian_tree type YagoPermanentlyLocatedEntity.
- Cartesian_tree comment "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 heap-ordered and that a symmetric (in-order) traversal of the tree returns the original sequence. Introduced by Vuillemin (1980) in the context of geometric range searching data structures, Cartesian trees have also been used in the definition of the treap and randomized binary search tree data structures for binary search problems.".
- Cartesian_tree label "Cartesian tree".
- Cartesian_tree label "Árbol Cartesiano".
- Cartesian_tree label "笛卡尔树".
- Cartesian_tree sameAs Árbol_Cartesiano.
- Cartesian_tree sameAs m.05pdfv2.
- Cartesian_tree sameAs Q5047286.
- Cartesian_tree sameAs Q5047286.
- Cartesian_tree sameAs Cartesian_tree.
- Cartesian_tree wasDerivedFrom Cartesian_tree?oldid=545157540.
- Cartesian_tree depiction Cartesian_tree.svg.
- Cartesian_tree isPrimaryTopicOf Cartesian_tree.
