Tag Archives: Oded Regev

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

Barak Weiss lectured about his breakthrough results with Or Ordentlich, and Oded Regev, at a Simons Institute workshop: Lattices: Geometry, Algorithms and Hardness. It is a famous problem what is the densest (or, most efficient) packing of unit balls in Euclidean … Continue reading

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