On the public citation graph
Maintaining range trees in secondary memory
0 signed · 26 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/bf00289019openalex-snapshot
Maintaining range trees in secondary memory
inferredcites →https://doi.org/10.1007/bf01936137openalex-snapshot
Implementation of the grid file: Design concepts and experience
inferredcites →https://doi.org/10.1007/bfb0014927openalex-snapshot
The Design of Dynamic Data Structures
inferredcites →https://doi.org/10.1016/0020-0190(79)90117-0openalex-snapshot
Decomposable searching problems
inferredcites →https://doi.org/10.1016/0304-3975(80)90018-3openalex-snapshot
On the average number of rebalancing operations in weight-balanced trees
inferredcites →https://doi.org/10.1109/sfcs.1978.1openalex-snapshot
A data structure for orthogonal range queries
inferredcites →https://doi.org/10.1137/0202005openalex-snapshot
Binary Search Trees of Bounded Balance
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.1007/3-540-57568-5_273openalex-snapshot
Memory paging for connectivity and path problems in graphs
inferred← citeshttps://doi.org/10.1007/3-540-58325-4_218openalex-snapshot
Further computational geometry in secondary memory
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/bf00289019openalex-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.1016/0890-5401(89)90058-8openalex-snapshot
Maintaining multiple representations of dynamic data structures
inferred← citeshttps://doi.org/10.1109/5.163409openalex-snapshot
Dynamic algorithms in computational geometry
inferred← citeshttps://doi.org/10.1109/icact.2013.6710496openalex-snapshot
A multi level Grid File structure for mobile databases in GSM network
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/280277.280279openalex-snapshot
Multidimensional access methods
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.