On the public citation graph
Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
0 signed · 128 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/aima.1999.1903openalex-snapshot
Entropy and Asymptotic Geometry of Non-Symmetric Convex Bodies
inferredcites →https://doi.org/10.1006/jcss.1997.1472openalex-snapshot
The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations
inferredcites →https://doi.org/10.1006/jcss.1999.1649openalex-snapshot
Approximating the SVP to within a Factor (1+1/dimε) Is NP-Hard under Randomized Reductions
inferredcites →https://doi.org/10.1007/11818175_7openalex-snapshot
Rankin’s Constant and Blockwise Lattice Reduction
inferredcites →https://doi.org/10.1007/3-540-44670-2_12openalex-snapshot
The Two Faces of Lattices in Cryptology
inferredcites →https://doi.org/10.1007/3-540-45537-x_24openalex-snapshot
The Two Faces of Lattices in Cryptology
inferredcites →https://doi.org/10.1007/3-540-46521-9_22openalex-snapshot
Approximating SVP ∞ to within Almost-Polynomial Factors Is NP-Hard
inferredcites →https://doi.org/10.1007/978-3-540-73420-8_8openalex-snapshot
Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima
inferredcites →https://doi.org/10.1007/978-3-540-74143-5_10openalex-snapshot
Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
inferredcites →https://doi.org/10.1007/978-3-642-29849-3_20openalex-snapshot
The Hörmander Proof of the Bourgain–Milman Theorem
inferredcites →https://doi.org/10.1007/978-3-642-97881-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/bf01388911openalex-snapshot
New volume ratio properties for convex symmetric bodies in ? n
inferredcites →https://doi.org/10.1007/bf01445125openalex-snapshot
New bounds in some transference theorems in the geometry of numbers
inferredcites →https://doi.org/10.1007/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
inferredcites →https://doi.org/10.1007/bf01899997openalex-snapshot
The difference body of a convex body
inferredcites →https://doi.org/10.1007/bf02574039openalex-snapshot
Inequalities for convex bodies and polar reciprocal lattices inR n
inferredcites →https://doi.org/10.1007/bf02574061openalex-snapshot
Isoperimetric problems for convex bodies and a localization lemma
inferredcites →https://doi.org/10.1007/bf02711514openalex-snapshot
Inequalities for convex bodies and polar reciprocal lattices inR n II: Application ofK-convexity
inferredcites →https://doi.org/10.1007/bfb0090049openalex-snapshot
Isotropic position and inertia ellipsoids and zonoids of the unit ball of a normed n-dimensional space
inferredcites →https://doi.org/10.1007/s00039-006-0588-1openalex-snapshot
On convex perturbations with a bounded isotropic constant
inferredcites →https://doi.org/10.1007/s00039-008-0669-4openalex-snapshot
From the Mahler Conjecture to Gauss Linking Integrals
inferredcites →https://doi.org/10.1007/s001459900042openalex-snapshot
Lattice Reduction: A Toolbox for the Cryptanalyst
inferredcites →https://doi.org/10.1007/s00493-003-0019-yopenalex-snapshot
Approximating CVP to Within Almost-Polynomial Factors is NP-Hard
inferredcites →https://doi.org/10.1016/0304-3975(87)90064-8openalex-snapshot
A hierarchy of polynomial time lattice basis reduction algorithms
inferredcites →https://doi.org/10.1016/j.jcss.2005.08.004openalex-snapshot
Simulated annealing in convex bodies and an O*(n4) volume algorithm
inferredcites →https://doi.org/10.1016/j.tcs.2008.12.045openalex-snapshot
Sampling methods for shortest vectors, closest vectors and successive minima
inferredcites →https://doi.org/10.1016/s0304-3975(01)00290-0openalex-snapshot
Approximating SVP∞ to within almost-polynomial factors is NP-hard
inferredcites →https://doi.org/10.1017/cbo9780511662454openalex-snapshot
The Volume of Convex Bodies and Banach Space Geometry
inferredcites →https://doi.org/10.1023/a:1009842406728openalex-snapshot
Distances Between Non-symmetric Convex Bodies and the $$MM^* $$ -estimate
inferredcites →https://doi.org/10.1090/psapm/042/1095552openalex-snapshot
The rise and fall of knapsack cryptosystems
inferredcites →https://doi.org/10.1109/ccc.2002.1004339openalex-snapshot
Sampling short lattice vectors and the closest lattice vector problem
inferredcites →https://doi.org/10.1109/focs.2006.28openalex-snapshot
Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization
inferredcites →https://doi.org/10.1109/sfcs.1985.8openalex-snapshot
An application of simultaneous approximation in combinatorial optimization
inferredcites →https://doi.org/10.1109/sfcs.1993.366815openalex-snapshot
The hardness of approximate optima in lattices, codes, and systems of linear equations
inferredcites →https://doi.org/10.1112/jlms/s1-33.3.270openalex-snapshot
Convex Bodies Associated with a Given Convex Body
inferredcites →https://doi.org/10.1137/s0097539700373039openalex-snapshot
The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant
inferredcites →https://doi.org/10.1137/s0097539705447360openalex-snapshot
Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
inferredcites →https://doi.org/10.1145/102782.102783openalex-snapshot
A random polynomial-time algorithm for approximating the volume of convex bodies
inferredcites →https://doi.org/10.1145/1089023.1089027openalex-snapshot
Hardness of approximating the shortest vector problem in lattices
inferredcites →https://doi.org/10.1145/1132516.1132581openalex-snapshot
Lattice problems and norm embeddings
inferredcites →https://doi.org/10.1145/12130.12176openalex-snapshot
Computing the volume is difficult
inferredcites →https://doi.org/10.1145/1250790.1250859openalex-snapshot
Tensor-based hardness of the shortest vector problem to within almost polynomial factors
inferredcites →https://doi.org/10.1145/1374376.1374408openalex-snapshot
Finding short lattice vectors within mordell's inequality
inferredcites →https://doi.org/10.1145/1806689.1806739openalex-snapshot
A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations
inferredcites →https://doi.org/10.1145/1998196.1998264openalex-snapshot
Covering cubes and the closest vector problem
inferredcites →https://doi.org/10.1145/276698.276705openalex-snapshot
The shortest vector problem in L 2 is NP -hard for randomized reductions (extended abstract)
inferredcites →https://doi.org/10.1145/380752.380857openalex-snapshot
A sieve algorithm for the shortest lattice vector problem
inferredcites →https://doi.org/10.1287/moor.12.3.415openalex-snapshot
Minkowski's Convex Body Theorem and Integer Programming
inferredcites →https://doi.org/10.1287/moor.24.3.728openalex-snapshot
The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces
inferredcites →https://doi.org/10.1287/moor.8.4.538openalex-snapshot
Integer Programming with a Fixed Number of Variables
inferredcites →https://doi.org/10.1515/form.2003.009openalex-snapshot
On the equidistribution of Hecke points
inferredcites →https://doi.org/10.2307/2374532openalex-snapshot
On High Dimensional Maximal Functions Associated to Convex Bodies
inferredcites →https://doi.org/10.4064/sm-88-1-69-84openalex-snapshot
Logarithmically concave functions and sections of convex sets in $R^{n}$
inferredcites →https://doi.org/10.4230/lipics.fsttcs.2008.1738openalex-snapshot
Some Sieving Algorithms for Lattice Problems
inferredcites →https://doi.org/10.48550/arxiv.1012.2289openalex-snapshot
Covering Cubes and the Closest Vector Problem
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-22629-9_16openalex-snapshot
Integer Conic Function Minimization Based on the Comparison Oracle
inferred← citeshttps://doi.org/10.1007/978-3-030-45771-6_26openalex-snapshot
The Integrality Number of an Integer Program
inferred← citeshttps://doi.org/10.1007/978-3-030-45771-6_28openalex-snapshot
Constructing Lattice-Free Gradient Polyhedra in Dimension Two
inferred← citeshttps://doi.org/10.1007/978-3-030-56880-1_10openalex-snapshot
Slide Reduction, Revisited—Filling the Gaps in SVP Approximation
inferred← citeshttps://doi.org/10.1007/978-3-031-06901-7_33openalex-snapshot
Approximate $$\mathrm {CVP}_{}$$ in Time $$2^{0.802 n}$$ - Now in Any Norm!
inferred← citeshttps://doi.org/10.1007/978-3-031-35305-5_8openalex-snapshot
Enumeration and Unimodular Equivalence of Empty Delta-Modular Simplices
inferred← citeshttps://doi.org/10.1007/978-3-032-11835-6_28openalex-snapshot
Realizing Temporal Transportation Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-13075-0_16openalex-snapshot
Minimum-Cost $$b$$-Edge Dominating Sets on Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-76581-5_21openalex-snapshot
New (and Old) Proof Systems for Lattice Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-96247-4_2openalex-snapshot
FPT Algorithms for the Shortest Lattice Vector and Integer Linear Programming Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-20901-7_10openalex-snapshot
Algorithms for the Shortest and Closest Lattice Vector Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-29344-3_18openalex-snapshot
A O(1/ε 2) n -Time Sieving Algorithm for Approximate Integer Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-32512-0_16openalex-snapshot
The Remote Set Problem on Lattices
inferred← citeshttps://doi.org/10.1007/978-3-642-40041-4_2openalex-snapshot
Hardness of SIS and LWE with Small Parameters
inferred← citeshttps://doi.org/10.1007/978-3-642-54631-0_23openalex-snapshot
Solving Random Subset Sum Problem by l p -norm SVP Oracle
inferred← citeshttps://doi.org/10.1007/s00037-014-0094-zopenalex-snapshot
The remote set problem on lattices
inferred← citeshttps://doi.org/10.1007/s00453-013-9834-8openalex-snapshot
A Randomized Sieving Algorithm for Approximate Integer Programming
inferred← citeshttps://doi.org/10.1007/s00453-018-0448-zopenalex-snapshot
Minimum-Cost b-Edge Dominating Sets on Trees
inferred← citeshttps://doi.org/10.1007/s00454-022-00392-xopenalex-snapshot
Covering Convex Bodies and the Closest Vector Problem
inferred← citeshttps://doi.org/10.1007/s10107-018-1317-xopenalex-snapshot
On the Rational Polytopes with Chvátal Rank 1
inferred← citeshttps://doi.org/10.1007/s10107-021-01658-7openalex-snapshot
Constructing lattice-free gradient polyhedra in dimension two
inferred← citeshttps://doi.org/10.1007/s10479-018-2852-9openalex-snapshot
New algorithms for minimizing the weighted number of tardy jobs on a single machine
inferred← citeshttps://doi.org/10.1007/s10586-017-1032-zopenalex-snapshot
A polynomial time algorithm for a variant of shortest vector problem with applications in compute-and-forward design
inferred← citeshttps://doi.org/10.1007/s10878-018-0264-zopenalex-snapshot
FPT-algorithms for some problems related to integer programming
inferred← citeshttps://doi.org/10.1007/s10898-018-0729-8openalex-snapshot
On the complexity of quasiconvex integer minimization problem
inferred← citeshttps://doi.org/10.1007/s10898-022-01165-9openalex-snapshot
On $$\Delta $$-modular integer linear problems in the canonical form and equivalent problems
inferred← citeshttps://doi.org/10.1007/s10898-024-01379-zopenalex-snapshot
Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems
inferred← citeshttps://doi.org/10.1007/s11590-021-01744-xopenalex-snapshot
On lattice point counting in $$\varDelta $$-modular polyhedra
inferred← citeshttps://doi.org/10.1007/s11590-023-02017-5openalex-snapshot
Structured $$(\min ,+)$$-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems
inferred← citeshttps://doi.org/10.1007/s11856-012-0173-2openalex-snapshot
The isotropic position and the reverse Santaló inequality
inferred← citeshttps://doi.org/10.1016/j.dam.2019.10.006openalex-snapshot
A polynomial algorithm for minimizing discrete convic functions in fixed dimension
inferred← citeshttps://doi.org/10.1016/j.disc.2013.10.020openalex-snapshot
New transference theorems on lattices possessing n ϵ -unique shortest vectors
inferred← citeshttps://doi.org/10.1016/j.disopt.2020.100596openalex-snapshot
Integer programming in parameterized complexity: Five miniatures
inferred← citeshttps://doi.org/10.1016/j.ejor.2018.07.038openalex-snapshot
On the parameterized tractability of single machine scheduling with rejection
inferred← citeshttps://doi.org/10.1016/j.ipl.2020.106065openalex-snapshot
A note on the concrete hardness of the shortest independent vector in lattices
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.2022.01.013openalex-snapshot
Root repulsion and faster solving for very sparse polynomials over p-adic fields
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.01.017openalex-snapshot
Mixed integer programming with convex/concave constraints: Fixed-parameter tractability and applications to multicovering and voting
inferred← citeshttps://doi.org/10.1017/s0962492913000032openalex-snapshot
Mixed-integer nonlinear optimization
inferred← citeshttps://doi.org/10.1073/pnas.1203863110openalex-snapshot
Near-optimal deterministic algorithms for volume computation via M-ellipsoids
inferred← citeshttps://doi.org/10.1090/pspum/111/02040openalex-snapshot
The nonlinear algebra view of discrete mathematics
inferred← citeshttps://doi.org/10.1109/allerton.2014.7028460openalex-snapshot
Compute-and-Forward: Finding the best equation
inferred← citeshttps://doi.org/10.1109/ccc.2013.31openalex-snapshot
On the Lattice Smoothing Parameter Problem
inferred← citeshttps://doi.org/10.1109/focs.2015.41openalex-snapshot
Solving the Closest Vector Problem in 2^n Time -- The Discrete Gaussian Strikes Again!
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00060openalex-snapshot
The Subspace Flatness Conjecture and Faster Integer Programming
inferred← citeshttps://doi.org/10.1109/icra.2014.6907156openalex-snapshot
Assignment algorithms for modeling resource contention and interference in multi-robot task-allocation
inferred← citeshttps://doi.org/10.1109/itw.2017.8278007openalex-snapshot
The necessity of scheduling in compute-and-forward
inferred← citeshttps://doi.org/10.1109/tase.2015.2415514openalex-snapshot
Assignment Algorithms for Modeling Resource Contention in Multirobot Task Allocation
inferred← citeshttps://doi.org/10.1109/tit.2021.3093454openalex-snapshot
Compute-and-Forward in Large Relaying Systems: Limitations and Asymptotically Optimal Scheduling
inferred← citeshttps://doi.org/10.1134/s199047892001007xopenalex-snapshot
Minimization of Even Conic Functions on the Two-Dimensional Integral Lattice
inferred← citeshttps://doi.org/10.1137/1.9781611973105.78openalex-snapshot
Lattice Sparsification and the Approximate Closest Vector Problem
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch121openalex-snapshot
Discrete Gaussian Sampling Reduces to CVP and SVP
inferred← citeshttps://doi.org/10.1137/1.9781611976465.145openalex-snapshot
Dimension-Preserving Reductions Between SVP and CVP in Different p -Norms
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch70openalex-snapshot
Economical Convex Coverings and Applications
inferred← citeshttps://doi.org/10.1137/17m1132045openalex-snapshot
Voronoi Cells of Lattices with Respect to Arbitrary Norms
inferred← citeshttps://doi.org/10.1137/21m139935xopenalex-snapshot
Enumerating Integer Points in Polytopes with Bounded Subdeterminants
inferred← citeshttps://doi.org/10.1145/2213977.2214089openalex-snapshot
Unconditional differentially private mechanisms for linear queries
inferred← citeshttps://doi.org/10.1145/2488608.2488694openalex-snapshot
The approximate rank of a matrix and its algorithmic applications
inferred← citeshttps://doi.org/10.1145/2554797.2554838openalex-snapshot
Integer feasibility of random polytopes
inferred← citeshttps://doi.org/10.1145/3313276.3316397openalex-snapshot
On approximating the covering radius and finding dense lattice subspaces
inferred← citeshttps://doi.org/10.1365/s13291-012-0055-xopenalex-snapshot
Foundations of Discrete Optimization: In Transition from Linear to Non-linear Models and Methods
inferred← citeshttps://doi.org/10.33048/daio.2020.27.654openalex-snapshot
Minimization of even conic functions on the two-dimensional integral lattice
inferred← citeshttps://doi.org/10.3390/a14120362openalex-snapshot
Faster Provable Sieving Algorithms for the Shortest Vector Problem and the Closest Vector Problem on Lattices in ℓp Norm
inferred← citeshttps://doi.org/10.4230/lipics.socg.2015.704openalex-snapshot
Faster Deterministic Volume Estimation in the Oracle Model via Thin Lattice Coverings
inferred← citeshttps://doi.org/10.48550/arxiv.1112.3073openalex-snapshot
The isotropic position and the reverse Santaló inequality
inferred← citeshttps://doi.org/10.48550/arxiv.1311.6671openalex-snapshot
A Deterministic Polynomial Space Construction for eps-nets under any Norm
inferred← citeshttps://doi.org/10.48550/arxiv.1404.0564openalex-snapshot
New Shortest Lattice Vector Problems of Polynomial Complexity
inferred← citeshttps://doi.org/10.48550/arxiv.2005.11654openalex-snapshot
A Note on the Concrete Hardness of the Shortest Independent Vectors Problem in Lattices
inferred← citeshttps://doi.org/10.48550/arxiv.2011.02826openalex-snapshot
Block-structured Integer Programming: Can we Parameterize without the Largest Coefficient?
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.