Monotonicity and efficient computation of optimal dichotomous search
type: Item
instance of: scholarly article
title: Monotonicity and efficient computation of optimal dichotomous search
zbMATH Open document ID: 0784.90099
DOI: 10.1016/0166-218X(93)90104-V
published in: Discrete Applied Mathematics
publication date: 1994-03-23T00:00:00Z
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 464952
zbMATH Keywords: monotone policy
zbMATH Keywords: dichotomous search
author: Refael Hassin
author: Mordecai Henig
MaRDI profile type: Publication
cites work: Search for point in interval, with high–low feedback
cites work: A High–Low search game on the unit interval
cites work: Letter to the Editor—A Search Problem
cites work: Sequential search of an optimal dosage: Non‐bayesian methods
cites work: Optimal Binary Search Trees with Restricted Maximal Depth
cites work: A New Algorithm for Minimum Cost Binary Trees
cites work: Optimal Multi-Way Search Trees
cites work: A Dichotomous Search for a Geometric Random Variable
cites work: Q3313617
cites work: On dichotomous search with direction-dependent costs for a uniformly hidden object
cites work: Selection of the optimum uniform partition search
cites work: Path Length of Binary Search Trees
cites work: Optimal Computer Search Trees and Variable-Length Alphabetical Codes
cites work: Binary Search on a Tape
cites work: Optimal Alphabetic Trees
cites work: Optimum binary search trees
cites work: Height Restricted Optimal Binary Trees
cites work: Best Huffman trees
cites work: Some Theorems on Sorting
cites work: Q5181076
cites work: A DICHOTOMOUS SEARCH WITH TRAVEL COST
cites work: Minimizing a Submodular Function on a Lattice
cites work: On an efficient dynamic programming technique of F. F. Yao
cites work: Optimal alphabetic search trees with restricted maximal height
cites work: Speed-Up in Dynamic Programming
description: scientific article; zbMATH DE number 464952