On the public citation graph

Nearest Neighbor Queries in Metric Spaces

https://doi.org/10.1007/pl00009449
0 signed · 157 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf02187718openalex-snapshot
AnO(n logn) algorithm for the all-nearest-neighbors Problem
inferredcites →https://doi.org/10.1016/0020-0190(91)90074-ropenalex-snapshot
Satisfying general proximity / similarity queries with metric trees
inferredcites →https://doi.org/10.1016/0167-8655(82)90025-3openalex-snapshot
The nearest neighbor problem in an abstract metric space
inferredcites →https://doi.org/10.1109/sfcs.1983.16openalex-snapshot
Fast algorithms for the all nearest neighbors problem
inferredcites →https://doi.org/10.1137/0217052openalex-snapshot
A Randomized Algorithm for Closest-Point Queries
inferredcites →https://doi.org/10.1142/9789812831699_0005openalex-snapshot
RANDOMIZED GEOMETRIC ALGORITHMS
inferredcites →https://doi.org/10.1142/9789814355858_0004openalex-snapshot
RANDOMIZED GEOMETRIC ALGORITHMS
inferredcites →https://doi.org/10.1145/10515.10548openalex-snapshot
Deferred data structuring: Query-driven preprocessing for geometric search problems
inferredcites →https://doi.org/10.1184/r1/6603476openalex-snapshot
Analysis of n-Dimensional Quadtrees using the Hausdorff Fractal Dimension
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.1002/sam.11218openalex-snapshot
Dual‐tree fast exact max‐kernel search
inferred← citeshttps://doi.org/10.1007/11575832_14openalex-snapshot
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
inferred← citeshttps://doi.org/10.1007/11579427_41openalex-snapshot
Proximity Searching in High Dimensional Spaces with a Proximity Preserving Order
inferred← citeshttps://doi.org/10.1007/11764298_26openalex-snapshot
On the Least Cost for Proximity Searching in Metric Spaces
inferred← citeshttps://doi.org/10.1007/11764298_8openalex-snapshot
Practical Construction of k-Nearest Neighbor Graphs in Metric Spaces
inferred← citeshttps://doi.org/10.1007/3-540-44808-x_12openalex-snapshot
A Probabilistic Spell for the Curse of Dimensionality
inferred← citeshttps://doi.org/10.1007/3-540-45735-6_25openalex-snapshot
Probabilistic Proximity Searching Algorithms Based on Compact Partitions
inferred← citeshttps://doi.org/10.1007/3-540-48762-x_71openalex-snapshot
Efficient Image Retrieval through Vantage Objects
inferred← citeshttps://doi.org/10.1007/978-1-4614-2110-8_5openalex-snapshot
Similarity Search in Metric Spaces
inferred← citeshttps://doi.org/10.1007/978-3-031-24628-9_5openalex-snapshot
Nearest-Neighbor Methods: A Modern Perspective
inferred← citeshttps://doi.org/10.1007/978-3-032-09527-5_19openalex-snapshot
Graph Querying or Similarity Search? Both!
inferred← citeshttps://doi.org/10.1007/978-3-319-03578-9_10openalex-snapshot
Self-organizing Flows in Social Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-25087-8_7openalex-snapshot
Faster Dual-Tree Traversal for Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1007/978-3-319-68474-1_6openalex-snapshot
Local Intrinsic Dimensionality II: Multivariate Analysis and Distributional Support
inferred← citeshttps://doi.org/10.1007/978-3-319-98355-4_22openalex-snapshot
A Modern View on Stability of Approximation
inferred← citeshttps://doi.org/10.1007/978-3-540-27836-8_72openalex-snapshot
The Black-Box Complexity of Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_34openalex-snapshot
An Improved Algorithm Finding Nearest Neighbor Using Kd-trees
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_4openalex-snapshot
How to Complete a Doubling Metric
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_10openalex-snapshot
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
inferred← citeshttps://doi.org/10.1007/978-3-642-04128-0_33openalex-snapshot
Wireless Scheduling with Power Control
inferred← citeshttps://doi.org/10.1007/978-3-642-15775-2_7openalex-snapshot
Fast Approximation in Subspaces by Doubling Metric Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-642-27739-9_1552-1openalex-snapshot
Oblivious Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-39140-8_3openalex-snapshot
Efficient Regression in Metric Spaces via Approximate Lipschitz Extension
inferred← citeshttps://doi.org/10.1007/s00180-007-0090-8openalex-snapshot
Iterative Denoising
inferred← citeshttps://doi.org/10.1007/s00453-010-9397-xopenalex-snapshot
Making Doubling Metrics Geodesic
inferred← citeshttps://doi.org/10.1007/s00453-014-9885-5openalex-snapshot
Randomized Partition Trees for Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1007/s00454-003-2927-4openalex-snapshot
Nice Point Sets Can Have Nasty Delaunay Triangulations
inferred← citeshttps://doi.org/10.1007/s00454-004-1089-3openalex-snapshot
Dense Point Sets Have Sparse Delaunay Triangulations or ?... But Not Too Nasty?
inferred← citeshttps://doi.org/10.1007/s00454-008-9115-5openalex-snapshot
Small Hop-diameter Sparse Spanners for Doubling Metrics
inferred← citeshttps://doi.org/10.1007/s00454-011-9337-9openalex-snapshot
A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics
inferred← citeshttps://doi.org/10.1007/s00454-013-9513-1openalex-snapshot
Linear-Size Approximations to the Vietoris–Rips Filtration
inferred← citeshttps://doi.org/10.1007/s00454-017-9872-0openalex-snapshot
Packing and Covering with Balls on Busemann Surfaces
inferred← citeshttps://doi.org/10.1007/s10951-011-0227-zopenalex-snapshot
Online capacity maximization in wireless networks
inferred← citeshttps://doi.org/10.1007/s10994-022-06280-yopenalex-snapshot
A family of pairwise multi-marginal optimal transports that define a generalized metric
inferred← citeshttps://doi.org/10.1007/s11390-016-1692-9openalex-snapshot
Efficient Metric All-k-Nearest-Neighbor Search on Datasets Without Any Index
inferred← citeshttps://doi.org/10.1007/s41109-019-0219-zopenalex-snapshot
A family of tractable graph metrics
inferred← citeshttps://doi.org/10.1016/j.cagd.2008.04.005openalex-snapshot
Efficient distance computation in configuration space
inferred← citeshttps://doi.org/10.1016/j.comgeo.2008.10.005openalex-snapshot
Smoothed analysis of probabilistic roadmaps
inferred← citeshttps://doi.org/10.1016/j.comgeo.2019.01.008openalex-snapshot
Flip distance to some plane configurations
inferred← citeshttps://doi.org/10.1016/j.ins.2014.11.038openalex-snapshot
On efficient k-optimal-location-selection query processing in metric spaces
inferred← citeshttps://doi.org/10.1016/j.is.2013.10.006openalex-snapshot
Approximate nearest neighbor algorithm based on navigable small world graphs
inferred← citeshttps://doi.org/10.1016/j.is.2015.02.001openalex-snapshot
Near neighbor searching with K nearest references
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.jda.2008.09.014openalex-snapshot
Approximate similarity search: A multi-faceted problem
inferred← citeshttps://doi.org/10.1016/j.sigpro.2011.11.027openalex-snapshot
Approximate all nearest neighbor search for high dimensional entropy estimation for image registration
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.09.017openalex-snapshot
The black-box complexity of nearest-neighbor search
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.02.018openalex-snapshot
Self-organizing flows in social networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114054openalex-snapshot
The projector algorithm: A simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs
inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00344-7openalex-snapshot
Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces
inferred← citeshttps://doi.org/10.1016/s1570-8667(03)00067-4openalex-snapshot
Probabilistic proximity searching algorithms based on compact partitions
inferred← citeshttps://doi.org/10.1023/a:1011343115154openalex-snapshot
Fixed Queries Array: A Fast and Economical Data Structure for Proximity Searching
inferred← citeshttps://doi.org/10.1088/0004-637x/705/2/1237openalex-snapshot
TIME EVOLUTION OF VISCOUS CIRCUMSTELLAR DISKS DUE TO PHOTOEVAPORATION BY FAR-ULTRAVIOLET, EXTREME-ULTRAVIOLET, AND X-RAY RADIATION FROM THE CENTRAL STAR
inferred← citeshttps://doi.org/10.1109/ccece.2004.1347728openalex-snapshot
Analysis of distance based indexing methods for similarity search
inferred← citeshttps://doi.org/10.1109/focs.2018.00024openalex-snapshot
Hölder Homeomorphisms and Approximate Nearest Neighbors
inferred← citeshttps://doi.org/10.1109/focs.2018.00030openalex-snapshot
An Improved Bound for Weak Epsilon-Nets in the Plane
inferred← citeshttps://doi.org/10.1109/focs.2018.00082openalex-snapshot
Epsilon-Coresets for Clustering (with Outliers) in Doubling Metrics
inferred← citeshttps://doi.org/10.1109/icde.2005.66openalex-snapshot
Fast Approximate Similarity Search in Extremely High-Dimensional Data Sets
inferred← citeshttps://doi.org/10.1109/icde.2016.7498401openalex-snapshot
Metric all-k-nearest-neighbor search
inferred← citeshttps://doi.org/10.1109/icdmw.2012.94openalex-snapshot
Generalized Expansion Dimension
inferred← citeshttps://doi.org/10.1109/ipdps.2012.45openalex-snapshot
Accelerating Nearest Neighbor Search on Manycore Systems
inferred← citeshttps://doi.org/10.1109/sisap.2009.17openalex-snapshot
Analyzing Metric Space Indexes: What For?
inferred← citeshttps://doi.org/10.1109/sisap.2009.31openalex-snapshot
Combinatorial Framework for Similarity Search
inferred← citeshttps://doi.org/10.1109/sisap.2009.33openalex-snapshot
Approximate Direct and Reverse Nearest Neighbor Queries, and the k-nearest Neighbor Graph
inferred← citeshttps://doi.org/10.1109/tit.2017.2713820openalex-snapshot
Efficient Regression in Metric Spaces via Approximate Lipschitz Extension
inferred← citeshttps://doi.org/10.1109/tkde.2015.2453954openalex-snapshot
Metric All-k-Nearest-Neighbor Search
inferred← citeshttps://doi.org/10.1109/tkde.2016.2631599openalex-snapshot
Metric Similarity Joins Using MapReduce
inferred← citeshttps://doi.org/10.1109/tkde.2022.3231781openalex-snapshot
Cover Trees Revisited: Exploiting Unused Distance and Direction Information
inferred← citeshttps://doi.org/10.1109/tpami.2007.70815openalex-snapshot
Effective Proximity Retrieval by Ordering Permutations
inferred← citeshttps://doi.org/10.1109/tro.2006.886840openalex-snapshot
Improving Motion-Planning Algorithms by Efficient Nearest-Neighbor Searching
inferred← citeshttps://doi.org/10.1109/tsipn.2020.3022003openalex-snapshot
Massively Distributed Graph Distances
inferred← citeshttps://doi.org/10.1117/1.3156846openalex-snapshot
Competitive code-based fast palmprint identification using a set of cover trees
inferred← citeshttps://doi.org/10.1137/060673096openalex-snapshot
The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors
inferred← citeshttps://doi.org/10.1137/090749396openalex-snapshot
Approximating TSP on Metrics with Bounded Global Growth
inferred← citeshttps://doi.org/10.1137/1.9781611972771.17openalex-snapshot
Nonlinear Dimensionality Reduction using Approximate Nearest Neighbors
inferred← citeshttps://doi.org/10.1137/1.9781611972825.87openalex-snapshot
Nearest-Neighbor Search on a Time Budget via Max-Margin Trees
inferred← citeshttps://doi.org/10.1137/1.9781611972979.12openalex-snapshot
Smoothed Analysis of Probabilistic Roadmaps
inferred← citeshttps://doi.org/10.1137/1.9781611973075.22openalex-snapshot
A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics
inferred← citeshttps://doi.org/10.1137/1.9781611974782.10openalex-snapshot
Maximum Scatter TSP in Doubling Metrics
inferred← citeshttps://doi.org/10.1137/1.9781611977042.16openalex-snapshot
Parallel Nearest Neighbors in Low Dimensions with Batch Updates
inferred← citeshttps://doi.org/10.1137/130913328openalex-snapshot
The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme
inferred← citeshttps://doi.org/10.1137/130930984openalex-snapshot
New Doubling Spanners: Better and Simpler
inferred← citeshttps://doi.org/10.1137/s0097539704446281openalex-snapshot
Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
inferred← citeshttps://doi.org/10.1142/9781860943850_others05openalex-snapshot
PART V APPENDICES
inferred← citeshttps://doi.org/10.1145/1007352.1007399openalex-snapshot
Bypassing the embedding
inferred← citeshttps://doi.org/10.1145/1064092.1064117openalex-snapshot
Fast construction of nets in low dimensional metrics, and their applications
inferred← citeshttps://doi.org/10.1145/1132516.1132599openalex-snapshot
Searching dynamic point sets in spaces with bounded doubling dimension
inferred← citeshttps://doi.org/10.1145/1143844.1143857openalex-snapshot
Cover trees for nearest neighbor
inferred← citeshttps://doi.org/10.1145/1227161.1322337openalex-snapshot
Dynamic spatial approximation trees
inferred← citeshttps://doi.org/10.1145/1236246.1236270openalex-snapshot
C-DIST
inferred← citeshttps://doi.org/10.1145/1317425.1317431openalex-snapshot
An algorithm for fast, model-free tracking indoors
inferred← citeshttps://doi.org/10.1145/1347082.1347119openalex-snapshot
Ultra-low-dimensional embeddings for doubling metrics
inferred← citeshttps://doi.org/10.1145/1347082.1347158openalex-snapshot
Approximating TSP on metrics with bounded global growth
inferred← citeshttps://doi.org/10.1145/1498698.1564506openalex-snapshot
Speeding up spatial approximation search in metric spaces
inferred← citeshttps://doi.org/10.1145/1613676.1613677openalex-snapshot
Space-time tradeoffs for approximate nearest neighbor searching
inferred← citeshttps://doi.org/10.1145/1646353.1646379openalex-snapshot
Faster dimension reduction
inferred← citeshttps://doi.org/10.1145/1734213.1734215openalex-snapshot
Ultra-low-dimensional embeddings for doubling metrics
inferred← citeshttps://doi.org/10.1145/1810479.1810499openalex-snapshot
Online capacity maximization in wireless networks
inferred← citeshttps://doi.org/10.1145/2213977.2214038openalex-snapshot
The traveling salesman problem
inferred← citeshttps://doi.org/10.1145/2261250.2261286openalex-snapshot
Linear-size approximations to the vietoris-rips filtration
inferred← citeshttps://doi.org/10.1145/2390176.2390183openalex-snapshot
Wireless scheduling with power control
inferred← citeshttps://doi.org/10.1145/2488608.2488691openalex-snapshot
Optimal euclidean spanners
inferred← citeshttps://doi.org/10.1145/2591796.2591864openalex-snapshot
From hierarchical partitions to hierarchical covers
inferred← citeshttps://doi.org/10.1145/2660267.2660314openalex-snapshot
Oblivious Data Structures
inferred← citeshttps://doi.org/10.1145/276698.276876openalex-snapshot
Approximate nearest neighbors
inferred← citeshttps://doi.org/10.1145/2819008openalex-snapshot
Optimal Euclidean Spanners
inferred← citeshttps://doi.org/10.1145/3055399.3055418openalex-snapshot
Approximate near neighbors for general symmetric norms
inferred← citeshttps://doi.org/10.1145/3158232openalex-snapshot
Reducing Curse of Dimensionality
inferred← citeshttps://doi.org/10.1145/3188745.3188846openalex-snapshot
Data-dependent hashing via nonlinear spectral gaps
inferred← citeshttps://doi.org/10.1145/3378571openalex-snapshot
A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics
inferred← citeshttps://doi.org/10.1145/3555985openalex-snapshot
An Improved Bound for Weak Epsilon-nets in the Plane
inferred← citeshttps://doi.org/10.1145/3717823.3718214openalex-snapshot
Near-Optimal Dimension Reduction for Facility Location
inferred← citeshttps://doi.org/10.1145/378583.378636openalex-snapshot
Nice point sets can have nasty Delaunay triangulations
inferred← citeshttps://doi.org/10.1145/502807.502808openalex-snapshot
Searching in metric spaces
inferred← citeshttps://doi.org/10.1145/509907.510013openalex-snapshot
Finding nearest neighbors in growth-restricted metrics
inferred← citeshttps://doi.org/10.1145/640075.640110openalex-snapshot
Approximation of protein structure for fast similarity measures
inferred← citeshttps://doi.org/10.11606/d.45.2004.tde-20210729-134728openalex-snapshot
Índices para consultas por conteúdo em bancos de dados heterogêneos
inferred← citeshttps://doi.org/10.11606/t.55.2004.tde-20082015-105153openalex-snapshot
Recuperação de informação por similaridade utilizando técnicas inteligentes
inferred← citeshttps://doi.org/10.11606/t.55.2018.tde-31012018-101031openalex-snapshot
Modelos de custo e estatísticas para consultas por similaridade
inferred← citeshttps://doi.org/10.1162/evco_a_00340openalex-snapshot
Preliminary Analysis of Simple Novelty Search
inferred← citeshttps://doi.org/10.1186/s12859-018-2453-2openalex-snapshot
A nearest-neighbors network model for sequence data reveals new insight into genotype distribution of a pathogen
inferred← citeshttps://doi.org/10.13053/cys-17-4-2013-002openalex-snapshot
Uso eficiente de pivotes aplicado a la búsqueda aproximada en algoritmos rápidos sobre espacios métricos
inferred← citeshttps://doi.org/10.14778/3067421.3067426openalex-snapshot
Dimensional testing for reverse k -nearest neighbor search
inferred← citeshttps://doi.org/10.1609/aaai.v36i5.20404openalex-snapshot
Dimensionality and Coordination in Voting: The Distortion of STV
inferred← citeshttps://doi.org/10.17760/d20410362openalex-snapshot
Leveraging structural properties for large-scale optimization
inferred← citeshttps://doi.org/10.22215/etd/2005-07813openalex-snapshot
Well-separated pair decompositions for doubling metric spaces
inferred← citeshttps://doi.org/10.32473/flairs.v34i1.128753openalex-snapshot
Population-Based Novelty Searches Can Converge
inferred← citeshttps://doi.org/10.35537/10915/18377openalex-snapshot
Consultas sobre espacios métricos en paralelo
inferred← citeshttps://doi.org/10.48550/arxiv.0712.3331openalex-snapshot
How to Complete a Doubling Metric
inferred← citeshttps://doi.org/10.48550/arxiv.1011.4955openalex-snapshot
Reverse Nearest Neighbors Search in High Dimensions using Locality-Sensitive Hashing
inferred← citeshttps://doi.org/10.48550/arxiv.1203.6786openalex-snapshot
Linear-Size Approximations to the Vietoris-Rips Filtration
inferred← citeshttps://doi.org/10.48550/arxiv.1206.4674openalex-snapshot
Comparison-Based Learning with Rank Nets
inferred← citeshttps://doi.org/10.48550/arxiv.1207.1831openalex-snapshot
Optimal Euclidean spanners: really short, thin and lanky
inferred← citeshttps://doi.org/10.48550/arxiv.1212.1094openalex-snapshot
The geometric stability of Voronoi diagrams in normed spaces which are not uniformly convex
inferred← citeshttps://doi.org/10.48550/arxiv.1304.8135openalex-snapshot
From Hierarchical Partitions to Hierarchical Covers: Optimal Fault-Tolerant Spanners for Doubling Metrics
inferred← citeshttps://doi.org/10.48550/arxiv.1512.00442openalex-snapshot
Fast k-Nearest Neighbour Search via Dynamic Continuous Indexing
inferred← citeshttps://doi.org/10.48550/arxiv.1611.06222openalex-snapshot
Approximate Near Neighbors for General Symmetric Norms
inferred← citeshttps://doi.org/10.48550/arxiv.1703.00440openalex-snapshot
Fast k-Nearest Neighbour Search via Prioritized DCI
inferred← citeshttps://doi.org/10.48550/arxiv.1804.02530openalex-snapshot
$\varepsilon$-Coresets for Clustering (with Outliers) in Doubling Metrics
inferred← citeshttps://doi.org/10.48550/arxiv.1809.01308openalex-snapshot
Randomized Incremental Construction of Net-Trees
inferred← citeshttps://doi.org/10.48550/arxiv.1905.00791openalex-snapshot
Flip Distance to some Plane Configurations
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0110030openalex-snapshot
Dense point sets have sparse Delaunay triangulations
inferred← citeshttps://doi.org/10.5555/1109557.1109566openalex-snapshot
Small hop-diameter sparse spanners for doubling metrics
inferred← citeshttps://doi.org/10.5555/1496770.1496806openalex-snapshot
Combinatorial algorithms for nearest neighbors, near-duplicates and small-world design
inferred← citeshttps://doi.org/10.5555/1873601.1873623openalex-snapshot
A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics
inferred← citeshttps://doi.org/10.5555/545381.545397openalex-snapshot
Dense point sets have sparse Delaunay triangulations: or "…but not too nasty"
inferred← citeshttps://doi.org/10.5753/jidm.2010.1280openalex-snapshot
DAHC-tree: An Effective Index for Approximate Search in High-Dimensional Metric Spaces
inferred← citeshttps://doi.org/10.7551/mitpress/4908.003.0005openalex-snapshot
Nearest-Neighbor Searching and Metric Space Dimensions
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.