Showing 1–20 of 47 results
/ Date/ Name
Jan 28, 2012Near-Optimal Deterministic Algorithms for Volume Computation and Lattice Problems via M-EllipsoidsDec 26, 2014On the Lattice Smoothing Parameter ProblemDec 26, 2014Solving the Shortest Vector Problem in $2^n$ Time via Discrete Gaussian SamplingOct 23, 2025Excluding a Line Minor via Design Matrices and Column Number Bounds for the Circuit Imbalance MeasureNov 25, 2010Enumerative Lattice Algorithms in Any Norm via M-Ellipsoid CoveringsNov 15, 2021On Circuit Diameter Bounds via Circuit ImbalancesNov 8, 2010On the Chvatal-Gomory Closure of a Compact Convex SetDec 30, 2012Lattice Sparsification and the Approximate Closest Vector ProblemJun 7, 2020On the Complexity of Branching ProofsNov 4, 2021A New Framework for Matrix Discrepancy: Partial Coloring Bounds via Mirror DescentNov 26, 2013A Deterministic Polynomial Space Construction for eps-nets under any NormOct 23, 2025From Incremental Transitive Cover to Strongly Polynomial Maximum FlowDec 20, 2014On the Shadow Simplex Method for Curved PolyhedraDec 18, 2014Short Paths on the Voronoi Graph and the Closest Vector Problem with PreprocessingDec 15, 2020On the Integrality Gap of Binary Integer Programs with Gaussian DataNov 17, 2020A Simple Method for Convex Optimization in the Oracle ModelNov 15, 2017A Friendly Smoothed Analysis of the Simplex MethodJul 20, 2017AWGN-Goodness is Enough: Capacity-Achieving Lattice Codes based on Dithered Probabilistic ShapingSep 12, 2011A O(1/eps^2)^n Time Sieving Algorithm for Approximate Integer ProgrammingSep 10, 2020Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers