Multidimensional Searching Problems

descriptionPublicationkeyboard_double_arrow_right Article 01 Jun 1976 English Publisher:Society for Industrial & Applied Mathematics (SIAM)Journal:SIAM Journal on Computing, volume 5, pages 181-186 (issn: 0097-5397, eissn: 1095-7111,

Copyright policy )

Authors: David P. Dobkin; Richard J. Lipton;

doi: 10.1137/0205015

Multidimensional Searching Problems

- Summary
- Subjects
- Metrics

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

Pattern recognition, speech recognition, General topics in the theory of software, Search theory, Symbolic computation and algebraic computation, Algorithms in computer science

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	159
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 0.1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%