On the public citation graph
Lower Bounds on Locality Sensitive Hashing
0 signed · 50 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/bf02773611openalex-snapshot
Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality
inferredcites →https://doi.org/10.5802/aif.357openalex-snapshot
Étude des coefficients de Fourier des fonctions de L p ( G )
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-84245-1_27openalex-snapshot
Lower Bounds on Lattice Sieving and Information Set Decoding
inferred← citeshttps://doi.org/10.1007/978-3-031-15982-4_16openalex-snapshot
Nearly Optimal Property Preserving Hashing
inferred← citeshttps://doi.org/10.1007/s00453-020-00727-1openalex-snapshot
Explicit Correlation Amplifiers for Finding Outlier Correlations in Deterministic Subquadratic Time
inferred← citeshttps://doi.org/10.1007/s00493-019-4113-1openalex-snapshot
On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic
inferred← citeshttps://doi.org/10.1007/s11063-023-11251-yopenalex-snapshot
Mixture of Experts Residual Learning for Hamming Hashing
inferred← citeshttps://doi.org/10.1007/s11859-018-1306-1openalex-snapshot
Privacy Preserving Query over Encrypted Multidimensional Massive Data in Cloud Storage
inferred← citeshttps://doi.org/10.1016/j.ipl.2018.03.018openalex-snapshot
Why locality sensitive hashing works: A practical perspective
inferred← citeshttps://doi.org/10.1109/allerton.2009.5394931openalex-snapshot
Universal capacity of channels with given rate-distortion in absence of common randomness, and failure of universal source-channel separation
inferred← citeshttps://doi.org/10.1109/focs.2017.12openalex-snapshot
Distributed PCP Theorems for Hardness of Approximation in P
inferred← citeshttps://doi.org/10.1109/tc.2015.2401011openalex-snapshot
Multi-Granularity Locality-Sensitive Bloom Filter
inferred← citeshttps://doi.org/10.1109/tit.2010.2050814openalex-snapshot
Bucketing Coding and Information Theory for the Statistical High-Dimensional Nearest-Neighbor Problem
inferred← citeshttps://doi.org/10.1109/tpami.2017.2699960openalex-snapshot
A Survey on Learning to Hash
inferred← citeshttps://doi.org/10.1137/1.9781611973105.57openalex-snapshot
Euclidean Spanners in High Dimensions
inferred← citeshttps://doi.org/10.1137/1.9781611974782.3openalex-snapshot
A Framework for Similarity Search with Space-Time Tradeoffs using Locality-Sensitive Filtering
inferred← citeshttps://doi.org/10.1137/17m1127752openalex-snapshot
On the Distortion of Locality Sensitive Hashing
inferred← citeshttps://doi.org/10.1145/2578221openalex-snapshot
Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny)
inferred← citeshttps://doi.org/10.1145/2746539.2746553openalex-snapshot
Optimal Data-Dependent Hashing for Approximate Near Neighbors
inferred← citeshttps://doi.org/10.1145/2746539.2746595openalex-snapshot
A Directed Isoperimetric Inequality with application to Bregman Near Neighbor Lower Bounds
inferred← citeshttps://doi.org/10.1145/3055399.3055443openalex-snapshot
Set similarity search beyond MinHash
inferred← citeshttps://doi.org/10.1145/3174804openalex-snapshot
A Faster Subquadratic Algorithm for Finding Outlier Correlations
inferred← citeshttps://doi.org/10.1145/3188745.3188916openalex-snapshot
Hardness of approximate nearest neighbor search
inferred← citeshttps://doi.org/10.1145/3461777openalex-snapshot
Optimal Las Vegas Approximate Near Neighbors in ℓ p
inferred← citeshttps://doi.org/10.1371/journal.pone.0188702openalex-snapshot
Real-time community detection in full social networks on a laptop
inferred← citeshttps://doi.org/10.14778/3368289.3368303openalex-snapshot
Return of the Lernaean Hydra
inferred← citeshttps://doi.org/10.1631/jzus.cide1304openalex-snapshot
High-dimensional indexing technologies for large scale content-based image retrieval: a review
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.3390/info7010017openalex-snapshot
Nearest Neighbor Search in the Metric Space of a Complex Network for Community Detection
inferred← citeshttps://doi.org/10.4230/lipics.cpm.2023.20openalex-snapshot
Differentially Private High-Dimensional Approximate Range Counting, Revisited
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2019.17openalex-snapshot
On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic
inferred← citeshttps://doi.org/10.4230/lipics.socg.2016.9openalex-snapshot
Tight Lower Bounds for Data-Dependent Locality-Sensitive Hashing
inferred← citeshttps://doi.org/10.48550/arxiv.1509.02897openalex-snapshot
Practical and Optimal LSH for Angular Distance
inferred← citeshttps://doi.org/10.48550/arxiv.1601.03958openalex-snapshot
Real-Time Community Detection in Large Social Networks on a Laptop
inferred← citeshttps://doi.org/10.48550/arxiv.1605.02701openalex-snapshot
Lower Bounds on Time-Space Trade-Offs for Approximate Near Neighbors
inferred← citeshttps://doi.org/10.48550/arxiv.1610.09027openalex-snapshot
Scaling Memory-Augmented Neural Networks with Sparse Reads and Writes
inferred← citeshttps://doi.org/10.48550/arxiv.1612.07405openalex-snapshot
Practical linear-space Approximate Near Neighbors in high dimension
inferred← citeshttps://doi.org/10.48550/arxiv.1612.07710openalex-snapshot
Set Similarity Search Beyond MinHash
inferred← citeshttps://doi.org/10.48550/arxiv.1705.03933openalex-snapshot
An Improved Video Analysis using Context based Extension of LSH
inferred← citeshttps://doi.org/10.48550/arxiv.1807.07527openalex-snapshot
Optimal Las Vegas Approximate Near Neighbors in $\ell_p$
inferred← citeshttps://doi.org/10.48550/arxiv.1906.09430openalex-snapshot
Algorithms for Similarity Search and Pseudorandomness
inferred← citeshttps://doi.org/10.48550/arxiv.2006.11459openalex-snapshot
Return of the Lernaean Hydra: Experimental Evaluation of Data Series Approximate Similarity Search
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.