Fast searching in trees

MaRDI QIDQ2741474zbMATH OpenFDO

Authors Eduardo S. Laber, Loana T. Nogueira

Publication date 24 October 2001

zbMATH Keywords

searchingbuggy node

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Recommendations

• Optimal Search in Trees
• Faster tree pattern matching
• Find-and-fetch search on a tree
• Efficient multiway radix search trees
• Succinct data structure for dynamic trees with faster queries
• Constructing optimal search trees in optimal time
• scientific article; zbMATH DE number 1173838
• scientific article; zbMATH DE number 4070292
• scientific article; zbMATH DE number 4057057

Cited in

(11)

• Fast updating of well-balanced trees
• Visual search tree profiling
• scientific article; zbMATH DE number 1406253 (Why is no real title available?)
• An Approximation Algorithm for Binary Searching in Trees
• Searching in Trees, Series-Parallel and Interval Orders
• Efficient search algorithm on compact S-trees
• An approximation algorithm for binary searching in trees
• Efficient multiway radix search trees
• Searching a Tree with Permanently Noisy Advice
• Succinct data structure for dynamic trees with faster queries
• Searching for faulty leaves in binary trees

This page was built for publication: Fast searching in trees

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