Monotonicity and efficient computation of optimal dichotomous search
From MaRDI portal
Publication:1308740
DOI10.1016/0166-218X(93)90104-VzbMath0784.90099MaRDI QIDQ1308740
Refael Hassin, Mordechai I. Henig
Publication date: 23 March 1994
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items (3)
Control of arrivals and departures in a state-dependent input-output system ⋮ Operations research applications of dichotomous search ⋮ Binary search with delayed and missing answers
Cites Work
- Unnamed Item
- Unnamed Item
- Selection of the optimum uniform partition search
- Best Huffman trees
- Optimal alphabetic search trees with restricted maximal height
- Optimum binary search trees
- On an efficient dynamic programming technique of F. F. Yao
- A Dichotomous Search for a Geometric Random Variable
- A High–Low search game on the unit interval
- Search for point in interval, with high–low feedback
- Binary Search on a Tape
- Height Restricted Optimal Binary Trees
- Optimal Multi-Way Search Trees
- Speed-Up in Dynamic Programming
- Optimal Alphabetic Trees
- A New Algorithm for Minimum Cost Binary Trees
- Minimizing a Submodular Function on a Lattice
- A DICHOTOMOUS SEARCH WITH TRAVEL COST
- Sequential search of an optimal dosage: Non‐bayesian methods
- Optimal Binary Search Trees with Restricted Maximal Depth
- Letter to the Editor—A Search Problem
- Some Theorems on Sorting
- Optimal Computer Search Trees and Variable-Length Alphabetical Codes
- Path Length of Binary Search Trees
- On dichotomous search with direction-dependent costs for a uniformly hidden object
This page was built for publication: Monotonicity and efficient computation of optimal dichotomous search
