Publication:3951559
From MaRDI portal
zbMath0489.68056MaRDI QIDQ3951559
Publication date: 1982
Full work available at URL: https://eudml.org/doc/92153
68Q25: Analysis of algorithms and problem complexity
68P10: Searching and sorting
68R10: Graph theory (including graph drawing) in computer science
Related Items
Maintaining multiple representations of dynamic data structures, Binary search trees of almost optimal height, Defining families of trees with E0L grammars, A note on the path length of red-black trees, Insertion reachability, skinny skeletons, and path length in red-black trees, A dynamic fixed windowing problem, Updating a balanced search tree in 0(1) rotations, Rank-Balanced Trees, Amortized Computational Complexity
Cites Work