On the public citation graph

Maintaining range trees in secondary memory

https://doi.org/10.1007/bf00289019
0 signed · 17 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/bf00289018openalex-snapshot
Maintaining range trees in secondary memory
inferredcites →https://doi.org/10.1016/0020-0190(79)90117-0openalex-snapshot
Decomposable searching problems
inferredcites →https://doi.org/10.1109/sfcs.1978.1openalex-snapshot
A data structure for orthogonal range queries
inferredcites →https://doi.org/10.1145/3828.3839openalex-snapshot
Adding range restriction capability to dynamic data structures

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.0012openalex-snapshot
Applications of Range Query Theory to Relational Data Base Join and Selection Operations
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_78openalex-snapshot
Topology B-trees and their applications
inferred← citeshttps://doi.org/10.1007/3-540-63818-0_8openalex-snapshot
External-memory algorithms with applications in GIS
inferred← citeshttps://doi.org/10.1007/bf00289018openalex-snapshot
Maintaining range trees in secondary memory
inferred← citeshttps://doi.org/10.1007/bfb0035830openalex-snapshot
Maintaining range trees in secondary memory
inferred← citeshttps://doi.org/10.1109/5.163409openalex-snapshot
Dynamic algorithms in computational geometry
inferred← citeshttps://doi.org/10.1145/153850.153884openalex-snapshot
Indexing for data models with constraints and classes (extended abstract)
inferred← citeshttps://doi.org/10.1145/182591.182595openalex-snapshot
Path caching (extended abstract)
inferred← citeshttps://doi.org/10.1145/223784.223809openalex-snapshot
OODB indexing by class-division
inferred← citeshttps://doi.org/10.1145/263661.263688openalex-snapshot
On the analysis of indexing schemes
inferred← citeshttps://doi.org/10.1145/280277.280279openalex-snapshot
Multidimensional access methods
inferred← citeshttps://doi.org/10.1145/505241.505244openalex-snapshot
On a model of indexability and its bounds for range queries
inferred← citeshttps://doi.org/10.1145/568271.223809openalex-snapshot
OODB indexing by class-division
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.