On the public citation graph

Robust balancing in B-trees

https://doi.org/10.1007/bfb0017315
0 signed · 22 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/3-540-10291-4_8openalex-snapshot
A new data structure for representing sorted lists
inferredcites →https://doi.org/10.1007/bf00263762openalex-snapshot
Concurrency of operations on B-trees
inferredcites →https://doi.org/10.1007/bf00288683openalex-snapshot
Organization and maintenance of large ordered indexes
inferredcites →https://doi.org/10.1007/bf00288968openalex-snapshot
A new data structure for representing sorted lists
inferredcites →https://doi.org/10.1007/bfb0017315openalex-snapshot
Robust balancing in B-trees
inferredcites →https://doi.org/10.1016/0020-0190(81)90101-0openalex-snapshot
Hysterical B-trees
inferredcites →https://doi.org/10.1137/0209045openalex-snapshot
Design and Analysis of a Data Structure for Representing Sorted Lists

What points at this work

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

inferred← citeshttps://doi.org/10.1002/j.1538-7305.1983.tb03469.xopenalex-snapshot
Two New Kinds of Biased Search Trees
inferred← citeshttps://doi.org/10.1007/bf00288968openalex-snapshot
A new data structure for representing sorted lists
inferred← citeshttps://doi.org/10.1007/s10472-013-9387-1openalex-snapshot
Interval-based temporal functional dependencies: specification and verification
inferred← citeshttps://doi.org/10.1016/0020-0190(83)90099-6openalex-snapshot
Updating a balanced search tree in O(1) rotations
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.06.027openalex-snapshot
Fully persistent B-trees
inferred← citeshttps://doi.org/10.1109/5.163409openalex-snapshot
Dynamic algorithms in computational geometry
inferred← citeshttps://doi.org/10.1145/101306.101308openalex-snapshot
A compendium of key search references
inferred← citeshttps://doi.org/10.1145/12130.12142openalex-snapshot
Making data structures persistent
inferred← citeshttps://doi.org/10.1145/2540068openalex-snapshot
Deletion without rebalancing in multiway search trees
inferred← citeshttps://doi.org/10.1145/2689412openalex-snapshot
Rank-Balanced Trees
inferred← citeshttps://doi.org/10.1145/3828.3835openalex-snapshot
Self-adjusting binary search trees
inferred← citeshttps://doi.org/10.1145/6138.6151openalex-snapshot
Planar point location using persistent search trees
inferred← citeshttps://doi.org/10.21248/gups.62802openalex-snapshot
Some results on the theory and practice of algorithms
inferred← citeshttps://doi.org/10.5555/2095116.2095167openalex-snapshot
Fully persistent B-trees
showing the first 14 of 15 · page through all 15
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.