The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Decomposable searching problems
Open accessAbstract
Abstract : Although searching is one of the most important problems in computer science and many particular results are known for searching problems, there really is no satisfactory, 'theory of searching.' In this paper we propose a first step toward such a theory by defining the class of decomposable searching problems and them proving three theorems about problems in this class. These theorems are all of the form 'given a data structure D for a decomposable searching problem we can transform D into a new data structure D' for a related problem'. The correctness and complexity analysis of D are then used to establish the correctness and complexity of D'. We present transforms for converting a static structure into a dynamic structure, for adding 'range variables' to queries, and for making preprocessing/query time tradeoffs. These transforms have already been used to develop a number of best known 'theoretical' algorithms, and promise to be an important tool in software engineering. (Author)
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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 15,999
The Art of Computer Programming
Whitesides, G. E. (1970) · Nuclear Science and Engineering · doi:10.13182/nse70-a19705 · Cited by 6,008
The Art of Computer Programming: Volume 3: Sorting and Searching
Knuth, D. E. (1973) · Cited by 3,955
Multidimensional Searching Problems
Dobkin, D., & Lipton, R. J. (1976) · SIAM Journal on Computing · doi:10.1137/0205015 · Cited by 248
Partial-Match Retrieval Algorithms
Rivest, R. L. (1976) · SIAM Journal on Computing · doi:10.1137/0205003 · Cited by 244
Efficient worst-case data structures for range searching
Bentley, J. L., & Maurer, H. A. (1980) · Acta Informatica · doi:10.1007/bf00263991 · Cited by 179
Self-citationComplexity of Combinatorial Algorithms
Tarjan, R. E. (1978) · SIAM Review · doi:10.1137/1020067 · Cited by 54
Cited by
Data Structures for Range Searching
Bentley, J. L., & Friedman, J. H. (1979) · ACM Computing Surveys · doi:10.1145/356789.356797 · Cited by 622
Self-citationMultidimensional Binary Search Trees in Database Applications
Bentley, J. L. (1979) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1979.234200 · Cited by 410
Self-citationGeometric Approximation via Coresets
Agarwal, P. K., Har-Peled, S., & Varadarajan, K. R. (2005) · Combinatorial and Computational Geometry · doi:10.1017/9781009701259.002 · Cited by 256
On the Power of Multiple Anonymous Messages
Ghazi, B., Golowich, N., Kumar, R., Pagh, R., & Velingker, A. (2019) · arXiv · doi:10.48550/arxiv.1908.11358 · Cited by 26
Metadata
- Authors
- Bentley, J. L.
- Venue
- Information Processing Letters
- Publisher
- Elsevier BV
- Published
- 1979-06
- Volume
- 8
- Issue
- 5
- Pages
- 244-251
- ISSN
- 0020-0190 (ISSN-L)
- OpenAlex
- W2060978628
- Cited by
- 340
- References
- 7
- FWCI
- 16.66
- Type
- journal article
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Decomposable searching problems. https://app.cochat.ai/papers/10.1016/0020-0190(79)90117-0
- The paper
- Bentley, J. L. (1979). Decomposable searching problems. Information Processing Letters. https://doi.org/10.1016/0020-0190(79)90117-0
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.