–
Coffee and Check-In
–
Welcome Remarks
–
A Reverse Minkowski Theorem
Noah Stephens-Davidowitz, MIT
–
Break
–
Successive Minima-Type Inequalities
 Martin Henk, Technische Universität Berlin
–
Lunch
–
Short Simplex Paths in Lattice Polytopes
Alberto del Pia, University of Wisconsin, Madison
–
The n by n by n Cube and a Hyperplane
Imre Barany, Rényi Institute
–
Break
–
New Bounds on the Covering Density
Barak Weiss, Tel Aviv University
–
Reception
–
Coffee and Check-In
–
An LLL Algorithm for Module Lattices
Alice Pellet-Mary, KU Leuven
–
Break
–
Algorithms for the k-List Problems
Elena Kirshanova, Immanuel Kant Baltic Federal University
–
Lunch
–
New Reductions and Algorithms for Ideal Lattices via Arakelov Random Walks
Leo Ducas, , Centrum Wiskunde & Informatica, & Benjamin Wesolowski, , EPFL
–
Challenges in Evaluating Costs of known Lattice Attacks
Tanja Lange, Technische Universiteit Eindhoven, Daniel J. Bernstein, University of Illinois at Chicago & Ruhr University Bochum
–
Break
–
On the Concrete Security of LWE with Small Secret
Lynn Chua, UC Berkeley
–
Open Problems
–
Coffee and Check-In
–
Integer Programming and Convolution, with Applications
Klaus Jansen, , University of Kiel
–
Break
–
On Minimal Support for Lattices and Semigroups
Timm Oertel, Cardiff University
–
Distance-Sparsity Transference for Lattice Points in Knapsack Polytopes
Iskander Aliev, Cardiff University
–
Lunch
–
PPP-completeness with connections to Cryptography
Aikaterini Sotiraki​​​​, MIT
–
Provable Sieving Algorithms for SVP and CVP in the l_p norm
 Priyanka Mukhopadhyay, Unviersity of Waterloo
–
Break
–
A Polynomial Time Algorithm for Solving the Closest Vector Problem for Lattices Related to Zonotopes
Frank Vallentin, Unversity of Cologne
–
Coffee and Check-In
–
When Cryptography Meets Modern Channel Coding
Joseph J. Boutros, Texas A&M University
–
Break
–
Lattice Packings: An Upper Bound on the Number of Perfect Lattices
Wessel van Woerden, CWI
–
A Simplex-Type Voronoi Algorithm Based on Short Vector Computations of Copositive Quadratic Forms
Achill Schurmann, University of Rostock
–
Lunch
–
Coloring the Voronoi Tesselation of Lattices
Mathieu Dutour Sikiric, Institut Rudjer Boskovic
–
On Approximating the Covering Radius and Finding Dense Lattice Subspaces
Daniel Dadush, Centrum Wiskunde & Informatica