On the public citation graph
Hilbert Exclusion
0 signed · 42 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-55488-2_27openalex-snapshot
Monotonous Bisector* Trees — a tool for efficient partitioning of complex scenes of geometric objects
inferredcites →https://doi.org/10.1007/978-3-319-11988-5_6openalex-snapshot
Faster Proximity Searching with the Distal SAT
inferredcites →https://doi.org/10.1007/978-3-642-32153-5_15openalex-snapshot
A Multivariate Correlation Distance for Vector Spaces
inferredcites →https://doi.org/10.1007/978-3-642-41062-8_16openalex-snapshot
Evaluation of Jensen-Shannon Distance over Sparse Data
inferredcites →https://doi.org/10.1007/bf02517812openalex-snapshot
A new class of metric divergences on probability spaces and its applicability in statistics
inferredcites →https://doi.org/10.1007/s00013-013-0556-6openalex-snapshot
A characterisation of inner product spaces by the maximal circumradius of spheres
inferredcites →https://doi.org/10.1007/s007780200060openalex-snapshot
Searching in metric spaces by spatial approximation
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/j.is.2010.10.002openalex-snapshot
Metric Index: An efficient and scalable solution for precise and approximate similarity search
inferredcites →https://doi.org/10.1016/j.is.2015.10.014openalex-snapshot
Faster proximity searching with the distal SAT
inferredcites →https://doi.org/10.1090/s0002-9904-1933-05654-9openalex-snapshot
A note on the four-point property
inferredcites →https://doi.org/10.1109/18.850703openalex-snapshot
Some inequalities for information divergence and related measures of discrimination
inferredcites →https://doi.org/10.1109/isit.2004.1365067openalex-snapshot
Jensen-Shannon divergence and Hilbert space embedding
inferredcites →https://doi.org/10.1109/tit.2003.813506openalex-snapshot
A new metric for probability distributions
inferredcites →https://doi.org/10.2307/1968466openalex-snapshot
Metric Spaces and Completely Monotone Functions
inferredcites →https://doi.org/10.2307/2370894openalex-snapshot
A Relation Between Metric and Euclidean 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-030-02224-2_1openalex-snapshot
Re-ranking Permutation-Based Candidate Sets with the n-Simplex Projection
inferred← citeshttps://doi.org/10.1007/978-3-030-02224-2_3openalex-snapshot
Querying Metric Spaces with Bit Operations
inferred← citeshttps://doi.org/10.1007/978-3-030-32047-8_21openalex-snapshot
Query Filtering with Low-Dimensional Local Embeddings
inferred← citeshttps://doi.org/10.1007/978-3-030-32047-8_23openalex-snapshot
Metric Embedding into the Hamming Space with the n-Simplex Projection
inferred← citeshttps://doi.org/10.1007/978-3-030-32047-8_4openalex-snapshot
SPLX-Perm: A Novel Permutation-Based Representation for Approximate Metric Search
inferred← citeshttps://doi.org/10.1007/978-3-030-60936-8_18openalex-snapshot
Sampled Angles in High-Dimensional Spaces
inferred← citeshttps://doi.org/10.1007/978-3-030-60936-8_28openalex-snapshot
Learning Distance Estimators from Pivoted Embeddings of Metric Objects
inferred← citeshttps://doi.org/10.1007/978-3-031-17849-8_12openalex-snapshot
A Ptolemaic Partitioning Mechanism
inferred← citeshttps://doi.org/10.1007/978-3-031-17849-8_9openalex-snapshot
On the Expected Exclusion Power of Binary Partitions for Metric Search
inferred← citeshttps://doi.org/10.1007/978-3-032-06069-3_23openalex-snapshot
Equi-Voronoi Polytopes: A Geometric Basis for 2-bit Quantisation
inferred← citeshttps://doi.org/10.1007/978-3-319-46759-7_4openalex-snapshot
Supermetric Search with the Four-Point Property
inferred← citeshttps://doi.org/10.1007/978-3-319-68474-1_7openalex-snapshot
High-Dimensional Simplexes for Supermetric Search
inferred← citeshttps://doi.org/10.1016/j.is.2020.101493openalex-snapshot
Bitpart: Exact metric search in high(er) dimensions
inferred← citeshttps://doi.org/10.1016/j.is.2021.101808openalex-snapshot
Query filtering using two-dimensional local embeddings
inferred← citeshttps://doi.org/10.1109/jiot.2023.3317334openalex-snapshot
KMSQ: Efficient and Privacy-Preserving Keyword-Oriented Multidimensional Similarity Query in eHealthcare
inferred← citeshttps://doi.org/10.1109/tdsc.2025.3609641openalex-snapshot
MPKS: Efficient and Privacy-Enhanced Multi-Party Keyword-Oriented Similarity Query in ehealthcare
inferred← citeshttps://doi.org/10.1109/tifs.2022.3152395openalex-snapshot
Efficient and Privacy-Preserving Similarity Query With Access Control in eHealthcare
inferred← citeshttps://doi.org/10.1109/tsc.2021.3081350openalex-snapshot
Efficient Privacy-Preserving Similarity Range Query With Quadsector Tree in eHealthcare
inferred← citeshttps://doi.org/10.1145/3534963openalex-snapshot
Indexing Metric Spaces for Exact Similarity Search
inferred← citeshttps://doi.org/10.1145/3647642openalex-snapshot
nSimplex Zen : A Novel Dimensionality Reduction for Euclidean and Hilbert Spaces
inferred← citeshttps://doi.org/10.4018/978-1-7998-4963-6.ch005openalex-snapshot
On the Similarity Search With Hamming Space Sketches
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.