The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Symmetric binary B-Trees: Data structure and maintenance algorithms
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 16,320
Binary Search Trees of Bounded Balance
Nievergelt, J., & Reingold, E. M. (1973) · SIAM Journal on Computing · doi:10.1137/0202005 · Cited by 266
Cited by
Comer, D. (1979) · ACM Computing Surveys · doi:10.1145/356770.356776 · Cited by 1,859
Self-adjusting binary search trees
Sleator, D. D., & Tarjan, R. E. (1985) · Journal of the ACM · doi:10.1145/3828.3835 · Cited by 1,228
The Case for Learned Index Structures
Kraska, T., Beutel, A., Chi, E. H., Dean, J., & Polyzotis, N. (2018) · Proceedings of the 2018 International Conference on Management of Data · doi:10.1145/3183713.3196909 · Cited by 956
A dichromatic framework for balanced trees
Guibas, L. J., & Sedgewick, R. (1978) · 19th Annual Symposium on Foundations of Computer Science (sfcs 1978) · doi:10.1109/sfcs.1978.3 · Cited by 661
Amortized Computational Complexity
Tarjan, R. E. (1985) · SIAM Journal on Algebraic Discrete Methods · doi:10.1137/0606031 · Cited by 520
Metadata
- Authors
- Bayer, R.
- Venue
- Acta Informatica
- Published
- 1972
- Volume
- 1
- Issue
- 4
- Pages
- 290-306
- ISSN
- 0001-5903 (ISSN-L)
- 1432-0525
- OpenAlex
- W1972027649
- Cited by
- 495
- References
- 2
- FWCI
- 1.59
- Type
- journal article
- Language
- en
- Open access
- closed
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.