Optimal average-case binary search with outcome-dependent costs
From MaRDI portal
Cites work
- A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs
- A general class of resource tradeoffs
- Approximating decision trees with priority hypotheses
- Approximating decision trees with value dependent testing costs
- Binary search with errors and variable cost queries
- Bounds and algorithms for alphabetic codes and binary search trees
- Extending the quadrangle inequality to speed-up dynamic programming
- scientific article; zbMATH DE number 3887059 (Why is no real title available?)
- scientific article; zbMATH DE number 3162350 (Why is no real title available?)
- scientific article; zbMATH DE number 4210044 (Why is no real title available?)
- scientific article; zbMATH DE number 4049013 (Why is no real title available?)
- scientific article; zbMATH DE number 4057247 (Why is no real title available?)
- Old and new results on alphabetic codes
- Operations research applications of dichotomous search
- Optimal alphabetic search trees with restricted maximal height
- Optimal Alphabetic Trees
- Optimal Binary Search Trees with Restricted Maximal Depth
- Optimal Computer Search Trees and Variable-Length Alphabetical Codes
- Optimum binary search trees
- Optimum lopsided binary trees
- Speed-Up in Dynamic Programming
- Submodular learning and covering with response-dependent costs
- The sound of silence: Guessing games for saving energy in a mobile environment
This page was built for publication: Optimal average-case binary search with outcome-dependent costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7296161)
