The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
A class of algorithms which require nonlinear time to maintain disjoint sets
Open accessOverview
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 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
Complexity of Computer Computations
(1972) · Springer eBooks · doi:10.1007/978-1-4684-2001-2 · Cited by 2,781
The Art of Computer Programming
Worlton, W. J. (1968) · Nuclear Science and Engineering · doi:10.13182/nse68-a19548 · Cited by 2,251
Efficiency of a Good But Not Linear Set Union Algorithm
Tarjan, R. E. (1975) · Journal of the ACM · doi:10.1145/321879.321884 · Cited by 1,403
Self-citationThe equivalence problem for regular expressions with squaring requires exponential space
Meyer, A. R., & Stockmeyer, L. J. (1972) · 13th Annual Symposium on Switching and Automata Theory (swat 1972) · doi:10.1109/swat.1972.29 · Cited by 596
THE COMPUTATIONAL COMPLEXITY OF ALGEBRAIC AND NUMERIC PROBLEMS.
Borodin, A., & Munro, I. (1975) · CERN Document Server (European Organization for Nuclear Research) · Cited by 396
SUPER-EXPONENTIAL COMPLEXITY OF PRESBURGER ARITHMETIC
Fischer, M. J., & Rabin, M. O. (1998) · Texts and Monographs in Symbolic Computation · doi:10.1007/978-3-7091-9459-1_5 · Cited by 331
An improved equivalence algorithm
Galler, B. A., & Fischer, M. J. (1964) · Communications of the ACM · doi:10.1145/364099.364331 · Cited by 312
On recognizing graph properties from adjacency matrices
Rivest, R. L., & Vuillemin, J. (1976) · Theoretical Computer Science · doi:10.1016/0304-3975(76)90053-0 · Cited by 177
Solving path problems on directed graphs.
Tarjan, R. E. (1975) · Defense Technical Information Center (DTIC) · Cited by 25
Self-citation
Cited by
Fibonacci heaps and their uses in improved network optimization algorithms
Fredman, M. L., & Tarjan, R. E. (1987) · Journal of the ACM · doi:10.1145/28869.28874 · Cited by 2,656
Self-citationFast Algorithms for Finding Nearest Common Ancestors
Harel, D., & Tarjan, R. E. (1984) · SIAM Journal on Computing · doi:10.1137/0213024 · Cited by 1,073
Self-citationAmortized Computational Complexity
Tarjan, R. E. (1985) · SIAM Journal on Algebraic Discrete Methods · doi:10.1137/0606031 · Cited by 520
Self-citationA 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
The string B-tree: a new data structure for string search in external memory and its applications
Ferragina, P., & Grossi, R. (1999) · Journal of the ACM · doi:10.1145/301970.301973 · Cited by 317
Metadata
- Authors
- Tarjan, R. E.
- Venue
- Journal of Computer and System Sciences
- Publisher
- Elsevier BV
- Published
- 1979-04
- Volume
- 18
- Issue
- 2
- Pages
- 110-127
- ISSN
- 0022-0000 (ISSN-L)
- OpenAlex
- W1986261983
- Cited by
- 263
- References
- 10
- FWCI
- 2.45
- 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: A class of algorithms which require nonlinear time to maintain disjoint sets. https://app.cochat.ai/papers/10.1016/0022-0000(79)90042-4
- The paper
- Tarjan, R. E. (1979). A class of algorithms which require nonlinear time to maintain disjoint sets. Journal of Computer and System Sciences. https://doi.org/10.1016/0022-0000(79)90042-4
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.