On the public citation graph
The extendible cell method for closest point problems
0 signed · 56 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/978-94-011-7801-3openalex-snapshot
The Statistical Analysis of Series of Events
inferredcites →https://doi.org/10.1007/bf00263763openalex-snapshot
Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees
inferredcites →https://doi.org/10.1007/bf01932839openalex-snapshot
Order preserving extendible hashing and bucket tries
inferredcites →https://doi.org/10.1016/0020-0190(75)90034-4openalex-snapshot
Analysis of range searches in quad trees
inferredcites →https://doi.org/10.1016/0020-0190(82)90027-8openalex-snapshot
Multidimensional tries used for associative searching
inferredcites →https://doi.org/10.1109/sfcs.1979.47openalex-snapshot
Transforming static data structures to dynamic structures
inferredcites →https://doi.org/10.1111/j.1467-8659.1982.tb00032.xopenalex-snapshot
Hidden Lines using the EXCELL Method
inferredcites →https://doi.org/10.1145/320083.320092openalex-snapshot
Extendible hashing—a fast access method for dynamic files
inferredcites →https://doi.org/10.1145/355744.355745openalex-snapshot
An Algorithm for Finding Best Matches in Logarithmic Expected Time
inferredcites →https://doi.org/10.1145/355921.355927openalex-snapshot
Optimal Expected-Time Algorithms for Closest Point Problems
inferredcites →https://doi.org/10.1145/356789.356797openalex-snapshot
Data Structures for Range Searching
inferredcites →https://doi.org/10.1145/582353.582389openalex-snapshot
Efficient spatial access to a data base
inferredcites →https://doi.org/10.1145/582387.582389openalex-snapshot
Efficient spatial access to a data base
inferredcites →https://doi.org/10.2172/1447024openalex-snapshot
A Survey of Algorithms and Data Structures for Range Searching
inferredcites →https://doi.org/10.2307/2005383openalex-snapshot
The Art of Computer Programming, Vol. 3: Sorting and Searching
inferredcites →https://doi.org/10.2307/2986878openalex-snapshot
The Statistical Analysis of Series of Events.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/0471224634.ch14openalex-snapshot
Multidimensional Indexing Structures for Content‐Based Retrieval
inferred← citeshttps://doi.org/10.1002/int.20229openalex-snapshot
Design and implementation of index structures for fuzzy spatial databases
inferred← citeshttps://doi.org/10.1007/3-540-13883-8_87openalex-snapshot
Grid file algorithms: An analysis in the biased case
inferred← citeshttps://doi.org/10.1007/3-540-52208-5_23openalex-snapshot
Performance comparison of point and spatial access methods
inferred← citeshttps://doi.org/10.1007/3-540-63818-0_6openalex-snapshot
Spatial data structures: Concepts and design choices
inferred← citeshttps://doi.org/10.1007/978-3-642-77605-2_15openalex-snapshot
An Access Method Based Query Processor for Spatial Database Systems
inferred← citeshttps://doi.org/10.1007/bf01231602openalex-snapshot
An introduction to spatial database systems
inferred← citeshttps://doi.org/10.1007/bf01936137openalex-snapshot
Implementation of the grid file: Design concepts and experience
inferred← citeshttps://doi.org/10.1007/s10619-004-0234-6openalex-snapshot
The PN-Tree: A Parallel and Distributed Multidimensional Index
inferred← citeshttps://doi.org/10.1016/0010-4485(84)90004-6openalex-snapshot
Ray-casting and block model conversion using a spatial index
inferred← citeshttps://doi.org/10.1016/0020-0190(82)90123-5openalex-snapshot
Extendible hashing with overflow
inferred← citeshttps://doi.org/10.1016/0020-0255(89)90014-5openalex-snapshot
Multidimensional quantile hashing is very efficient for nonuniform distributions
inferred← citeshttps://doi.org/10.1016/0098-3004(95)00103-4openalex-snapshot
Block model conversion using binary space partitioning trees
inferred← citeshttps://doi.org/10.1016/0169-023x(90)90001-topenalex-snapshot
Heuristics and multi-dimensional physical database design: An experimental KBS
inferred← citeshttps://doi.org/10.1016/0306-4379(93)90041-xopenalex-snapshot
Optimal MMI file systems for orthogonal range retrieval
inferred← citeshttps://doi.org/10.1016/0734-189x(83)90041-5openalex-snapshot
Performance analysis of cell based geometric file organizations
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50018-8openalex-snapshot
Spatial Data Structures: Concepts and Design Choices
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.12.030openalex-snapshot
Quad-kd trees: A general framework for kd trees and quad trees
inferred← citeshttps://doi.org/10.1016/s0065-2458(08)60257-0openalex-snapshot
Multidimensional Data Structures: Review and Outlook
inferred← citeshttps://doi.org/10.1080/00207168408803430openalex-snapshot
The average performance analysis of a closest‐pair algorithm
inferred← citeshttps://doi.org/10.1109/54.43076openalex-snapshot
A data structure for fast region searches
inferred← citeshttps://doi.org/10.1109/fuzzy.2004.1375796openalex-snapshot
Index structures for flexible querying in fuzzy spatial databases
inferred← citeshttps://doi.org/10.1109/sfcs.1983.79openalex-snapshot
Tree structures for partial match retrieval
inferred← citeshttps://doi.org/10.1111/j.1467-8659.1982.tb00032.xopenalex-snapshot
Hidden Lines using the EXCELL Method
inferred← citeshttps://doi.org/10.1137/0219057openalex-snapshot
An Analysis of Random d -Dimensional Quad Trees
inferred← citeshttps://doi.org/10.1145/1363189.1363196openalex-snapshot
In-memory grid files on graphics processors
inferred← citeshttps://doi.org/10.1145/280277.280279openalex-snapshot
Multidimensional access methods
inferred← citeshttps://doi.org/10.1145/3318464.3380579openalex-snapshot
Learning Multi-Dimensional Indexes
inferred← citeshttps://doi.org/10.1145/5383.5453openalex-snapshot
Partial match retrieval of multidimensional data
inferred← citeshttps://doi.org/10.1145/6012.6015openalex-snapshot
Balanced multidimensional extendible hash tree
inferred← citeshttps://doi.org/10.25904/1912/931openalex-snapshot
Indexing Multidimensional Point Data
inferred← citeshttps://doi.org/10.3929/ethz-a-004126124openalex-snapshot
Similarity search in high-dimensional vector spaces
inferred← citeshttps://doi.org/10.5555/800263.809228openalex-snapshot
The EXCELL Method for Efficient Geometric Access to Data
inferred← citeshttps://doi.org/10.5821/dissertation-2117-93958openalex-snapshot
Design and Analysis of Multidimensional Data Structures
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.