Pages that link to "Item:Q3823150"
From MaRDI portal
The following pages link to Search in an Ordered Array Having Variable Probe Cost (Q3823150):
Displayed 7 items.
- An approximation algorithm for binary searching in trees (Q633849) (← links)
- Trees with exponentially growing costs (Q924721) (← links)
- A hierarchic family of \(C^ 1\) finite elements for \(4^{th}\) order elliptic problems (Q1185501) (← links)
- Operations research applications of dichotomous search (Q1681128) (← links)
- A strategy for searching with different access costs. (Q1853499) (← links)
- Spatiotemporal persistent homology for dynamic metric spaces (Q2230910) (← links)
- Optimized binary search and text retrieval (Q6102310) (← links)