On the public citation graph

Dynamic k-dimensional multiway search under time-varying access frequencies

https://doi.org/10.1007/bfb0017305
0 signed · 18 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-08342-1_25openalex-snapshot
Dynamic Binary Search
inferredcites →https://doi.org/10.1007/978-3-642-67838-7_35openalex-snapshot
Multidimensional B-tree: An efficient dynamic file structure for exact match queries
inferredcites →https://doi.org/10.1007/bf00264289openalex-snapshot
Optimum binary search trees
inferredcites →https://doi.org/10.1007/bf00288540openalex-snapshot
Optimum multiway search trees
inferredcites →https://doi.org/10.1109/sfcs.1980.15openalex-snapshot
Biased 2-3 trees
inferredcites →https://doi.org/10.1145/322203.322205openalex-snapshot
Codes: Unequal Probabilities, Unequal Letter Cost
inferredcites →https://doi.org/10.22028/d291-26084openalex-snapshot
Arbitrary weight changes in dynamic trees

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.1996.0025openalex-snapshot
Onk-Dimensional Balanced Binary Trees
inferred← citeshttps://doi.org/10.1007/3-540-10856-4_108openalex-snapshot
Weighted multidimensional B-trees used as nearly optimal dynamic dictionaries
inferred← citeshttps://doi.org/10.1007/978-3-642-71071-1_11openalex-snapshot
Bibliography on quadtrees and related hierarchical data structures
inferred← citeshttps://doi.org/10.1007/bf01188717openalex-snapshot
External segment trees
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90069-2openalex-snapshot
An average-case analysis of MAT and inverted file
inferred← citeshttps://doi.org/10.1016/s0065-2458(08)60257-0openalex-snapshot
Multidimensional Data Structures: Review and Outlook
inferred← citeshttps://doi.org/10.1109/12.30849openalex-snapshot
Multidimensional balanced binary trees
inferred← citeshttps://doi.org/10.1109/tc.1984.1676438openalex-snapshot
Multidimensional Height-Balanced Trees
inferred← citeshttps://doi.org/10.1137/0214041openalex-snapshot
Biased Search Trees
inferred← citeshttps://doi.org/10.1137/0216035openalex-snapshot
Weighted Leaf AVL-Trees
inferred← citeshttps://doi.org/10.1145/101306.101308openalex-snapshot
A compendium of key search references
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.