Multidimensional Searching Problems
- 1 June 1976
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 5 (2) , 181-186
- https://doi.org/10.1137/0205015
Abstract
Classic binary search is extended to multidimensional search problems. This extension yields efficient algorithms for a number of tasks such as a secondary searching problem of Knuth, region location in planar graphs, and speech recognition.Keywords
This publication has 0 references indexed in Scilit: