Constructing optimal search trees in optimal time

DOI10.1109/12.780881MaRDI QIDQ4571407zbMATH OpenOpenAlexFDO

Authors

Publication date 9 July 2018

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.780881

Mathematics Subject Classification ID

Data structures (68P05)

Cited in

(9)

• Linear-time construction of treaps and Cartesian trees
• Fast searching in trees
• Optimal Search Trees with 2-Way Comparisons
• scientific article; zbMATH DE number 1135820 (Why is no real title available?)
• Improved search heuristics for the sa-tree
• scientific article; zbMATH DE number 2102777 (Why is no real title available?)
• Obtaining Optimalk-Cardinality Trees Fast
• Building Optimal Binary Search Trees from Sorted Values in O(N) Time
• Execution time analysis of a top-down R-tree construction algorithm

This page was built for publication: Constructing optimal search trees in optimal time

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