On the public citation graph

Lattice points in high-dimensional spheres

https://doi.org/10.1007/bf01571276
0 signed · 92 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/978-1-4613-8566-0openalex-snapshot
Representations of Integers as Sums of Squares
inferredcites →https://doi.org/10.1007/978-3-0348-7185-3openalex-snapshot
Einführung in die Gitterpunktlehre
inferredcites →https://doi.org/10.1007/bf01171107openalex-snapshot
�ber Gitterpunkte in mehrdimensionalen Kugeln
inferredcites →https://doi.org/10.1007/bf02122550openalex-snapshot
On a lattice point problem of L. Moser. I
inferredcites →https://doi.org/10.1007/bf02122797openalex-snapshot
On a lattice point problem of L. Moser II
inferredcites →https://doi.org/10.1017/9781009004091openalex-snapshot
A Course of Modern Analysis
inferredcites →https://doi.org/10.1017/s0017089500007047openalex-snapshot
Minimal theta functions
inferredcites →https://doi.org/10.1090/s0002-9904-1967-11644-6openalex-snapshot
On lattice-points in a random sphere
inferredcites →https://doi.org/10.1109/tit.1985.1057034openalex-snapshot
On universal quantization
inferredcites →https://doi.org/10.1112/s0025579300013231openalex-snapshot
An improvement to the Minkowski‐Hiawka bound for packing superballs
inferredcites →https://doi.org/10.1137/0215038openalex-snapshot
On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem
inferredcites →https://doi.org/10.1145/2455.2461openalex-snapshot
Solving low-density subset sum problems
inferredcites →https://doi.org/10.2307/2311786openalex-snapshot
A Brief Introduction to Theta Functions.
inferredcites →https://doi.org/10.4064/aa-14-2-141-152openalex-snapshot
On the number of integer points in the displaced circles

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/10722028_4openalex-snapshot
Lattice Reduction in Cryptology: An Update
inferred← citeshttps://doi.org/10.1007/11593447_3openalex-snapshot
Adapting Density Attacks to Low-Weight Knapsacks
inferred← citeshttps://doi.org/10.1007/3-540-44670-2_12openalex-snapshot
The Two Faces of Lattices in Cryptology
inferred← citeshttps://doi.org/10.1007/3-540-45539-6_4openalex-snapshot
Noisy Polynomial Interpolation and Noisy Chinese Remaindering
inferred← citeshttps://doi.org/10.1007/3-540-46416-6_4openalex-snapshot
An Improved Low-Density Subset Sum Algorithm
inferred← citeshttps://doi.org/10.1007/3-540-46665-7_29openalex-snapshot
Tensor-Based Trapdoors for CVP and Their Application to Public Key Cryptography
inferred← citeshttps://doi.org/10.1007/3-540-49264-x_1openalex-snapshot
Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction
inferred← citeshttps://doi.org/10.1007/3-540-54458-5_70openalex-snapshot
Improving the critical density of the Lagarias-Odlyzko attack against subset sum problems
inferred← citeshttps://doi.org/10.1007/978-3-030-44329-0openalex-snapshot
Theta Invariants of Euclidean Lattices and Infinite-Dimensional Hermitian Vector Bundles over Arithmetic Curves
inferred← citeshttps://doi.org/10.1007/978-3-030-57559-5_5openalex-snapshot
Chapter IV: Euclidean Lattices, Theta Invariants, and Thermodynamic Formalism
inferred← citeshttps://doi.org/10.1007/978-3-319-56614-6_3openalex-snapshot
Random Sampling Revisited: Lattice Enumeration with Discrete Pruning
inferred← citeshttps://doi.org/10.1007/978-3-319-66272-5openalex-snapshot
Discrete Geometry for Computer Imagery
inferred← citeshttps://doi.org/10.1007/978-3-319-66272-5_29openalex-snapshot
Study on the Digitization Dual Combinatorics and Convex Case
inferred← citeshttps://doi.org/10.1007/978-3-540-68164-9_11openalex-snapshot
New Definition of Density on Knapsack Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-3-540-74143-5_10openalex-snapshot
Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-13190-5_13openalex-snapshot
Lattice Enumeration Using Extreme Pruning
inferred← citeshttps://doi.org/10.1007/978-3-642-25385-0_1openalex-snapshot
BKZ 2.0: Better Lattice Security Estimates
inferred← citeshttps://doi.org/10.1007/978-3-642-29952-0_18openalex-snapshot
Lower Bounds of Shortest Vector Lengths in Random NTRU Lattices
inferred← citeshttps://doi.org/10.1007/978-3-642-42001-6_6openalex-snapshot
Factoring Integers by CVP Algorithms
inferred← citeshttps://doi.org/10.1007/bf01201999openalex-snapshot
Improved low-density subset sum algorithms
inferred← citeshttps://doi.org/10.1007/bf01232282openalex-snapshot
On the packing densities of superballs and other bodies
inferred← citeshttps://doi.org/10.1007/bf02293039openalex-snapshot
On the covering multiplicity of lattices
inferred← citeshttps://doi.org/10.1007/jhep05(2020)043openalex-snapshot
On the elliptic Calabi-Yau fourfold with maximal h1,1
inferred← citeshttps://doi.org/10.1007/jhep10(2021)197openalex-snapshot
Comments on the holographic description of Narain theories
inferred← citeshttps://doi.org/10.1007/jhep12%282015%29164openalex-snapshot
The F-theory geometry with most flux vacua
inferred← citeshttps://doi.org/10.1007/jhep12(2015)164openalex-snapshot
The F-theory geometry with most flux vacua
inferred← citeshttps://doi.org/10.1007/s00224-010-9278-3openalex-snapshot
Generating Shorter Bases for Hard Random Lattices
inferred← citeshttps://doi.org/10.1007/s10623-007-9058-5openalex-snapshot
Low-density attack revisited
inferred← citeshttps://doi.org/10.1007/s10623-012-9724-0openalex-snapshot
On the number of lattice points in a small sphere and a recursive lattice decoding algorithm
inferred← citeshttps://doi.org/10.1007/s10851-018-0846-5openalex-snapshot
Combinatorics of the Gauss Digitization Under Translation in 2D
inferred← citeshttps://doi.org/10.1007/s11424-015-3324-9openalex-snapshot
Solving low-density multiple subset sum problems with SVP oracle
inferred← citeshttps://doi.org/10.1007/s13160-025-00713-6openalex-snapshot
On tiny-probability lattice enumeration
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00133-4openalex-snapshot
Some results on the asymptotic behaviour of coefficients of large powers of functions
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00142-6openalex-snapshot
Counting lattice points in pyramids
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90071-xopenalex-snapshot
An upper bound on the average number of iterations of the LLL algorithm
inferred← citeshttps://doi.org/10.1016/0377-0427(92)90248-vopenalex-snapshot
Explicit Tauberian estimates for functions with positive coefficients
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50024-5openalex-snapshot
10.1016/b978-044488002-4/50024-5
inferred← citeshttps://doi.org/10.1016/j.crma.2011.02.014openalex-snapshot
Conditions minimales de consistance pour la sélection de variables en grande dimension
inferred← citeshttps://doi.org/10.1016/j.ins.2018.04.021openalex-snapshot
Improved broadcast attacks against subset sum problems via lattice oracle
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.09.006openalex-snapshot
Approximate CVP in time 20.802
inferred← citeshttps://doi.org/10.1016/j.jnt.2004.08.004openalex-snapshot
On the number of ways to occupy n lattice points by balls in d -dimensional space
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.10.011openalex-snapshot
Lower bounds of shortest vector lengths in random NTRU lattices
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.09.016openalex-snapshot
Approximate set union via approximate randomization
inferred← citeshttps://doi.org/10.1088/1742-6596/2197/1/012028openalex-snapshot
The Energy probability distribution of quantum levels of a particle imprisoned in a three dimensional box
inferred← citeshttps://doi.org/10.1109/83.298393openalex-snapshot
Pyramidal lattice vector quantization for multiscale image coding
inferred← citeshttps://doi.org/10.1109/access.2021.3076598openalex-snapshot
Lattice Attacks on NTRU Revisited
inferred← citeshttps://doi.org/10.1109/dcc.1999.755649openalex-snapshot
Multiple description lattice vector quantization
inferred← citeshttps://doi.org/10.1109/isit.1993.748488openalex-snapshot
Generalised Theta Functionsb for Lattice Vector Quantization
inferred← citeshttps://doi.org/10.1109/isit.2012.6283832openalex-snapshot
Cryptanalysis of a homomorphic encryption scheme from ISIT 2008
inferred← citeshttps://doi.org/10.1109/isita.2010.5649321openalex-snapshot
On the critical density associated with the matrix type knapsack cryptosystem
inferred← citeshttps://doi.org/10.1109/tit.2006.872847openalex-snapshot
n-channel entropy-constrained multiple-description lattice vector quantization
inferred← citeshttps://doi.org/10.1109/tit.2010.2080411openalex-snapshot
$n$-Channel Asymmetric Entropy-Constrained Multiple-Description Lattice Vector Quantization
inferred← citeshttps://doi.org/10.1137/18m1210186openalex-snapshot
Kissing Numbers and Transference Theorems from Generalized Tail Bounds
inferred← citeshttps://doi.org/10.1137/s0097539703433511openalex-snapshot
Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor
inferred← citeshttps://doi.org/10.1145/2898420.2898427openalex-snapshot
Cryptanalysis of a Fast Private Information Retrieval Protocol
inferred← citeshttps://doi.org/10.1145/3188745.3188840openalex-snapshot
(Gap/S)ETH hardness of SVP
inferred← citeshttps://doi.org/10.1145/352600.352616openalex-snapshot
Multi-round passive attacks on server-aided RSA protocols
inferred← citeshttps://doi.org/10.1214/12-aos1046openalex-snapshot
Tight conditions for consistency of variable selection in the context of high dimensionality
inferred← citeshttps://doi.org/10.1587/transfun.e93.a.1058openalex-snapshot
New Conditions for Secure Knapsack Schemes against Lattice Attack
inferred← citeshttps://doi.org/10.1587/transfun.e95.a.903openalex-snapshot
On the Hardness of Subset Sum Problem from Different Intervals
inferred← citeshttps://doi.org/10.21203/rs.3.rs-1504750/v1openalex-snapshot
Cryptanalysis of the quantum public-key cryptosystem OTU under heuristics from combinatorial statements
inferred← citeshttps://doi.org/10.26083/tuprints-00002829openalex-snapshot
Computing Shortest Lattice Vectors on Special Hardware
inferred← citeshttps://doi.org/10.30684/etj.2015.116737openalex-snapshot
Computing The Number of Integral Points in4-dimensional Ball Using Tutte Polynomial
inferred← citeshttps://doi.org/10.4007/annals.2024.199.1.1openalex-snapshot
A reverse Minkowski theorem
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2019.11openalex-snapshot
A Time-Distance Trade-Off for GDD with Preprocessing - Instantiating the DLW Heuristic
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2020.36openalex-snapshot
Hardness of Bounded Distance Decoding on Lattices in $\ell_p$ Norms
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2022.19openalex-snapshot
Improved Hardness of BDD and SVP Under Gap-(S)ETH
inferred← citeshttps://doi.org/10.46298/cm.11119openalex-snapshot
On the number of lattice points in a ball
inferred← citeshttps://doi.org/10.48550/arxiv.1102.3616openalex-snapshot
Tight conditions for consistent variable selection in high dimensional nonparametric regression
inferred← citeshttps://doi.org/10.48550/arxiv.1604.07800openalex-snapshot
The Systematic Normal Form of Lattices
inferred← citeshttps://doi.org/10.48550/arxiv.1802.06204openalex-snapshot
Approximate Set Union Via Approximate Randomization
inferred← citeshttps://doi.org/10.48550/arxiv.1808.03033openalex-snapshot
Fractal and Multi-Fractal Analysis for A Family of Subset Sum Functions: Combinatorial Structures of Embedding Dimension $1$
inferred← citeshttps://doi.org/10.48550/arxiv.1909.04992openalex-snapshot
Euclidean lattices, theta invariants, and thermodynamic formalism
inferred← citeshttps://doi.org/10.48550/arxiv.2008.07216openalex-snapshot
Algorithm for SIS and MultiSIS problems
inferred← citeshttps://doi.org/10.53846/goediss-10017openalex-snapshot
Analytic studies on the SYK models: from instantaneous thermalization to holographic duality
inferred← citeshttps://doi.org/10.70675/a477cda1z1f32z481ezbe0fzcadc18756bf0openalex-snapshot
Lattice algorithms and lattice-based cryptography
inferred← citeshttps://doi.org/10.70675/b7aa7daczb559z47adz8becz1c2f7d2ad669openalex-snapshot
Quelques contributions à la sélection de variables et aux tests non-paramétriques
inferred← citeshttps://doi.org/10.70675/efeb9289zef55z4920z927bz18b645e1c7b6openalex-snapshot
Decoding algorithms for lattices
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.