research-article

Multidimensional Searching Problems

Authors:

David Dobkin,

Richard J. LiptonAuthors Info & Claims

SIAM Journal on Computing, Volume 5, Issue 2

Pages 181 - 186

https://doi.org/10.1137/0205015

Published: 01 June 1976 Publication History

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.

References

[1]

Donald E. Knuth, The art of computer programming. Volume 3, Addison-Wesley Publishing Co., Reading, Mass.-London-Don Mills, Ont., 1973xi+722 pp. (1 foldout), Sorting and Searching

Google Scholar

[2]

W. Newman, R. Sproull, Principles of Interactive Computer Graphics, McGraw-Hill, New York, 1973

Digital Library

Google Scholar

[3]

J. A. George, Ph.D. Thesis, A computer implementation of the finite element method, Stanford Univ., Stanford, Calif., 1971

Google Scholar

[4]

C. L. Liu, Introduction to combinatorial mathematics, McGraw-Hill Book Co., New York, 1968x+393

Google Scholar

[5]

S. Levinson, Private communication

Google Scholar

Cited By

View all

Reif JSen S(2023)Optimal randomized parallel algorithms for computational geometryAlgorithmica10.1007/BF017587537:1-6(91-117)Online publication date: 22-Mar-2023
https://dl.acm.org/doi/10.1007/BF01758753
Brodal GRysgaard CSchou JSvenning R(2023)Space-Efficient Functional Offline-Partially-Persistent Trees with Applications to Planar Point LocationAlgorithms and Data Structures10.1007/978-3-031-38906-1_43(644-659)Online publication date: 31-Jul-2023
https://dl.acm.org/doi/10.1007/978-3-031-38906-1_43
Wang JShen J(2022)Fast spectral analysis for approximate nearest neighbor searchMachine Language10.1007/s10994-021-06124-1111:6(2297-2322)Online publication date: 1-Jun-2022
https://dl.acm.org/doi/10.1007/s10994-021-06124-1
Show More Cited By

Index Terms

Multidimensional Searching Problems

Index terms have been assigned to the content through auto-classification.

Recommendations

Total domination in planar graphs of diameter two

MacGillivary and Seyffarth [G. MacGillivray, K. Seyffarth, Domination numbers of planar graphs, J. Graph Theory 22 (1996) 213-229] proved that planar graphs of diameter two have domination number at most three. Goddard and Henning [W. Goddard, M.A. ...
Planar graphs without 4- and 5-cycles are acyclically 4-choosable

Let G=(V,E) be a graph. A proper vertex coloring of G is acyclic if G contains no bicolored cycle. Namely, every cycle of G must be colored with at least three colors. G is acyclically L-list colorable if for a given list assignment L={L(v):v@?V}, there ...
Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles

Two cycles are said to be adjacent if they share a common edge. Let G be a planar graph without triangles adjacent 4-cycles. We prove that l ( G ) Δ ( G ) + 2 if Δ ( G ) 6 , and l ' ( G ) = Δ ( G ) and l ( G ) = Δ ( G ) + 1 if Δ ( G ) 8 , where l ' ( G )...

Comments

Information & Contributors

Information

Published In

SIAM Journal on Computing Volume 5, Issue 2

Jun 1976

151 pages

ISSN:0097-5397

DOI:10.1137/smjcat.1976.5.issue-2

Issue’s Table of Contents

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 June 1976

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Reif JSen S(2023)Optimal randomized parallel algorithms for computational geometryAlgorithmica10.1007/BF017587537:1-6(91-117)Online publication date: 22-Mar-2023
https://dl.acm.org/doi/10.1007/BF01758753
Brodal GRysgaard CSchou JSvenning R(2023)Space-Efficient Functional Offline-Partially-Persistent Trees with Applications to Planar Point LocationAlgorithms and Data Structures10.1007/978-3-031-38906-1_43(644-659)Online publication date: 31-Jul-2023
https://dl.acm.org/doi/10.1007/978-3-031-38906-1_43
Wang JShen J(2022)Fast spectral analysis for approximate nearest neighbor searchMachine Language10.1007/s10994-021-06124-1111:6(2297-2322)Online publication date: 1-Jun-2022
https://dl.acm.org/doi/10.1007/s10994-021-06124-1
Moshkov M(2022)Time and space complexity of deterministic and nondeterministic decision treesAnnals of Mathematics and Artificial Intelligence10.1007/s10472-022-09814-191:1(45-74)Online publication date: 9-Sep-2022
https://dl.acm.org/doi/10.1007/s10472-022-09814-1
Grimson R(2010)An efficient algorithm for the sign condition problem in the semi-algebraic contextProceedings of the 6th international conference on Advances in Geometric Modeling and Processing10.1007/978-3-642-13411-1_5(57-76)Online publication date: 16-Jun-2010
https://dl.acm.org/doi/10.1007/978-3-642-13411-1_5
Faragó ALinder TLugosi G(1993)Fast Nearest-Neighbor Search in Dissimilarity SpacesIEEE Transactions on Pattern Analysis and Machine Intelligence10.1109/34.23208315:9(957-962)Online publication date: 1-Sep-1993
https://dl.acm.org/doi/10.1109/34.232083
Meiser S(1993)Point Location in Arrangements of HyperplanesInformation and Computation10.1006/inco.1993.1057106:2(286-303)Online publication date: 1-Oct-1993
https://dl.acm.org/doi/10.1006/inco.1993.1057

Abstract

References

Cited By

Index Terms

Recommendations

Total domination in planar graphs of diameter two

Planar graphs without 4- and 5-cycles are acyclically 4-choosable

Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations