The DOI matches its Crossref record.
Recursive Star-Tree Parallel Data Structure
Abstract
This paper introduces a novel parallel data structure called the recursive star-tree (denoted “${}^ * $-tree”). For its definition a generalization of the $ * $ functional is used (where for a function $f * f(n) = \min \{ {i|f^{(i)} (n) \leqslant 1} \}$ and $f^{(i)} $ is the ith iterate of f). Recursive ${}^ * $-trees are derived by using recursion in the spirit of the inverse Ackermann function. The recursive ${}^ * $-tree data structure leads to a new design paradigm for parallel algorithms. This paradigm allows for extremely fast parallel computations, specifically, $O(\alpha (n))$ time (where $\alpha (n)$ is the inverse of the Ackermann function), using an optimal number of processors on the (weakest) concurrent-read, concurrent-write parallel random-access machine (CRCW PRAM). These computations need only constant time, and use an optimal number of processors if the following nonstandard assumption about the model of parallel computation is added to the CRCW PRAM: an extremely small number of processors each can write simultaneously into different bits of the same word. Applications include finding lowest common ancestors in trees by a new algorithm that is considerably simpler than the known algorithms for the problem, restricted domain merging, parentheses matching, and a new parallel reducibility.
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
Cited by
Blossom V: a new implementation of a minimum cost perfect matching algorithm
Kolmogorov, V. (2009) · Mathematical Programming Computation · doi:10.1007/s12532-009-0002-8 · Cited by 414
Genesis and Gappa: processing, analyzing and visualizing phylogenetic (placement) data
Czech, L., Barbera, P., & Stamatakis, A. (2020) · Bioinformatics · doi:10.1093/bioinformatics/btaa070 · Cited by 371
Tensor product methods and entanglement optimization for ab initio quantum chemistry
Szalay, S., Pfeffer, M., Murg, V., Barcza, G., Verstraete, F., Schneider, R., & Legeza, Ö. (2015) · International Journal of Quantum Chemistry · doi:10.1002/qua.24898 · Cited by 314
External-memory graph algorithms
Chiang, Y., Goodrich, M. T., Grove, E. F., Tamassia, R., Vengroff, D. E., & Vitter, J. S. (1995) · KU ScholarWorks (University of Kansas) · doi:10.5555/313651.313681 · Cited by 275
Murg, V., Verstraete, F., Schneider, R., Nagy, P. R., & Legeza, O. (2015) · Journal of Chemical Theory and Computation · doi:10.1021/ct501187j · Cited by 97
Metadata
- Authors
- Berkman, O., & Vishkin, U.
- Venue
- SIAM Journal on Computing
- Published
- 1993-04
- Volume
- 22
- Issue
- 2
- Pages
- 221-242
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2092901467
- Cited by
- 186
- References
- 0
- FWCI
- 11.36
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Recursive Star-Tree Parallel Data Structure. https://app.cochat.ai/papers/10.1137/0222017
- The paper
- Berkman, O., & Vishkin, U. (1993). Recursive Star-Tree Parallel Data Structure. SIAM Journal on Computing. https://doi.org/10.1137/0222017
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.