Tag Archives: Or Ordentlich

Or Ordentlich, Oded Regev and Barak Weiss: New bounds for Covering Density!

Update (June 3, 2020): The paper New bounds on the density of lattice coverings is now on the arXiv. Barak Weiss lectured about his breakthrough results with Or Ordentlich, and Oded Regev, at a Simons Institute workshop: Lattices: Geometry, Algorithms and … Continue reading

Posted in Combinatorics, Computer Science and Optimization, Geometry | Tagged , , | 3 Comments