David A. Selby
IBM J. Res. Dev
In this paper we extend the notion of (2, 3)-trees and AVL trees to (g0, g1,..., gk)-trees and (g1, g2,...,gk)-AVL trees, respectively, where 1≤g0<g1<g2<...<gk. Complete characterization of these two classes of trees in terms of their generators g0, g1,..., gk is given and the connection between (g0, g1,... gk)-trees and unary OL systems is mentioned. © 1983.
David A. Selby
IBM J. Res. Dev
Elena Cabrio, Philipp Cimiano, et al.
CLEF 2013
Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science
Chidanand Apté, Fred Damerau, et al.
ACM Transactions on Information Systems (TOIS)