On the public citation graph
Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
0 signed · 255 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/978-1-4757-2016-7openalex-snapshot
Sphere Packings, Lattices and Groups
inferredcites →https://doi.org/10.1007/978-3-0348-0439-4_9openalex-snapshot
Extremum Problems with Inequalities as Subsidiary Conditions
inferredcites →https://doi.org/10.1007/978-3-0348-6925-6openalex-snapshot
Studien zur Theorie der quadratischen Formen
inferredcites →https://doi.org/10.1007/978-3-642-62035-5openalex-snapshot
An Introduction to the Geometry of Numbers
inferredcites →https://doi.org/10.1007/978-3-642-97881-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
inferredcites →https://doi.org/10.1007/bf02392364openalex-snapshot
Die Reduktionstheorie Der Positiven Quadratischen Formen
inferredcites →https://doi.org/10.1007/bf02579403openalex-snapshot
On Lovász’ lattice reduction and the nearest lattice point problem
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.1070/rm1979v034n04abeh002957openalex-snapshot
CLASSICAL METHODS IN THE THEORY OF LATTICE PACKINGS
inferredcites →https://doi.org/10.1137/1.9781611970203openalex-snapshot
An Algorithmic Theory of Numbers, Graphs and Convexity
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.8.4.538openalex-snapshot
Integer Programming with a Fixed Number of Variables
inferredcites →https://doi.org/10.1515/crll.1850.40.279openalex-snapshot
Extraits de lettres de M. Ch. Hermite à M. Jacobi sur différents objects de la théorie des nombres. (Continuation).
inferredcites →https://doi.org/10.2307/2323992openalex-snapshot
Sphere Packings, Lattices and Groups.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0093openalex-snapshot
Basis Reduction Methods
inferred← citeshttps://doi.org/10.1002/cpa.10082openalex-snapshot
Stable systolic inequalities and cohomology products
inferred← citeshttps://doi.org/10.1006/inco.1998.2762openalex-snapshot
A Lattice-Based Public-Key Cryptosystem
inferred← citeshttps://doi.org/10.1006/jcss.1997.1472openalex-snapshot
The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations
inferred← citeshttps://doi.org/10.1006/jcss.1999.1649openalex-snapshot
Approximating the SVP to within a Factor (1+1/dimε) Is NP-Hard under Randomized Reductions
inferred← citeshttps://doi.org/10.1006/jcss.1999.1686openalex-snapshot
On the Limits of Nonapproximability of Lattice Problems
inferred← citeshttps://doi.org/10.1007/10722028_1openalex-snapshot
The Complexity of Some Lattice Problems
inferred← citeshttps://doi.org/10.1007/11830924_41openalex-snapshot
On Bounded Distance Decoding for General Lattices
inferred← citeshttps://doi.org/10.1007/3-540-44670-2_1openalex-snapshot
An Overview of the Sieve Algorithm for the Shortest Lattice Vector Problem
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_22openalex-snapshot
Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices
inferred← citeshttps://doi.org/10.1007/3-540-46416-6_24openalex-snapshot
Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation
inferred← citeshttps://doi.org/10.1007/3-540-46521-9_22openalex-snapshot
Approximating SVP ∞ to within Almost-Polynomial Factors Is NP-Hard
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-48686-0_11openalex-snapshot
A New Transference Theorem in the Geometry of Numbers
inferred← citeshttps://doi.org/10.1007/3-540-48892-8_18openalex-snapshot
A Lattice- Based Public-Key Cryptosystem
inferred← citeshttps://doi.org/10.1007/3-540-54458-5_51openalex-snapshot
Lattice basis reduction: Improved practical algorithms and solving subset sum problems
inferred← citeshttps://doi.org/10.1007/3-540-58691-1_54openalex-snapshot
Reducing lattice bases by means of approximations
inferred← citeshttps://doi.org/10.1007/3-540-58691-1_70openalex-snapshot
Open problems in number theoretic complexity, II
inferred← citeshttps://doi.org/10.1007/978-1-4939-1711-2_7openalex-snapshot
Lattices and Cryptography
inferred← citeshttps://doi.org/10.1007/978-1-4939-3408-9_1openalex-snapshot
The Space $$\mathcal{P}_{n}$$ of Positive n × n Matrices
inferred← citeshttps://doi.org/10.1007/978-3-030-25510-7_1openalex-snapshot
Finding Closest Lattice Vectors Using Approximate Voronoi Cells
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-030-80914-0_17openalex-snapshot
Linear Dependence Among Hecke Eigenvalues
inferred← citeshttps://doi.org/10.1007/978-3-030-84245-1_26openalex-snapshot
Towards Faster Polynomial-Time Lattice Reduction
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-35377-1_11openalex-snapshot
Exploiting the Complexity of Lattice Isomorphism Problem via Irreducible Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-319-27466-9_4openalex-snapshot
Multidimensional Extremal Logan’s and Bohman’s Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-29814-6_4openalex-snapshot
On Promise Problem of the Generalized Shortest Vector Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-63688-7_23openalex-snapshot
Structure vs. Hardness Through the Obfuscation Lens
inferred← citeshttps://doi.org/10.1007/978-3-319-69453-5_28openalex-snapshot
Sieving for Closest Lattice Vectors (with Preprocessing)
inferred← citeshttps://doi.org/10.1007/978-3-319-76620-1_9openalex-snapshot
Explicit Formula for Gram-Schmidt Vectors in LLL with Deep Insertions and Its Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-68279-0_14openalex-snapshot
Integer Programming and Algorithmic Geometry of Numbers
inferred← citeshttps://doi.org/10.1007/978-3-540-88403-3_6openalex-snapshot
Explicit Hard Instances of the Shortest Vector Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-88702-7_5openalex-snapshot
Lattice-based Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-642-02295-1_14openalex-snapshot
Inapproximability Results for Computational Problems on Lattices
inferred← citeshttps://doi.org/10.1007/978-3-642-02295-1_15openalex-snapshot
On the Complexity of Lattice Problems with Polynomial Approximation Factors
inferred← citeshttps://doi.org/10.1007/978-3-642-02295-1_2openalex-snapshot
Hermite’s Constant and Lattice Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-02295-1_4openalex-snapshot
Progress on LLL and Lattice Reduction
inferred← citeshttps://doi.org/10.1007/978-3-642-02295-1_9openalex-snapshot
The LLL Algorithm and Integer Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-14518-6_15openalex-snapshot
Short Bases of Lattices over Number Fields
inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_18openalex-snapshot
The Euclidean Distortion of Flat Tori
inferred← citeshttps://doi.org/10.1007/bf01202355openalex-snapshot
Simultaneous reduction of a lattice basis and its reciprocal basis
inferred← citeshttps://doi.org/10.1007/bf01301537openalex-snapshot
Lattice inequalities for convex bodies and arbitrary lattices
inferred← citeshttps://doi.org/10.1007/bf01445125openalex-snapshot
New bounds in some transference theorems in the geometry of numbers
inferred← citeshttps://doi.org/10.1007/bf01446883openalex-snapshot
Simultaneously good bases of a lattice and its reciprocal lattice
inferred← citeshttps://doi.org/10.1007/bf01581144openalex-snapshot
Lattice basis reduction: Improved practical algorithms and solving subset sum problems
inferred← citeshttps://doi.org/10.1007/bf02574039openalex-snapshot
Inequalities for convex bodies and polar reciprocal lattices inR n
inferred← citeshttps://doi.org/10.1007/bf02574040openalex-snapshot
Successive minima, intrinsic volumes, and lattice determinants
inferred← citeshttps://doi.org/10.1007/bf02772220openalex-snapshot
Generalized degree and optimal loewner-type inequalities
inferred← citeshttps://doi.org/10.1007/s00037-008-0251-3openalex-snapshot
Limits on the Hardness of Lattice Problems in ℓ p Norms
inferred← citeshttps://doi.org/10.1007/s00037-011-0029-xopenalex-snapshot
More on Average Case vs Approximation Complexity
inferred← citeshttps://doi.org/10.1007/s00037-011-0031-3openalex-snapshot
Hardness of Approximating the Closest Vector Problem with Pre-Processing
inferred← citeshttps://doi.org/10.1007/s00208-005-0745-0openalex-snapshot
Nonembeddability theorems via Fourier analysis
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/s00607-004-0104-0openalex-snapshot
Reduction of Smith Normal Form Transformation Matrices
inferred← citeshttps://doi.org/10.1007/s10291-017-0656-zopenalex-snapshot
Cycled efficient V-BLAST GNSS ambiguity decorrelation and search complexity estimation
inferred← citeshttps://doi.org/10.1007/s10623-022-01048-wopenalex-snapshot
Sharper bounds on four lattice constants
inferred← citeshttps://doi.org/10.1007/s10623-025-01772-zopenalex-snapshot
On the ability to approximate k-DSP of HKZ, BKZ and Slide reduction
inferred← citeshttps://doi.org/10.1007/s11432-021-3354-7openalex-snapshot
Quantum-safe cryptography: crossroads of coding theory and cryptography
inferred← citeshttps://doi.org/10.1007/s40993-024-00554-1openalex-snapshot
A new bound for the orthogonality defect of HKZ reduced lattices
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50021-xopenalex-snapshot
10.1016/b978-044488002-4/50021-x
inferred← citeshttps://doi.org/10.1016/j.aam.2017.04.003openalex-snapshot
Tight bounds on discrete quantitative Helly numbers
inferred← citeshttps://doi.org/10.1016/j.aim.2009.09.005openalex-snapshot
Hermitian vector bundles and extension groups on arithmetic schemes. I. Geometry of numbers
inferred← citeshttps://doi.org/10.1016/j.aim.2020.107031openalex-snapshot
An upper bound on the number of perfect quadratic forms
inferred← citeshttps://doi.org/10.1016/j.automatica.2025.112624openalex-snapshot
Simple sufficient conditions for integer stabilizability of discrete-time systems with relative degree one
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.jcss.2004.01.002openalex-snapshot
The inapproximability of lattice and coding problems with preprocessing
inferred← citeshttps://doi.org/10.1016/j.jcss.2005.07.002openalex-snapshot
Hardness of approximating the Shortest Vector Problem in high ℓp norms
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.09.002openalex-snapshot
The Projection Games Conjecture and the hardness of approximation of super-SAT and related problems
inferred← citeshttps://doi.org/10.1016/j.jnt.2022.08.005openalex-snapshot
Counting ideals in ray classes
inferred← citeshttps://doi.org/10.1016/j.matpr.2020.11.570openalex-snapshot
WITHDRAWN: A Simulation on lattice reduction techniques for wireless communication MIMO QAM 64x64 and above
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00123-xopenalex-snapshot
A note on the non-NP-hardness of approximate lattice problems under general Cook reductions
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00337-7openalex-snapshot
Non-standard approaches to integer programming
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00216-0openalex-snapshot
A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00058-9openalex-snapshot
A relation of primal-dual lattices and the complexity of shortest lattice vector problem
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)12004-0openalex-snapshot
Integer Programming, Lattices, and Results in Fixed Dimension
inferred← citeshttps://doi.org/10.1017/s000497270001399xopenalex-snapshot
Area-diameter and area-width relations for covering plane sets
inferred← citeshttps://doi.org/10.1017/s0004972713000257openalex-snapshot
SLIDE REDUCTION, SUCCESSIVE MINIMA AND SEVERAL APPLICATIONS
inferred← citeshttps://doi.org/10.1017/s0963548300001371openalex-snapshot
Block Reduced Lattice Bases and Successive Minima
inferred← citeshttps://doi.org/10.1080/00150517.2015.12428284openalex-snapshot
A Knapsack-Like Code Using Recurrence Sequence Representations
inferred← citeshttps://doi.org/10.1090/dimacs/062/10openalex-snapshot
Maximum-likelihood decoding and integer least-squares: The expected complexity
inferred← citeshttps://doi.org/10.1090/s0002-9939-05-08057-3openalex-snapshot
Hyperelliptic surfaces are Loewner
inferred← citeshttps://doi.org/10.1090/s0025-5718-1994-1240659-8openalex-snapshot
Improved Rounding for Spline Coefficients and Knots
inferred← citeshttps://doi.org/10.1090/s0025-5718-99-00995-3openalex-snapshot
Analysis of PSLQ, an integer relation finding algorithm
inferred← citeshttps://doi.org/10.1093/imrn/rnaa017openalex-snapshot
Abelian Groups Are Polynomially Stable
inferred← citeshttps://doi.org/10.1107/s1600576714000922openalex-snapshot
Robust powder auto-indexing using many peaks
inferred← citeshttps://doi.org/10.1109/18.567677openalex-snapshot
Lattice-theoretic analysis of time-sequential sampling of spatiotemporal signals. I
inferred← citeshttps://doi.org/10.1109/18.651011openalex-snapshot
On the complexity of decoding lattices using the Korkin-Zolotarev reduced basis
inferred← citeshttps://doi.org/10.1109/18.705562openalex-snapshot
Trellis complexity and minimal trellis diagrams of lattices
inferred← citeshttps://doi.org/10.1109/18.915688openalex-snapshot
The hardness of the closest vector problem with preprocessing
inferred← citeshttps://doi.org/10.1109/access.2020.3019345openalex-snapshot
Cybersecurity Challenges Associated With the Internet of Things in a Post-Quantum World
inferred← citeshttps://doi.org/10.1109/ccc.1998.694590openalex-snapshot
Approximating the SVP to within a factor (1-1/dim/sup ε/) is NP-hard under randomized conditions
inferred← citeshttps://doi.org/10.1109/ccc.1999.766274openalex-snapshot
Some recent progress on the complexity of lattice problems
inferred← citeshttps://doi.org/10.1109/ccc.1999.766278openalex-snapshot
Applications of a new transference theorem to Ajtai's connection factor
inferred← citeshttps://doi.org/10.1109/ccc.2002.1004338openalex-snapshot
The inapproximability of lattice and coding problems with preprocessing
inferred← citeshttps://doi.org/10.1109/ccc.2003.1214435openalex-snapshot
Improved inapproximability of lattice and coding problems with preprocessing
inferred← citeshttps://doi.org/10.1109/ccc.2014.18openalex-snapshot
On the Closest Vector Problem with a Distance Guarantee
inferred← citeshttps://doi.org/10.1109/cis.2014.31openalex-snapshot
A Random Sampling Algorithm for SVP Challenge Based on y-Sparse Representations of Short Lattice Vectors
inferred← citeshttps://doi.org/10.1109/dspa60853.2024.10510086openalex-snapshot
Heuristic Number Geometry Method for Finding Low-Weight Codeword in Linear Block Codes
inferred← citeshttps://doi.org/10.1109/eiconrus49466.2020.9038920openalex-snapshot
Overview of Lattice-Based Methods in Cryptanalysis
inferred← citeshttps://doi.org/10.1109/focs.2004.31openalex-snapshot
Hardness of Approximating the Shortest Vector Problem in Lattices
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/icassp.2003.1199865openalex-snapshot
Efficient statistical pruning for maximum likelihood decoding
inferred← citeshttps://doi.org/10.1109/icc.2006.255281openalex-snapshot
Multistage MIMO detection using reduced basis optimality tests
inferred← citeshttps://doi.org/10.1109/icc.2008.230openalex-snapshot
Improved Upper Bounds for Approximate Lattice Decoding With Dual-Basis Reduction
inferred← citeshttps://doi.org/10.1109/icist.2013.6747564openalex-snapshot
Intrusion detection system for Wireless Nano sensor Networks
inferred← citeshttps://doi.org/10.1109/icitst.2013.6750215openalex-snapshot
Intrusion detection system for Wireless Nano sensor Networks
inferred← citeshttps://doi.org/10.1109/ieeestd.2009.4800404openalex-snapshot
IEEE Standard Specification for Public Key Cryptographic Techniques Based on Hard Problems over Lattices
inferred← citeshttps://doi.org/10.1109/isea-isap49340.2020.235008openalex-snapshot
On the DSA Key Recovery Attack with Variable Partial Nonces Known
inferred← citeshttps://doi.org/10.1109/isit.2006.261586openalex-snapshot
Approximate Lattice Decoding: Primal Versus Dual Basis Reduction
inferred← citeshttps://doi.org/10.1109/isit.2010.5513734openalex-snapshot
Integer-forcing linear receivers
inferred← citeshttps://doi.org/10.1109/isit.2016.7541462openalex-snapshot
Universal outage behavior of randomly precoded integer forcing Over MIMO channels
inferred← citeshttps://doi.org/10.1109/isit.2019.8849452openalex-snapshot
Improved Upper Bounds on the Hermite and KZ Constants
inferred← citeshttps://doi.org/10.1109/itw.2009.5351253openalex-snapshot
A unified view of sorting in lattice reduction: From V-BLAST to LLL and beyond
inferred← citeshttps://doi.org/10.1109/itw.2013.6691273openalex-snapshot
Precoded Integer-Forcing Universally Achieves the MIMO Capacity to Within a Constant Gap
inferred← citeshttps://doi.org/10.1109/itw.2017.8277959openalex-snapshot
Outage probability bounds for integer-forcing source coding
inferred← citeshttps://doi.org/10.1109/itw2.2006.323845openalex-snapshot
A Dual-Lattice View of V-BLAST Detection
inferred← citeshttps://doi.org/10.1109/jstsp.2009.2035851openalex-snapshot
Dual-Lattice Ordering and Partial Lattice Reduction for SIC-Based MIMO Detection
inferred← citeshttps://doi.org/10.1109/lcomm.2013.010313.122418openalex-snapshot
Complex Korkine-Zolotareff Reduction Algorithm for Full-Diversity MIMO Detection
inferred← citeshttps://doi.org/10.1109/pimrc.2010.5671711openalex-snapshot
Augmented lattice reduction for low-complexity MIMO decoding
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366815openalex-snapshot
The hardness of approximate optima in lattices, codes, and systems of linear equations
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365702openalex-snapshot
Algorithmic number theory-the complexity contribution
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743433openalex-snapshot
Approximating-CVP to within almost-polynomial factors is NP-hard
inferred← citeshttps://doi.org/10.1109/sfcs.2002.1181960openalex-snapshot
Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptions
inferred← citeshttps://doi.org/10.1109/sfcs.2003.1238195openalex-snapshot
A lattice problem in quantum NP
inferred← citeshttps://doi.org/10.1109/sfcs.2003.1238203openalex-snapshot
Hardness of approximating the shortest vector problem in high L/sub p/ norms
inferred← citeshttps://doi.org/10.1109/sfcs.2003.1238204openalex-snapshot
More on average case vs approximation complexity
inferred← citeshttps://doi.org/10.1109/sfcs.2005.40openalex-snapshot
Hardness of Approximating the Closest Vector Problem with Pre-Processing
inferred← citeshttps://doi.org/10.1109/sfcs.2005.54openalex-snapshot
Nonembeddability theorems via Fourier analysis
inferred← citeshttps://doi.org/10.1109/synasc57785.2022.00025openalex-snapshot
On the bases of Zn lattice
inferred← citeshttps://doi.org/10.1109/tcomm.2012.010313.120072openalex-snapshot
Reduced and Fixed-Complexity Variants of the LLL Algorithm for Communications
inferred← citeshttps://doi.org/10.1109/tcsi.2013.2295027openalex-snapshot
A Lattice Reduction-Aided MIMO Channel Equalizer in 90 nm CMOS Achieving 720 Mb/s
inferred← citeshttps://doi.org/10.1109/tgrs.2025.3642154openalex-snapshot
Characteristics of L-Band Microwave Scattering From Layered Rough Soil With a Full-Wave Volume Integral Equation Approach
inferred← citeshttps://doi.org/10.1109/tit.2004.833350openalex-snapshot
Improved Inapproximability of Lattice and Coding Problems With Preprocessing
inferred← citeshttps://doi.org/10.1109/tit.2011.2178130openalex-snapshot
SISO APP Searches in Lattices With Tanner Graphs
inferred← citeshttps://doi.org/10.1109/tit.2012.2236144openalex-snapshot
Decoding by Embedding: Correct Decoding Radius and DMT Optimality
inferred← citeshttps://doi.org/10.1109/tit.2014.2361782openalex-snapshot
Integer-Forcing Linear Receivers
inferred← citeshttps://doi.org/10.1109/tit.2017.2752181openalex-snapshot
Outage Behavior of Integer Forcing With Random Unitary Pre-Processing
inferred← citeshttps://doi.org/10.1109/tit.2019.2901497openalex-snapshot
Lattice Gaussian Sampling by Markov Chain Monte Carlo: Bounded Distance Decoding and Trapdoor Sampling
inferred← citeshttps://doi.org/10.1109/tit.2019.2950931openalex-snapshot
Achievability Performance Bounds for Integer-Forcing Source Coding
inferred← citeshttps://doi.org/10.1109/tit.2021.3053426openalex-snapshot
Blind Unwrapping of Modulo Reduced Gaussian Vectors: Recovering MSBs From LSBs
inferred← citeshttps://doi.org/10.1109/tit.2022.3151061openalex-snapshot
Algorithms and Bounds for Complex and Quaternionic Lattices With Application to MIMO Transmission
inferred← citeshttps://doi.org/10.1109/tit.2022.3197592openalex-snapshot
A Unified Discretization Approach to Compute–Forward: From Discrete to Continuous Inputs
inferred← citeshttps://doi.org/10.1109/tsp.2005.850352openalex-snapshot
On the sphere-decoding algorithm I. Expected complexity
inferred← citeshttps://doi.org/10.1109/tsp.2006.890912openalex-snapshot
Statistical Pruning for Near-Maximum Likelihood Decoding
inferred← citeshttps://doi.org/10.1109/tsp.2011.2123889openalex-snapshot
On the Proximity Factors of Lattice Reduction-Aided Decoding
inferred← citeshttps://doi.org/10.1109/tsp.2012.2210708openalex-snapshot
HKZ and Minkowski Reduction Algorithms for Lattice-Reduction-Aided MIMO Detection
inferred← citeshttps://doi.org/10.1109/tsp.2017.2708020openalex-snapshot
Boosted KZ and LLL Algorithms
inferred← citeshttps://doi.org/10.1109/tsp.2018.2877205openalex-snapshot
Hybrid Vector Perturbation Precoding: The Blessing of Approximate Message Passing
inferred← citeshttps://doi.org/10.1109/tsp.2019.2959194openalex-snapshot
On Low-Complexity Lattice Reduction Algorithms for Large-Scale MIMO Detection: The Blessing of Sequential Reduction
inferred← citeshttps://doi.org/10.1109/tsp.2020.3036647openalex-snapshot
Lattice Reduction Over Imaginary Quadratic Fields
inferred← citeshttps://doi.org/10.1109/tsp49548.2020.9163528openalex-snapshot
Wireless Channels Topology Invariant as Mathematical Foundation of Neural Network Channel Estimation Transfer Learning Properties
inferred← citeshttps://doi.org/10.1109/tvt.2004.832389openalex-snapshot
MIMO Antenna Selection With Lattice-Reduction-Aided Linear Receivers
inferred← citeshttps://doi.org/10.1109/twc.2010.072210.100023openalex-snapshot
Augmented Lattice Reduction for MIMO Decoding
inferred← citeshttps://doi.org/10.1109/twc.2013.090513.121465openalex-snapshot
Integer-Forcing MIMO Linear Receivers Based on Lattice Reduction
inferred← citeshttps://doi.org/10.1109/twc.2016.2523513openalex-snapshot
Efficient Greedy LLL Algorithms for Lattice Decoding
inferred← citeshttps://doi.org/10.1109/vtcspring.2013.6691846openalex-snapshot
A Stable Expected Complexity Sphere Detection with IRA Enhancement
inferred← citeshttps://doi.org/10.1109/wcsp.2016.7752633openalex-snapshot
Sequential lattice reduction
inferred← citeshttps://doi.org/10.1112/blms/24.6.606openalex-snapshot
Minimal Determinants and Lattice Inequalities
inferred← citeshttps://doi.org/10.1112/s0024609301008888openalex-snapshot
On Free Planes in Lattice Ball Packings
inferred← citeshttps://doi.org/10.1112/s0025579300013772openalex-snapshot
On successive minima and intrinsic volumes
inferred← citeshttps://doi.org/10.1112/s1461157014000333openalex-snapshot
Approximating the densest sublattice from Rankin’s inequality
inferred← citeshttps://doi.org/10.1137/0218037openalex-snapshot
Succinct Certificates for Almost All Subset Sum Problems
inferred← citeshttps://doi.org/10.1137/1.9781611973402.29openalex-snapshot
On the Lattice Isomorphism Problem
inferred← citeshttps://doi.org/10.1137/1.9781611973730.22openalex-snapshot
Short Paths on the Voronoi Graph and Closest Vector Problem with Preprocessing
inferred← citeshttps://doi.org/10.1137/130919623openalex-snapshot
Almost Polynomial Factor Hardness for Closest Vector Problem with Preprocessing
inferred← citeshttps://doi.org/10.1137/14m0973694openalex-snapshot
A Polyhedral Frobenius Theorem with Applications to Integer Optimization
inferred← citeshttps://doi.org/10.1137/16m1092908openalex-snapshot
Centerpoints: A Link between Optimization and Convex Geometry
inferred← citeshttps://doi.org/10.1137/17m1136559openalex-snapshot
Structure Versus Hardness Through the Obfuscation Lens
inferred← citeshttps://doi.org/10.1137/s0097539700373039openalex-snapshot
The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant
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.1137/s0895480100379981openalex-snapshot
On Polynomial-Factor Approximations to the Shortest Lattice Vector Length
inferred← citeshttps://doi.org/10.1142/s1793525313500064openalex-snapshot
THE EUCLIDEAN DISTORTION OF FLAT TORI
inferred← citeshttps://doi.org/10.1145/1089023.1089025openalex-snapshot
Lattice problems in NP ∩ coNP
inferred← citeshttps://doi.org/10.1145/1089023.1089027openalex-snapshot
Hardness of approximating the shortest vector problem in lattices
inferred← citeshttps://doi.org/10.1145/1597036.1597050openalex-snapshot
Low-dimensional lattice basis reduction revisited
inferred← citeshttps://doi.org/10.1145/2213977.2214004openalex-snapshot
2 log1-ε n hardness for the closest vector problem with preprocessing
inferred← citeshttps://doi.org/10.1145/2739480.2754639openalex-snapshot
A Genetic Algorithm for Searching the Shortest Lattice Vector of SVP Challenge
inferred← citeshttps://doi.org/10.1145/276698.276705openalex-snapshot
The shortest vector problem in L 2 is NP -hard for randomized reductions (extended abstract)
inferred← citeshttps://doi.org/10.1145/301250.301441openalex-snapshot
On the complexity of computing short linearly independent vectors and short bases in a lattice
inferred← citeshttps://doi.org/10.1145/3313276.3316397openalex-snapshot
On approximating the covering radius and finding dense lattice subspaces
inferred← citeshttps://doi.org/10.1145/3452143.3465517openalex-snapshot
On the Smallest Ratio Problem of Lattice Bases
inferred← citeshttps://doi.org/10.1145/3631119openalex-snapshot
Optimal Inapproximability with Universal Factor Graphs
showing the first 200 of 236 · page through all 236
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.