On the public citation graph
Stratified balanced search trees
0 signed · 25 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf00288683openalex-snapshot
Organization and maintenance of large ordered indexes
inferredcites →https://doi.org/10.1007/bf00289509openalex-snapshot
Symmetric binary B-Trees: Data structure and maintenance algorithms
inferredcites →https://doi.org/10.1080/00207167808803145openalex-snapshot
Deletion in one-sided height balanced search trees
inferredcites →https://doi.org/10.1109/sfcs.1978.3openalex-snapshot
A dichromatic framework for balanced trees
inferredcites →https://doi.org/10.1145/359361.359366openalex-snapshot
Insertions and deletions in one-sided height-balanced trees
inferredcites →https://doi.org/10.1145/359511.359514openalex-snapshot
An optimal method for deletion in one-sided height-balanced trees
inferredcites →https://doi.org/10.2307/2005383openalex-snapshot
The Art of Computer Programming, Vol. 3: Sorting and Searching
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-36477-3_21openalex-snapshot
Single and Bulk Updates in Stratified Trees: An Amortized andWorst-Case Analysis
inferred← citeshttps://doi.org/10.1007/3-540-51859-2_10openalex-snapshot
Optimal bounds on the dictionary problem
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_83openalex-snapshot
How to update a balanced binary tree with a constant number of rotations
inferred← citeshttps://doi.org/10.1007/3-540-54945-5_71openalex-snapshot
Comparison-efficient and write-optimal searching and sorting
inferred← citeshttps://doi.org/10.1007/978-3-642-17641-8_32openalex-snapshot
Hierarchical Data Structures for Accessing Spatial Data
inferred← citeshttps://doi.org/10.1007/978-3-642-95486-3_29openalex-snapshot
Eol Grammars and Search Trees
inferred← citeshttps://doi.org/10.1007/bf00290147openalex-snapshot
Purely top-down updating algorithms for stratified search trees
inferred← citeshttps://doi.org/10.1007/bf00978710openalex-snapshot
Binary search trees with binary comparison cost
inferred← citeshttps://doi.org/10.1007/bf01237235openalex-snapshot
Binary search trees of almost optimal height
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80204-xopenalex-snapshot
Chapter 7 Fundamental algorithms and data structures
inferred← citeshttps://doi.org/10.1109/tse.1982.235251openalex-snapshot
A New Method for Concurrency in B-Trees
inferred← citeshttps://doi.org/10.1145/101306.101308openalex-snapshot
A compendium of key search references
inferred← citeshttps://doi.org/10.1145/318898.318925openalex-snapshot
Multikey retrieval from K-d trees and QUAD-trees
inferred← citeshttps://doi.org/10.1145/3857.3858openalex-snapshot
Height-balanced trees of order (β, γ, δ)
inferred← citeshttps://doi.org/10.1145/971699.318925openalex-snapshot
Multikey retrieval from K-d trees and QUAD-trees
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.