ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Height balanced 2–3 trees (1979)
    Springer
    Computing 21 (1979), S. 195-211 
    Details
    ISSN: 1436-5057
    Keywords: Balanced search trees ; height balanced trees ; 2–3 trees ; B-trees ; Balancierte Suchbäume ; höhenbalancierte Bäume ; 2–3 Bäume ; B-Bäume
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es wird die Klasse der höhenbalancierten 2–3 Bäume eingeführt. Diese Klasse umfaßt die Klasse der 2–3 Bäume echt. Einfüge- und Entferne-Algorithmen mit 0 (logn) Zeitkomplexität werden für diese Bäume angegeben. Mit dieser Arbeit wird gezeigt, daß das Konzept des Höhenbalancierens vorteilhaft auf Klassen von nichtbinären Bäumen angewandt werden kann. Dies stellt einen Beitrag zur Lösung eines Problems von Knuth dar.
    Notes: Abstract The class of height balanced 2–3 trees is defined. This class properly contains the class of 2–3 trees. Insertion and deletion algorithms for these trees having 0 (logn) performance are provided. This paper thus, effectively demonstrates that “height balancing” can be usefully applied to classes of trees other than binary trees, which is a contribution to the solution of one of Knuth's problems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02253053
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    2–3 brother trees (1978)
    Springer
    BIT 18 (1978), S. 425-435 
    Details
    ISSN: 1572-9125
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract 2–3 brother trees form a dense class of search trees havingO(logN) insertion and deletion algorithms. In this paper we provide anO(logN) insertion algorithm and show that these trees have much better density and storage utilization than 2–3 trees. Thus we demonstrate that the “brother property” which has so far been used only for binary trees can be usefully applied to 2–3 trees.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01932021
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Optimum multiway search trees (1980)
    Springer
    Acta informatica 14 (1980), S. 119-133 
    Details
    ISSN: 1432-0525
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Summary The construction of optimum multiway search trees for n keys, n key weights and n+1 gap weights, is investigated. A new general optimality principle is presented, which can be “tuned” for specific applications. Moreover we consider the affects of three additional constraints, namely height, structural and node search restrictions, which lead to a number of new construction algorithms. In particular we concentrate on the construction of optimum t-ary search trees with linear and binary search within their nodes for which we obtain O(n 3 t) and O(n 3log2 t) time algorithms, respectively. Whether these algorithms are or are not optimal remains an important open problem, even in the binary case.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00288540
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    facet.materialart.
    Unknown
    Height balanced 2–3 trees (1979)
    Springer
    Details
    Publication Date: 1979-09-01
    Print ISSN: 0010-485X
    Electronic ISSN: 1436-5057
    Topics: Computer Science
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...