On the public citation graph
An Elementary Proof of Nonexistence of Isometries between ℓpk and ℓqk
0 signed · 14 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/bf02834756openalex-snapshot
Potentials and isometric embeddings inL 1
inferredcites →https://doi.org/10.1137/0132071openalex-snapshot
The Rectilinear Steiner Tree Problem is $NP$-Complete
inferredcites →https://doi.org/10.1137/0204023openalex-snapshot
Near-Optimal Solutions to a 2-Dimensional Placement Problem
inferredcites →https://doi.org/10.1137/0209017openalex-snapshot
Voronoui Diagrams in $L_1 (L_\infty )$ Metrics with 2-Dimensional Storage Applications
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-642-58043-7_7openalex-snapshot
Hyperplane Approximation and Related Topics
inferred← citeshttps://doi.org/10.1007/978-94-009-7772-3_7openalex-snapshot
Computational Geometric Problems in Pattern Recognition
inferred← citeshttps://doi.org/10.1007/bf02247943openalex-snapshot
The region approach for computing relative neighbourhood graphs in the Lp metric
inferred← citeshttps://doi.org/10.1007/bfb0022496openalex-snapshot
On some discrete optimization problems in mass storage systems
inferred← citeshttps://doi.org/10.1016/0031-3203(82)90070-xopenalex-snapshot
Computing the relative neighborhood graph in the L1 and L∞ metrics
inferred← citeshttps://doi.org/10.1016/0031-3203(85)90023-8openalex-snapshot
Relative neighborhood graphs in the Li-metric
inferred← citeshttps://doi.org/10.1051/ita/1987210201991openalex-snapshot
An almost naive algorithm for finding relative neighbourhood graphs in $L_p$ metrics
inferred← citeshttps://doi.org/10.1145/356810.356814openalex-snapshot
Minimizing Expected Head Movement in One-Dimensional and Two-Dimensional Mass Storage Systems
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.