On the public citation graph
Proximity on a grid
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.
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.1016/0020-0190(79)90117-0openalex-snapshot
Decomposable searching problems
inferredcites →https://doi.org/10.1016/0020-0190(81)90093-4openalex-snapshot
Worst-case optimal insertion and deletion methods for decomposable searching problems
inferredcites →https://doi.org/10.1016/0020-0190(83)90045-5openalex-snapshot
On computing all north-east nearest neighbors in the L1 metric
inferredcites →https://doi.org/10.1016/0020-0190(83)90075-3openalex-snapshot
Log-logarithmic worst-case range queries are possible in space Θ(N)
inferredcites →https://doi.org/10.1016/0196-6774(80)90015-2openalex-snapshot
Decomposable searching problems I. Static-to-dynamic transformation
inferredcites →https://doi.org/10.1109/sfcs.1977.6openalex-snapshot
Applications of a planar separator theorem
inferredcites →https://doi.org/10.1137/0209017openalex-snapshot
Voronoui Diagrams in $L_1 (L_\infty )$ Metrics with 2-Dimensional Storage Applications
inferredcites →https://doi.org/10.1137/0212002openalex-snapshot
Optimal Search in Planar Subdivisions
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-48481-7_31openalex-snapshot
Geometric Searching over the Rationals
inferred← citeshttps://doi.org/10.1007/3-540-60159-7_14openalex-snapshot
Implementation of the ROSE algebra: Efficient algorithms for realm-based spatial data types
inferred← citeshttps://doi.org/10.1007/978-3-642-83539-1_5openalex-snapshot
Computational geometry on a grid an overview
inferred← citeshttps://doi.org/10.1007/s00453-001-0013-yopenalex-snapshot
Efficient Regular Data Structures and Algorithms for Dilation, Location, and Proximity Problems
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90188-3openalex-snapshot
Normalized divide-and-conquer: A scaling technique for solving multi-dimensional problems
inferred← citeshttps://doi.org/10.1016/0196-6774(88)90041-7openalex-snapshot
Efficient data structures for range searching on a grid
inferred← citeshttps://doi.org/10.1109/sffcs.1999.814588openalex-snapshot
Efficient regular data structures and algorithms for location and proximity problems
inferred← citeshttps://doi.org/10.1137/s0097539797322425openalex-snapshot
Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree
inferred← citeshttps://doi.org/10.2312/eggh/eggh87/003-019openalex-snapshot
New Algorithms for Computer Graphics
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.