About: Doubly logarithmic tree

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In computer science a doubly logarithmic tree is a tree where each internal node of height 1, the tree layer above the leaves, has two children, and each internal node of height has children. Each child of the root contains leaves. The number of children at a node as we go from leaf to root is 0,2,2,4,16, 256, 65536, ... (sequence in the OEIS) A similar tree called a k-merger is used in Prokop et al.'s cache oblivious Funnelsort to merge elements.

thumbnail
Property Value
dbo:abstract
  • In computer science a doubly logarithmic tree is a tree where each internal node of height 1, the tree layer above the leaves, has two children, and each internal node of height has children. Each child of the root contains leaves. The number of children at a node as we go from leaf to root is 0,2,2,4,16, 256, 65536, ... (sequence in the OEIS) A similar tree called a k-merger is used in Prokop et al.'s cache oblivious Funnelsort to merge elements. (en)
dbo:thumbnail
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 25315112 (xsd:integer)
dbo:wikiPageLength
  • 1760 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1033199128 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdfs:comment
  • In computer science a doubly logarithmic tree is a tree where each internal node of height 1, the tree layer above the leaves, has two children, and each internal node of height has children. Each child of the root contains leaves. The number of children at a node as we go from leaf to root is 0,2,2,4,16, 256, 65536, ... (sequence in the OEIS) A similar tree called a k-merger is used in Prokop et al.'s cache oblivious Funnelsort to merge elements. (en)
rdfs:label
  • Doubly logarithmic tree (en)
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
foaf:isPrimaryTopicOf
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License