On the public citation graph
On Approximate Nearest Neighbors under l∞ Norm
0 signed · 58 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.1006/inco.1993.1057openalex-snapshot
Point Location in Arrangements of Hyperplanes
inferredcites →https://doi.org/10.1007/bf00962238openalex-snapshot
Efficient and effective Querying by Image Content
inferredcites →https://doi.org/10.1007/bf02761110openalex-snapshot
On the distortion required for embedding finite metric spaces into normed spaces
inferredcites →https://doi.org/10.1007/bf02773799openalex-snapshot
On embedding expanders into ℓ p spaces
inferredcites →https://doi.org/10.1007/bf02776078openalex-snapshot
On lipschitz embedding of finite metric spaces in Hilbert space
inferredcites →https://doi.org/10.1007/bfb0014927openalex-snapshot
The Design of Dynamic Data Structures
inferredcites →https://doi.org/10.1007/pl00009390openalex-snapshot
Approximate Nearest Neighbor Queries Revisited
inferredcites →https://doi.org/10.1016/0020-0190(93)90222-uopenalex-snapshot
Approximate closest-point queries in high dimensions
inferredcites →https://doi.org/10.1090/conm/026/737400openalex-snapshot
Extensions of Lipschitz mappings into a Hilbert space
inferredcites →https://doi.org/10.1090/conm/223openalex-snapshot
Advances in Discrete and Computational Geometry
inferredcites →https://doi.org/10.1109/sfcs.1997.646101openalex-snapshot
Deterministic superimposed coding with applications to pattern matching
inferredcites →https://doi.org/10.1109/sffcs.1999.814589openalex-snapshot
Approximate nearest neighbor algorithms for Hausdorff metrics via embeddings
inferredcites →https://doi.org/10.1137/0217052openalex-snapshot
A Randomized Algorithm for Closest-Point Queries
inferredcites →https://doi.org/10.1145/177424.177609openalex-snapshot
An algorithm for approximate closest-point queries
inferredcites →https://doi.org/10.1145/258533.258653openalex-snapshot
Two algorithms for nearest-neighbor search in high dimensions
inferredcites →https://doi.org/10.1145/263661.263688openalex-snapshot
On the analysis of indexing schemes
inferredcites →https://doi.org/10.1145/275487.275488openalex-snapshot
Fuzzy queries in multimedia database systems
inferredcites →https://doi.org/10.1145/276698.276877openalex-snapshot
Efficient search for approximate nearest neighbor in high dimensional spaces
inferredcites →https://doi.org/10.1145/293347.293348openalex-snapshot
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
inferredcites →https://doi.org/10.1145/301250.301330openalex-snapshot
Lower bounds for high dimensional nearest neighbor search and related problems
inferredcites →https://doi.org/10.1145/3618260openalex-snapshot
Proceedings of the 56th Annual ACM Symposium on Theory of Computing
inferredcites →https://doi.org/10.5555/314464.314652openalex-snapshot
An optimal algorithm for approximate nearest neighbor 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/978-3-030-92641-0_12openalex-snapshot
How to Find Ternary LWE Keys Using Locality Sensitive Hashing
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_48openalex-snapshot
Approximate Nearest Neighbor Search under Translation Invariant Hausdorff Distance
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_46openalex-snapshot
NNS Lower Bounds via Metric Expansion for l ∞ and EMD
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_86openalex-snapshot
Certificates in Data Structures
inferred← citeshttps://doi.org/10.1007/978-981-13-2712-4_2openalex-snapshot
Improved Algorithms for Properly Learning Mixture of Gaussians
inferred← citeshttps://doi.org/10.1007/s00454-019-00062-5openalex-snapshot
Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back
inferred← citeshttps://doi.org/10.1016/j.jcss.2004.04.006openalex-snapshot
Cell-probe lower bounds for the partial match problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.11.031openalex-snapshot
Near-neighbor preserving dimension reduction via coverings for doubling subsets of ℓ1
inferred← citeshttps://doi.org/10.1109/cvpr.2015.7299160openalex-snapshot
Approximate nearest neighbor fields in video
inferred← citeshttps://doi.org/10.1109/focs.2010.82openalex-snapshot
Lower Bounds on Near Neighbor Search via Metric Expansion
inferred← citeshttps://doi.org/10.1109/focs.2017.91openalex-snapshot
Optimal Las Vegas Locality Sensitive Data Structures
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.00065openalex-snapshot
Efficient Density Evaluation for Smooth Kernels
inferred← citeshttps://doi.org/10.1109/icip.2018.8451259openalex-snapshot
SRIANN: Sphere Ring Intersection for Approximate Nearest Neighbor Search in Videos
inferred← citeshttps://doi.org/10.1109/ita.2013.6502925openalex-snapshot
Signal reconstruction in linear mixing systems with different error metrics
inferred← citeshttps://doi.org/10.1109/tit.2014.2345260openalex-snapshot
Wiener Filters in Gaussian Mixture Signal Estimation With $\ell _\infty $ -Norm Error
inferred← citeshttps://doi.org/10.1137/09075336xopenalex-snapshot
Unifying the Landscape of Cell-Probe Lower Bounds
inferred← citeshttps://doi.org/10.1142/9789813272880_0182openalex-snapshot
APPROXIMATE NEAREST NEIGHBOR SEARCH IN HIGH DIMENSIONS
inferred← citeshttps://doi.org/10.1142/s0218195911003706openalex-snapshot
APPROXIMATE NEAREST NEIGHBOR SEARCH UNDER TRANSLATION INVARIANT HAUSDORFF DISTANCE
inferred← citeshttps://doi.org/10.1145/3055399.3055418openalex-snapshot
Approximate near neighbors for general symmetric norms
inferred← citeshttps://doi.org/10.1145/3188745.3188846openalex-snapshot
Data-dependent hashing via nonlinear spectral gaps
inferred← citeshttps://doi.org/10.1145/3274895.3274943openalex-snapshot
Multi-resolution sketches and locality sensitive hashing for fast trajectory processing
inferred← citeshttps://doi.org/10.1145/3375395.3387649openalex-snapshot
On the I/O Complexity of the k-Nearest Neighbors Problem
inferred← citeshttps://doi.org/10.1145/513400.513414openalex-snapshot
Approximate nearest neighbor algorithms for Frechet distance via product metrics
inferred← citeshttps://doi.org/10.1145/780542.780639openalex-snapshot
Cell-probe lower bounds for the partial match problem
inferred← citeshttps://doi.org/10.24033/ast.1189openalex-snapshot
Average distortion embeddings, nonlinear spectral gaps, and a metric John theorem
inferred← citeshttps://doi.org/10.48550/arxiv.1005.0418openalex-snapshot
Lower Bounds on Near Neighbor Search via Metric Expansion
inferred← citeshttps://doi.org/10.48550/arxiv.1010.3783openalex-snapshot
Unifying the Landscape of Cell-Probe Lower Bounds
inferred← citeshttps://doi.org/10.48550/arxiv.1405.4345openalex-snapshot
Wiener Filters in Gaussian Mixture Signal Estimation with Infinity-Norm Error
inferred← citeshttps://doi.org/10.48550/arxiv.1611.06222openalex-snapshot
Approximate Near Neighbors for General Symmetric Norms
inferred← citeshttps://doi.org/10.48550/arxiv.2002.04870openalex-snapshot
On the I/O complexity of the k-nearest neighbor problem
inferred← citeshttps://doi.org/10.48550/arxiv.2011.06135openalex-snapshot
Hardness of Approximate Nearest Neighbor Search under L-infinity
inferred← citeshttps://doi.org/10.48550/arxiv.2105.04712openalex-snapshot
Near Neighbor Search via Efficient Average Distortion Embeddings
inferred← citeshttps://doi.org/10.5555/1248547.1248588openalex-snapshot
New Algorithms for Efficient High-Dimensional Nonparametric Classification
inferred← citeshttps://doi.org/10.7551/mitpress/4908.003.0008openalex-snapshot
New Algorithms for Efficient High-Dimensional Nonparametric Classification
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.