The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Making data structures persistent
Open accessOverview
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
Data Structures and Network Algorithms
Tarjan, R. E. (1983) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970265 · Cited by 2,057
Self-citationAmortized Computational Complexity
Tarjan, R. E. (1985) · SIAM Journal on Algebraic Discrete Methods · doi:10.1137/0606031 · Cited by 520
Self-citationPlanar point location using persistent search trees
Sarnak, N., & Tarjan, R. E. (1986) · Communications of the ACM · doi:10.1145/6138.6151 · Cited by 482
Self-citationBinary Search Trees of Bounded Balance
Nievergelt, J., & Reingold, E. M. (1973) · SIAM Journal on Computing · doi:10.1137/0202005 · Cited by 266
A new data structure for representing sorted lists
Huddleston, S., & Mehlhorn, K. (1982) · Acta Informatica · doi:10.1007/bf00288968 · Cited by 187
Real-time queue operations in pure LISP
Hood, R. T., & Melville, R. (1981) · Information Processing Letters · doi:10.1016/0020-0190(81)90030-2 · Cited by 105
Cited by
The Foundations for Provenance on the Web
Moreau, L. (2010) · Foundations and Trends® in Web Science · doi:10.1561/1800000010 · Cited by 168
Metadata
- Authors
- Driscoll, J. R., Sarnak, N., Sleator, D. D., & Tarjan, R. E.
- Venue
- Journal of Computer and System Sciences
- Publisher
- Elsevier BV
- Published
- 1989-02
- Volume
- 38
- Issue
- 1
- Pages
- 86-124
- ISSN
- 0022-0000 (ISSN-L)
- OpenAlex
- W4213048098
- Cited by
- 428
- References
- 6
- FWCI
- 8.22
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Making data structures persistent. https://app.cochat.ai/papers/10.1016/0022-0000(89)90034-2
- The paper
- Driscoll, J. R., Sarnak, N., Sleator, D. D., & Tarjan, R. E. (1989). Making data structures persistent. Journal of Computer and System Sciences. https://doi.org/10.1016/0022-0000(89)90034-2
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.