scientific article; zbMATH DE number 3518272

zbMATH Open0331.68023MaRDI QIDQ4096430FDOQ4096430

Authors: Thomas Ottmann, Hans-Werner Six 

Publication date: 1976

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Cited In (13)

• A tight upper bound for the path length of AVL trees
• Height balanced 2-3 trees
• Dynamic weighted binary search trees
• Balance in AVL trees and space cost of brother trees
• Automatic functional correctness proofs for functional search trees
• Expected behaviour analysis of AVL trees
• On the average number of rebalancing operations in weight-balanced trees
• Defining families of trees with E0L grammars
• On the correspondence between AVL trees and brother trees
• The node visit cost of brother trees
• On the relationship between son-trees and symmetric binary B-trees
• (g//0,g//1,\dots ,g//k)-trees and unary OL systems
• Improved bounds for the expected behaviour of AVL trees

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4096430)