On the public citation graph
Analysis of grid file algorithms
0 signed · 49 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-3-0348-4108-5openalex-snapshot
Handbuch der Laplace-Transformation
inferredcites →https://doi.org/10.1007/978-3-0348-6984-3openalex-snapshot
Handbuch der Laplace-Transformation
inferredcites →https://doi.org/10.1007/978-3-642-82456-2_16openalex-snapshot
Some Uses of the Mellin Integral Transform in the Analysis of Algorithms
inferredcites →https://doi.org/10.1007/bf00264279openalex-snapshot
On the performance evaluation of extendible hashing and trie searching
inferredcites →https://doi.org/10.1007/bf01934393openalex-snapshot
The extendible cell method for closest point problems
inferredcites →https://doi.org/10.1007/bf01934457openalex-snapshot
Interpolation-based index maintenance
inferredcites →https://doi.org/10.1007/bf01944474openalex-snapshot
Partial-match retrieval for dynamic files
inferredcites →https://doi.org/10.1007/bf02247933openalex-snapshot
A storage scheme for extendible arrays
inferredcites →https://doi.org/10.1016/0016-0032(58)90688-4openalex-snapshot
An introduction to probability theory and its applications
inferredcites →https://doi.org/10.1016/0020-0190(80)90008-3openalex-snapshot
A note on the analysis of extendible hashing
inferredcites →https://doi.org/10.1016/0020-0190(81)90033-8openalex-snapshot
On the average height of trees in digital search and dynamic hashing
inferredcites →https://doi.org/10.1109/sfcs.1983.79openalex-snapshot
Tree structures for partial match retrieval
inferredcites →https://doi.org/10.1109/tse.1982.236022openalex-snapshot
Analysis of Extendible Hashing
inferredcites →https://doi.org/10.1145/320083.320092openalex-snapshot
Extendible hashing—a fast access method for dynamic files
inferredcites →https://doi.org/10.1145/348.318584openalex-snapshot
Designing a Portable Natural Language Database Query System
inferredcites →https://doi.org/10.2307/2005805openalex-snapshot
Applied and Computational Complex Analysis
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-55488-2_29openalex-snapshot
Spatial access structures for geometric databases
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-7091-2704-9_16openalex-snapshot
A Brief Tutorial Introduction to Data Structures for Geometric Databases
inferred← citeshttps://doi.org/10.1007/bf01936137openalex-snapshot
Implementation of the grid file: Design concepts and experience
inferred← citeshttps://doi.org/10.1007/s00778-006-0022-1openalex-snapshot
Hierarchical clustering for OLAP: the CUBE File approach
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/0169-023x(90)90001-topenalex-snapshot
Heuristics and multi-dimensional physical database design: An experimental KBS
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00002-eopenalex-snapshot
Mellin transforms and asymptotics: Harmonic sums
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50014-xopenalex-snapshot
Average-Case Analysis of Algorithms and Data Structures
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.cosrev.2026.100904openalex-snapshot
The analysis of partial match queries in random multidimensional trees: A selected survey
inferred← citeshttps://doi.org/10.1109/32.9056openalex-snapshot
Algorithms for multidimensional partitioning of static files
inferred← citeshttps://doi.org/10.1109/cmpsac.1989.65095openalex-snapshot
A partitioning method for grid file directories
inferred← citeshttps://doi.org/10.1109/icde.1988.105439openalex-snapshot
PLOP-hashing: A grid file without directory
inferred← citeshttps://doi.org/10.1109/icde.1998.655799openalex-snapshot
The LSD/sup h/-tree: an access structure for feature vectors
inferred← citeshttps://doi.org/10.1109/icpr.1996.546732openalex-snapshot
Grid-clustering: an efficient hierarchical clustering method for very large data sets
inferred← citeshttps://doi.org/10.1145/1363189.1363196openalex-snapshot
In-memory grid files on graphics processors
inferred← citeshttps://doi.org/10.1145/192309.192313openalex-snapshot
Data structures for dynamic queries
inferred← citeshttps://doi.org/10.1145/280277.280279openalex-snapshot
Multidimensional access methods
inferred← citeshttps://doi.org/10.1145/38713.38744openalex-snapshot
A population analysis for hierarchical data structures
inferred← citeshttps://doi.org/10.1145/38714.38744openalex-snapshot
A population analysis for hierarchical data structures
inferred← citeshttps://doi.org/10.1145/50020.50021openalex-snapshot
Hierarchical representations of collections of small rectangles
inferred← citeshttps://doi.org/10.1145/6012.6015openalex-snapshot
Balanced multidimensional extendible hash tree
inferred← citeshttps://doi.org/10.3929/ethz-a-004126124openalex-snapshot
Similarity search in high-dimensional vector spaces
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.