Median split trees
From MaRDI portal
Publication:4167592
DOI10.1145/359642.359653zbMath0386.68060OpenAlexW2032579751MaRDI QIDQ4167592
Publication date: 1978
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/359642.359653
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Information storage and retrieval of data (68P20) Discrete mathematics in relation to computer science (68R99)
Related Items (12)
Optimal search trees using two-way key comparisons ⋮ Ordered priority queues ⋮ Optimal multiway generalized split trees ⋮ An algorithm for dynamic processing of dawg's ⋮ Classification via two-way comparisons (extended abstract) ⋮ Efficient multi-attribute pattern matching ⋮ A practical method for implementing string pattern matching machines ⋮ Optimal binary search trees ⋮ On the cost of unsuccessful searches in search trees with two-way comparisons ⋮ On Huang and Wong's algorithm for generalized binary split trees ⋮ Generalized binary split trees ⋮ A note on optimal multiway split trees
This page was built for publication: Median split trees
