More on the linear search problem
From MaRDI portal
Publication:2530991
DOI10.1007/BF02760028zbMath0168.39503OpenAlexW2068224788MaRDI QIDQ2530991
Publication date: 1965
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02760028
Related Items (21)
The linear search problem rides again ⋮ Lower bounds in on-line geometric searching metric searching ⋮ Generalizations in the linear search problem ⋮ Search and delivery man problems: when are depth-first paths optimal? ⋮ Optimal multiplicative generalized linear search plan for a discrete random walker ⋮ Search on a Line by Byzantine Robots ⋮ Overcoming probabilistic faults in disoriented linear search ⋮ Search Games: A Review ⋮ Online search with a hint ⋮ Multiplicative linear search for a Brownian target motion ⋮ Better Upper Bounds for Searching on a Line with Byzantine Robots ⋮ Lower bounds for searching robots, some faulty ⋮ Lower bounds in on-line geometric searching ⋮ Son of the linear search problem ⋮ Searching for the Random Walking microorganism cells ⋮ Star search -- a different show ⋮ Yet more on the linear search problem ⋮ Exploration of High-Dimensional Grids by Finite Automata ⋮ The return of the linear search problem ⋮ On the minimality of search paths under absolutely continuous univariate distributions ⋮ Optimal search paths for random variables
Cites Work
This page was built for publication: More on the linear search problem
