Recent & Upcoming Talks


A Canonical Form for Positive Definite Matrices

The randomized slicer for CVPP: sharper, faster, smaller, batchier

Lattice packings: an upper bound on the number of perfect lattices

We consider an algorithmic approach by Voronoi to solve the lattice packing problem in any fixed dimension. After a visual introduction …


A tight analysis of the Iterative Slicer to solve the Closest Vector Problem

We consider the Iterative Slicer algorithm to solve the Closest Vector Problem with Preprocessing. The success probability of this …


Challenges in Enumerating Perfect Quadratic Forms

We consider the lattice packing problem and a classical method to solve it by enumerating perfect quadratic forms. We show an improved …