1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.CC2012
Minimizing the number of lattice points in a translated polygon
Friedrich Eisenbrand, Nicolai Hähnle
The parametric lattice-point counting problem is as follows: Given an integer matrix , compute an explicit formula parameterized by that determine…
cs.DS2010★ 1 cited
Covering Cubes and the Closest Vector Problem
Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier
We provide the currently fastest randomized (1+epsilon)-approximation algorithm for the closest vector problem in the infinity norm. The running time of our method depends on the d…