On the public citation graph

Chromatic binary search trees

https://doi.org/10.1007/bf03036462
0 signed · 51 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf00289064openalex-snapshot
Concurrent search and insertion in 2?3 trees
inferredcites →https://doi.org/10.1007/bf00289509openalex-snapshot
Symmetric binary B-Trees: Data structure and maintenance algorithms
inferredcites →https://doi.org/10.1016/0020-0190(83)90099-6openalex-snapshot
Updating a balanced search tree in O(1) rotations
inferredcites →https://doi.org/10.1109/sfcs.1978.3openalex-snapshot
A dichromatic framework for balanced trees
inferredcites →https://doi.org/10.1109/tc.1980.1675680openalex-snapshot
Concurrent Search and Insertion in AVL Trees
inferredcites →https://doi.org/10.1137/0214021openalex-snapshot
Priority Search Trees
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1145/1270.318576openalex-snapshot
Concurrency control in a dynamic search structure
inferredcites →https://doi.org/10.1145/182.358442openalex-snapshot
On-the-fly optimization of data structures
inferredcites →https://doi.org/10.1145/28659.28677openalex-snapshot
Concurrency control in database structures with relaxed balance
inferredcites →https://doi.org/10.1145/320613.320618openalex-snapshot
Quintary trees
inferredcites →https://doi.org/10.1145/320613.320619openalex-snapshot
Concurrent manipulation of binary search trees
inferredcites →https://doi.org/10.1145/359642.359655openalex-snapshot
On-the-fly garbage collection
inferredcites →https://doi.org/10.1145/6138.6151openalex-snapshot
Planar point location using persistent search trees
inferredcites →https://doi.org/10.1145/6592.6599openalex-snapshot
Tree rebalancing in optimal time and space

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jcss.2000.1705openalex-snapshot
AVL Trees with Relaxed Balance
inferred← citeshttps://doi.org/10.1007/3-540-44634-6_38openalex-snapshot
Search Trees with Relaxed Balance and Near-Optimal Height
inferred← citeshttps://doi.org/10.1007/3-540-45446-2_17openalex-snapshot
Complexity of Layered Binary Search Trees with Relaxed Balance
inferred← citeshttps://doi.org/10.1007/3-540-46521-9_21openalex-snapshot
Group Updates for Bed-Black Trees
inferred← citeshttps://doi.org/10.1007/3-540-48318-7_23openalex-snapshot
The Performance of Concurrent Red-Black Tree Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-62592-5_72openalex-snapshot
Relaxed balanced red-black trees
inferred← citeshttps://doi.org/10.1007/978-1-4613-3394-4_13openalex-snapshot
Relaxed Balancing in Search Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-40047-6_25openalex-snapshot
A Contention-Friendly Binary Search Tree
inferred← citeshttps://doi.org/10.1007/bfb0002766openalex-snapshot
Concurrent rebalancing of AVL trees: A fine-grained approach
inferred← citeshttps://doi.org/10.1007/pl00013303openalex-snapshot
Relaxed balance for search trees with local rebalancing
inferred← citeshttps://doi.org/10.1007/s00236-002-0086-3openalex-snapshot
Relaxed red-black trees with group updates
inferred← citeshttps://doi.org/10.1007/s00236-019-00335-9openalex-snapshot
Red–black trees with constant update time
inferred← citeshttps://doi.org/10.1016/j.jpdc.2012.12.010openalex-snapshot
A concurrent red–black tree
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.07.007openalex-snapshot
The amortized analysis of a non-blocking chromatic tree
inferred← citeshttps://doi.org/10.1016/s0022-0000(03)00027-8openalex-snapshot
Relaxed multi-way trees with group updates
inferred← citeshttps://doi.org/10.1016/s0743-7315(02)00009-6openalex-snapshot
Fully dynamic distributed search trees can be balanced in time
inferred← citeshttps://doi.org/10.1051/ita/1997310302511openalex-snapshot
Skip trees, an alternative data structure to skip lists in a concurrent approach
inferred← citeshttps://doi.org/10.1080/00207169608804523openalex-snapshot
Relaxed avl trees, main-memory databases and concurrency
inferred← citeshttps://doi.org/10.1109/iscc.2008.4625595openalex-snapshot
Relaxed min-augmented range trees for the representation of dynamic IP router tables
inferred← citeshttps://doi.org/10.1109/sccc.1997.636933openalex-snapshot
A unified approach to concurrent and parallel algorithms on balanced data structures
inferred← citeshttps://doi.org/10.1109/sccc.1997.637081openalex-snapshot
Concurrent rebalancing on HyperRed-Black trees
inferred← citeshttps://doi.org/10.1142/s012905410100059xopenalex-snapshot
VARIANTS OF (A,B)-TREES WITH RELAXED BALANCE
inferred← citeshttps://doi.org/10.1142/s0129626416500158openalex-snapshot
A Fast Contention-Friendly Binary Search Tree
inferred← citeshttps://doi.org/10.1145/1835698.1835736openalex-snapshot
Non-blocking binary search trees
inferred← citeshttps://doi.org/10.1145/2555243.2555267openalex-snapshot
A general technique for non-blocking trees
inferred← citeshttps://doi.org/10.1145/2692916.2555267openalex-snapshot
A general technique for non-blocking trees
inferred← citeshttps://doi.org/10.1145/2903142openalex-snapshot
Deletion Without Rebalancing in Binary Search Trees
inferred← citeshttps://doi.org/10.1145/303976.304011openalex-snapshot
Group updates for relaxed height-balanced trees
inferred← citeshttps://doi.org/10.1145/3512769openalex-snapshot
Joinable Parallel Balanced Binary Trees
inferred← citeshttps://doi.org/10.1145/375551.375566openalex-snapshot
Relaxed multi-way trees with group updates
inferred← citeshttps://doi.org/10.1145/3774934.3786437openalex-snapshot
Concurrent Balanced Augmented Trees
inferred← citeshttps://doi.org/10.14293/s2199-1006.1.sor-.ppvowys.v1openalex-snapshot
Parallelize DSW Algorithm
inferred← citeshttps://doi.org/10.14778/3364324.3364334openalex-snapshot
On supporting efficient snapshot isolation for hybrid workloads with multi-versioned indexes
inferred← citeshttps://doi.org/10.4108/sis.1.3.e6openalex-snapshot
Concurrent Operations of O2-Tree on Shared Memory Multicore Architectures
inferred← citeshttps://doi.org/10.48550/arxiv.1712.05406openalex-snapshot
Techniques for Constructing Efficient Lock-free Data Structures
inferred← citeshttps://doi.org/10.70675/35c0180dzc462z4178z90cez1700a6ba85c5openalex-snapshot
Synchronization costs in parallel programs and concurrent data structures
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.