Efficient multiway radix search trees

DOI10.1016/S0020-0190(96)00151-2MaRDI QIDQ1350102zbMATH OpenOpenAlexFDO

Authors Úlfar Erlingsson, T. V. Raman, Mukkai S. Krishnamoorthy

Publication date 27 February 1997

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(96)00151-2

zbMATH Keywords

AlgorithmsCode generationCode optimizationCompilersSwitch statements

Mathematics Subject Classification ID

Theory of operating systems (68N25) Searching and sorting (68P10)

Recommendations

• Efficient Construction of Near-Optimal Binary and Multiway Search Trees
• Fast searching in trees
• Efficient search algorithm on compact S-trees
• Optimal search trees using two-way key comparisons
• Multi-Finger Binary Search Trees
• Efficient reorganization of binary search trees
• scientific article; zbMATH DE number 3907783
• Self-adjusting multi-way search trees
• Optimal binary search trees

Cites work

• Compilation of the Pascal case statement
• Efficient randomized pattern-matching algorithms
• scientific article; zbMATH DE number 839554 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Optimizing two-state case statements in Pascal

Cited in

(5)

• Radix sort trees in the large
• Fast searching in trees
• scientific article; zbMATH DE number 3907783 (Why is no real title available?)
• Efficient search algorithm on compact S-trees
• Multi-Finger Binary Search Trees

Describes a project that uses

Uses Software

• PATRICIA

This page was built for publication: Efficient multiway radix search trees

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