Improving time and space efficiency in generalized binary search trees

DOI10.1007/BF00263296zbMath0611.68040OpenAlexW2066572674MaRDI QIDQ1087332

Jose Luis Gascon, Walter Cunto

Publication date: 1987

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00263296

zbMATH Keywords

analysis of algorithmsdata structuresupdatingtime complexitysearchingspace complexityGBS-treesspace performancetime performance

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Searching and sorting (68P10)

Related Items (7)

On rotations in fringe-balanced binary trees ⋮ Gkd-trees: Binary trees that combine multi-dimensional data handling, node size and fringe reorganization ⋮ Fringe analysis for extquick: An in situ distributive external sorting algorithm ⋮ Phase changes in randomm-ary search trees and generalized quicksort ⋮ Optimal binary search trees ⋮ Two Applications of Urn Processes The Fringe Analysis of Search Trees and The Simulation of Quasi-Stationary Distributions of Markov Chains ⋮ The analysis of heuristics for search trees

This page was built for publication: Improving time and space efficiency in generalized binary search trees