On binary searching with non-uniform costs

MaRDI QIDQ2768391zbMATH OpenFDO

Authors Artur Alves Pessoa, Eduardo S. Laber, Ruy L. Milidiú

Publication date 18 June 2002

zbMATH Keywords

binary search

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• On binary searching with nonuniform costs
• On the tree search problem with non-uniform costs
• Binary searching with nonuniform costs and its application to text retrieval
• An Approximation Algorithm for Binary Searching in Trees
• A strategy for searching with different access costs.

Cited in

(12)

• Optimal binary search trees with costs depending on the access paths.
• Binary search in graphs revisited
• The binary identification problem for weighted trees
• A strategy for searching with different access costs.
• Binary searching with nonuniform costs and its application to text retrieval
• Can a randomized binary search have an \(O(1)\) complexity at least in practice?
• On binary searching with nonuniform costs
• Search in an Ordered Array Having Variable Probe Cost
• Binary search in graphs revisited
• Coping with errors in binary search procedures (Preliminary Report)
• Optimized binary search and text retrieval
• An approximation algorithm for binary searching in trees

This page was built for publication: On binary searching with non-uniform costs

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