The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
A dichromatic framework for balanced trees
Abstract
In this paper we present a uniform framework for the implementation and study of balanced tree algorithms. We show how to imbed in this framework the best known balanced tree techniques and then use the framework to develop new algorithms which perform the update and rebalancing in one pass, on the way down towards a leaf. We conclude with a study of performance issues and concurrent updating.
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
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
Symmetric binary B-Trees: Data structure and maintenance algorithms
Bayer, R. (1972) · Acta Informatica · doi:10.1007/bf00289509 · Cited by 495
Combinatorial algorithms: Theory and practice
Cooper, L. (1978) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(78)90043-3 · Cited by 220
Cited by
Linearizability: a correctness condition for concurrent objects
Herlihy, M. P., & Wing, J. M. (1990) · ACM Transactions on Programming Languages and Systems · doi:10.1145/78969.78972 · Cited by 3,176
Comer, D. (1979) · ACM Computing Surveys · doi:10.1145/356770.356776 · Cited by 1,859
Query evaluation techniques for large databases
Graefe, G. (1993) · ACM Computing Surveys · doi:10.1145/152610.152611 · Cited by 1,262
Purely Functional Data Structures
Okasaki, C. (1998) · Cambridge University Press eBooks · doi:10.1017/cbo9780511530104 · Cited by 625
Amortized Computational Complexity
Tarjan, R. E. (1985) · SIAM Journal on Algebraic Discrete Methods · doi:10.1137/0606031 · Cited by 520
Ambit: in-memory accelerator for bulk bitwise operations using commodity DRAM technology
Seshadri, V., Lee, D., Mullins, T., Hassan, H., Boroumand, A., Kim, J., Kozuch, M. A., Mutlu, O., Gibbons, P. B., & Mowry, T. C. (2017) · Proceedings of the 50th Annual IEEE/ACM International Symposium on Microarchitecture · doi:10.1145/3123939.3124544 · Cited by 434
The adaptive radix tree: ARTful indexing for main-memory databases
Leis, V., Kemper, A., & Neumann, T. (2013) · 2013 IEEE 29th International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2013.6544812 · Cited by 420
A system for algorithm animation
Brown, M. H., & Sedgewick, R. (1984) · Proceedings of the 11th annual conference on Computer graphics and interactive techniques · doi:10.1145/800031.808596 · Cited by 315
Self-citationSeidel, R., & Aragon, C. R. (1996) · Algorithmica · doi:10.1007/bf01940876 · Cited by 281
Buddy-RAM: Improving the Performance and Efficiency of Bulk Bitwise Operations Using DRAM
Seshadri, V., Lee, D., Mullins, T., Hassan, H., Boroumand, A., Kim, J., Kozuch, M. A., Mutlu, O., Gibbons, P. B., & Mowry, T. C. (2016) · arXiv · doi:10.48550/arxiv.1611.09988 · Cited by 54
Perceus: garbage free reference counting with reuse
Reinking, A., Xie, N., de Moura, L., & Leijen, D. (2021) · Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation · doi:10.1145/3453483.3454032 · Cited by 32
Metadata
- Authors
- Guibas, L. J., & Sedgewick, R.
- Venue
- 19th Annual Symposium on Foundations of Computer Science (sfcs 1978)
- Publisher
- IEEE
- Published
- 1978-10
- Pages
- 8-21
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W2021615496
- Cited by
- 661
- References
- 3
- FWCI
- 4.64
- Type
- conference paper
- 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.