A Linear Search Problem
Eugene Wong · SIAM Review · 1964
Previous article Next article A Linear Search ProblemEugene WongEugene Wonghttps://doi.org/10.1137/1006036PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] W. W. Peterson, Addressing for random-access storage, IBM J. Res. Develop., 1 (1957), 130–146 MR0085633 CrossrefISIGoogle Scholar[2] Richard Bellman, Dynamic programming, Princeton Univeristy Press, Princeton, N. J., 1957xxv+342 MR0090477 Google Scholar Previous article Next article FiguresRelatedReferencesCited byDetails Operations research applications of dichotomous searchEuropean Journal of Operational Research, Vol. 265, No. 3 Cross Ref Efficient fault-diagnosis algorithms for all-optical WDM networks with probabilistic link failuresJournal of Lightwave Technology, Vol. 23, No. 10 Cross Ref An asymptotic theory for recurrence relations based on minimization and maximizationTheoretical Computer Science, Vol. 290, No. 3 Cross Ref On polychotomous search problemsEuropean Journal of Operational Research, Vol. 73, No. 2 Cross Ref The Number of 1’s in Binary Integers: Bounds and Extremal PropertiesM. D. McIlroy13 July 2006 | SIAM Journal on Computing, Vol. 3, No. 4AbstractPDF (456 KB)Optimum binary search treesActa Informatica, Vol. 1, No. 1 Cross Ref Die Sequentialsuche Cross Ref On discrete search problemsCybernetics, Vol. 2, No. 4 Cross Ref Volume 6, Issue 2| 1964SIAM Review History Submitted:09 August 1963Published online:18 July 2006 InformationCopyright © 1964 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/1006036Article page range:pp. 168-174ISSN (print):0036-1445ISSN (online):1095-7200Publisher:Society for Industrial and Applied Mathematics
Cited by 14 works. doi:10.1137/1006036