The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Multidimensional divide-and-conquer
Open accessAbstract
Most results in the field of algorithm design are single algorithms that solve single problems. In this paper we discuss multidimensional divide-and-conquer , an algorithmic paradigm that can be instantiated in many different ways to yield a number of algorithms and data structures for multidimensional problems. We use this paradigm to give best-known solutions to such problems as the ECDF, maxima, range searching, closest pair, and all nearest neighbor problems. The contributions of the paper are on two levels. On the first level are the particular algorithms and data structures given by applying the paradigm. On the second level is the more novel contribution of this paper: a detailed study of an algorithmic paradigm that is specific enough to be described precisely yet general enough to solve a wide variety of problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,337
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Multidimensional binary search trees used for associative searching
Bentley, J. L. (1975) · Communications of the ACM · doi:10.1145/361002.361007 · Cited by 7,520
Self-citationKnuth, D. E. (1973) · Cumulative Index of Computer Aided Architectural Design · Cited by 1,719
Blum, M., Floyd, R. W., Pratt, V., Rivest, R. L., & Tarjan, R. E. (1973) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(73)80033-9 · Cited by 1,235
Data Structures for Range Searching
Bentley, J. L., & Friedman, J. H. (1979) · ACM Computing Surveys · doi:10.1145/356789.356797 · Cited by 622
Self-citationOn the Average Number of Maxima in a Set of Vectors and Applications
Bentley, J. L., Kung, H. T., Schkolnick, M., & Thompson, C. D. (1978) · Journal of the ACM · doi:10.1145/322092.322095 · Cited by 370
Self-citationA Recursive Partitioning Decision Rule for Nonparametric Classification
Friedman (1977) · IEEE Transactions on Computers · doi:10.1109/tc.1977.1674849 · Cited by 368
Decomposable searching problems
Bentley, J. L. (1979) · Information Processing Letters · doi:10.1016/0020-0190(79)90117-0 · Cited by 340
Self-citationMultidimensional Searching Problems
Dobkin, D., & Lipton, R. J. (1976) · SIAM Journal on Computing · doi:10.1137/0205015 · Cited by 248
Cited by
Surface reconstruction from unorganized points
Hoppe, H., DeRose, T., Duchamp, T., McDonald, J., & Stuetzle, W. (1992) · Proceedings of the 19th annual conference on Computer graphics and interactive techniques · doi:10.1145/133994.134011 · Cited by 2,730
Robust Monte Carlo localization for mobile robots
Thrun, S., Fox, D., Burgard, W., & Dellaert, F. (2001) · Artificial Intelligence · doi:10.1016/s0004-3702(01)00069-8 · Cited by 1,809
Geometric modeling using octree encoding
Meagher, D. (1982) · Computer Graphics and Image Processing · doi:10.1016/0146-664x(82)90104-6 · Cited by 1,266
Surface reconstruction from unorganized points
Hoppe, H., DeRose, T., Duchamp, T., McDonald, J., & Stuetzle, W. (1992) · ACM SIGGRAPH Computer Graphics · doi:10.1145/142920.134011 · Cited by 1,112
(1993) · doi:10.5555/313559.313789 · Cited by 998
Linear Programming in Linear Time When the Dimension Is Fixed
Megiddo, N. (1984) · Journal of the ACM · doi:10.1145/2422.322418 · Cited by 669
Data Structures for Range Searching
Bentley, J. L., & Friedman, J. H. (1979) · ACM Computing Surveys · doi:10.1145/356789.356797 · Cited by 622
Self-citationShortest Path Problems with Resource Constraints
Irnich, S., & Desaulniers, G. (2006) · Column Generation · doi:10.1007/0-387-25486-2_2 · Cited by 597
A Partitioning Strategy for Nonuniform Problems on Multiprocessors
Berger, & Bokhari (1987) · IEEE Transactions on Computers · doi:10.1109/tc.1987.1676942 · Cited by 579
Callahan, P. B., & Kosaraju, S. R. (1995) · Journal of the ACM · doi:10.1145/200836.200853 · Cited by 543
DeepContour: A deep convolutional feature learned by positive-sharing loss for contour detection
Shen, W., Wang, X., Wang, Y., Bai, X., & Zhang, Z. (2015) · 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2015.7299024 · Cited by 515
Reducing the Run-Time Complexity of Multiobjective EAs: The NSGA-II and Other Algorithms
Jensen, M. T. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.817234 · Cited by 458
Li, W., Zhang, Y., Sun, Y., Wang, W., Li, M., Zhang, W., & Lin, X. (2020) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2019.2909204 · Cited by 454
Accelerating exact k-means algorithms with geometric reasoning
Pelleg, D., & Moore, A. (1999) · Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/312129.312248 · Cited by 377
A Functional Approach to Data Structures and Its Use in Multidimensional Searching
Chazelle, B. (1988) · SIAM Journal on Computing · doi:10.1137/0217026 · Cited by 355
A simple algorithm for nearest neighbor search in high dimensions
Nene, S. A., & Nayar, S. K. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.615448 · Cited by 311
Computational Geometry—A Survey
Lee, & Preparata (1984) · IEEE Transactions on Computers · doi:10.1109/tc.1984.1676388 · Cited by 283
Range queries in OLAP data cubes
Ho, C.-T., Agrawal, R., Megiddo, N., & Srikant, R. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253274 · Cited by 281
A tool for functional brain imaging with lifespan compliance
Hill, R. M., Boto, E., Holmes, N., Hartley, C., Seedat, Z. A., Leggett, J., Roberts, G., Shah, V., Tierney, T. M., Woolrich, M. W., et al. (2019) · Nature Communications · doi:10.1038/s41467-019-12486-x · Cited by 180
Metadata
- Authors
- Bentley, J. L.
- Venue
- Communications of the ACM
- Published
- 1980-04
- Volume
- 23
- Issue
- 4
- Pages
- 214-229
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2128703518
- Cited by
- 672
- References
- 15
- FWCI
- 14.91
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.