Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A generalization of AVL trees

From MaRDI portal
Publication:3212707
Jump to:navigation, search

DOI10.1145/355609.362340zbMath0269.68063OpenAlexW2042453654MaRDI QIDQ3212707

Caxton C. Foster

Publication date: 1973

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/355609.362340


Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)


Related Items

Space saving generalization of \(B\)-trees with \(2/3\) utilization, Binary search trees in secondary memory, Height balanced 2-3 trees, One-sided k-height-balanced trees, On the correspondence between AVL trees and brother trees



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3212707&oldid=16293830"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 22:57.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki