About: Geometry of binary search trees

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Geometry of binary search trees Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

In computer science, one approach to the dynamic optimality problem on online algorithms for binary search trees involves reformulating the problem geometrically, in terms of augmenting a set of points in the plane with as few additional points as possible in order to avoid rectangles with only two points on their boundary.

Attributes	Values
rdfs:label	Geometry of binary search trees (en)
rdfs:comment	In computer science, one approach to the dynamic optimality problem on online algorithms for binary search trees involves reformulating the problem geometrically, in terms of augmenting a set of points in the plane with as few additional points as possible in order to avoid rectangles with only two points on their boundary. (en)
sameAs	Geometry of binary search trees Geometry of binary search trees
dbp:wikiPageUsesTemplate	dbt:Clear dbt:Multiple_image dbt:Mvar dbt:Reflist
Subject	Binary trees Geometry
thumbnail	wiki-commons:Special:FilePath/StaticBinarySearchTree_GeometricalView_example.jpg?width=300
foaf:depiction
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Geometry_of_binary_search_trees?oldid=1061326237&ns=0
Wikipage page ID	39071852 (xsd:integer)
page length (characters) of wiki page	10954 (xsd:nonNegativeInteger)
Wikipage revision ID	1061326237 (xsd:integer)
Link from a Wikipage to another Wikipage	Greedy algorithm NP-completeness Binary search algorithm Binary search tree Self-balancing binary search tree Binary trees Geometry Splay tree Competitive analysis (online algorithm) Computer science Online algorithm Optimal binary search tree Iacono's working set structure Interleave lower bound Tree rotation Lowest common ancestor Tango tree
has abstract	In computer science, one approach to the dynamic optimality problem on online algorithms for binary search trees involves reformulating the problem geometrically, in terms of augmenting a set of points in the plane with as few additional points as possible in order to avoid rectangles with only two points on their boundary. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Geometry_of_binary_search_trees
is Wikipage redirect of	Arborally satisfied A Geometric View of Binary Search Trees
is Link from a Wikipage to another Wikipage of	Binary search tree Interleave lower bound Arborally satisfied A Geometric View of Binary Search Trees
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/Geometry_of_binary_search_trees

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 898 MB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software