On the public citation graph
Recursive Lists of Clusters: A Dynamic Data Structure for Range Queries in Metric Spaces
0 signed · 25 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/3-540-45735-6_23openalex-snapshot
Fully Dynamic Spatial Approximation Trees
inferredcites →https://doi.org/10.1007/3-540-58094-8_18openalex-snapshot
Proximity matching using fixed-queries trees
inferredcites →https://doi.org/10.1007/978-3-540-39984-1_28openalex-snapshot
Memory-Adaptative Dynamic Spatial Approximation Trees
inferredcites →https://doi.org/10.1007/978-3-642-16321-0_27openalex-snapshot
Extracting Powers and Periods in a String from Its Runs Structure
inferredcites →https://doi.org/10.1016/0167-8655(86)90013-9openalex-snapshot
An algorithm for finding nearest neighbours in (approximately) constant average time
inferredcites →https://doi.org/10.1016/j.patrec.2004.11.014openalex-snapshot
A compact space decomposition for effective metric indexing
inferredcites →https://doi.org/10.1023/a:1025026030880openalex-snapshot
D-Index: Distance Searching Index for Metric Data Sets
inferredcites →https://doi.org/10.1109/spire.2000.878182openalex-snapshot
An effective clustering algorithm to index high dimensional metric spaces
inferredcites →https://doi.org/10.1145/362003.362025openalex-snapshot
Some approaches to best-match file searching
inferredcites →https://doi.org/10.1145/584792.584831openalex-snapshot
How to improve the pruning ability of dynamic metric access methods
inferredcites →https://doi.org/10.5555/313559.313789openalex-snapshot
Data structures and algorithms for nearest neighbor search in general metric spaces
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-46994-7_1openalex-snapshot
Finding HSP Neighbors via an Exact, Hierarchical Approach
inferred← citeshttps://doi.org/10.1007/978-3-032-00718-6_9openalex-snapshot
BOLDSC: A New Dynamic, Secondary-Memory Metric Index
inferred← citeshttps://doi.org/10.1007/978-3-319-11988-5_9openalex-snapshot
Dynamic List of Clusters in Secondary Memory
inferred← citeshttps://doi.org/10.1007/s10489-009-0206-7openalex-snapshot
Integrating multi-objective genetic algorithm based clustering and data partitioning for skyline computation
inferred← citeshttps://doi.org/10.1016/j.is.2015.10.014openalex-snapshot
Faster proximity searching with the distal SAT
inferred← citeshttps://doi.org/10.1016/j.is.2016.03.009openalex-snapshot
New dynamic metric indices for secondary memory
inferred← citeshttps://doi.org/10.1016/j.is.2025.102565openalex-snapshot
Finding HSP neighbors via an exact, hierarchical approach
inferred← citeshttps://doi.org/10.1016/j.jda.2008.09.012openalex-snapshot
Solving similarity joins and range queries in metric spaces with the list of twin clusters
inferred← citeshttps://doi.org/10.1109/icdew.2008.4498353openalex-snapshot
List of twin clusters: a data structure for similarity joins in metric spaces
inferred← citeshttps://doi.org/10.1109/icime.2009.12openalex-snapshot
Similarity-based Retrieval in High Dimensional Data with Recursive Lists of Clusters: A Study Case with Natural Language Dictionaries
inferred← citeshttps://doi.org/10.1109/iscis.2007.4456857openalex-snapshot
Range queries in natural language dictionaries with recursive lists of clusters
inferred← citeshttps://doi.org/10.1109/sisap.2008.21openalex-snapshot
List of Twin Clusters: A Data Structure for Similarity Joins in Metric Spaces
inferred← citeshttps://doi.org/10.35537/10915/25904openalex-snapshot
Computer Science & Technology Series
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.