Pages that link to "Item:Q2768391"
From MaRDI portal
The following pages link to On binary searching with non-uniform costs (Q2768391):
Displaying 12 items.
- An approximation algorithm for binary searching in trees (Q633849) (← links)
- Optimal binary search trees with costs depending on the access paths. (Q1401195) (← links)
- Binary search in graphs revisited (Q1741841) (← links)
- The binary identification problem for weighted trees (Q1758172) (← links)
- A strategy for searching with different access costs. (Q1853499) (← links)
- Binary searching with nonuniform costs and its application to text retrieval (Q1977134) (← links)
- Can a randomized binary search have an \(O(1)\) complexity at least in practice? (Q2383711) (← links)
- On binary searching with nonuniform costs (Q2784491) (← links)
- Search in an Ordered Array Having Variable Probe Cost (Q3823150) (← links)
- Binary Search in Graphs Revisited (Q5111234) (← links)
- Coping with errors in binary search procedures (Preliminary Report) (Q5402561) (← links)
- Optimized binary search and text retrieval (Q6102310) (← links)
