Median split trees

DOI10.1145/359642.359653MaRDI QIDQ4167592zbMATH OpenOpenAlexFDO

Authors B. A. Sheil

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

Mathematics Subject Classification ID

Trees (05C05) Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Discrete mathematics in relation to computer science (68R99)

Cited in

(13)

• Ordered priority queues
• A practical method for implementing string pattern matching machines
• Optimal search trees using two-way key comparisons
• On the cost of unsuccessful searches in search trees with two-way comparisons
• On Huang and Wong's algorithm for generalized binary split trees
• Optimal multiway generalized split trees
• Efficient multi-attribute pattern matching
• An algorithm for dynamic processing of dawg's
• Optimal binary search trees
• Classification via two-way comparisons (extended abstract)
• Classification via two-way comparisons
• Generalized binary split trees
• A note on optimal multiway split trees

This page was built for publication: Median split trees

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