Search trees and bubble memories
Philippe Flajolet, Thomas Ottmann, Derick Wood (1985)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “An algorithm to compute the möbius function of the rotation lattice of binary trees”
Search trees and bubble memories
On the average number of registers needed to evaluate a special class of backtrack trees
U. Trier (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A new class of balanced search trees : half-balanced binary search tress
H. J. Olivié (1982)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Uniformly growing backtrack trees
Rainer Kemp (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Arbitrary weight changes in dynamic trees
Kurt Mehlhorn (1981)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Binary trees, fringe thickness and minimum path length
Helen Cameron, Derick Wood (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Digital search trees with keys of variable length
Markus E. Nebel (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: