–
Coffee and Check-In
–
Welcome Remarks
–
A Reverse Minkowski Theorem

Noah Stephens-Davidowitz, MIT
Video
–
Break
–
Successive Minima-Type Inequalities

 Martin Henk, Technische Universität Berlin
Video
–
Lunch
–
Short Simplex Paths in Lattice Polytopes

Alberto del Pia, University of Wisconsin, Madison
Video
–
The n by n by n Cube and a Hyperplane

Imre Barany, Rényi Institute
Video
–
Break
–
New Bounds on the Covering Density

Barak Weiss, Tel Aviv University
Video
–
Reception
–
Coffee and Check-In
–
An LLL Algorithm for Module Lattices

Alice Pellet-Mary, KU Leuven
Video
–
Break
–
Algorithms for the k-List Problems

Elena Kirshanova, Immanuel Kant Baltic Federal University
Video
–
Lunch
–
New Reductions and Algorithms for Ideal Lattices via Arakelov Random Walks

Leo Ducas, ,
Centrum Wiskunde & Informatica,
& Benjamin Wesolowski,
, EPFL
Video
–
Challenges in Evaluating Costs of known Lattice Attacks

Tanja Lange, Technische Universiteit Eindhoven,
Daniel J. Bernstein, University of Illinois at Chicago & Ruhr University Bochum
Video
–
Break
–
On the Concrete Security of LWE with Small Secret

Lynn Chua, UC Berkeley
Video
–
Open Problems
–
Coffee and Check-In
–
Integer Programming and Convolution, with Applications

Klaus Jansen,
, University of Kiel
Video
–
Break
–
On Minimal Support for Lattices and Semigroups

Timm Oertel, Cardiff University
Video
–
Distance-Sparsity Transference for Lattice Points in Knapsack Polytopes

Iskander Aliev, Cardiff University
Video
–
Lunch
–
PPP-completeness with connections to Cryptography

Aikaterini Sotiraki​​​​, MIT
Video
–
Provable Sieving Algorithms for SVP and CVP in the l_p norm

 Priyanka Mukhopadhyay, Unviersity of Waterloo
Video
–
Break
–
A Polynomial Time Algorithm for Solving the Closest Vector Problem for Lattices Related to Zonotopes

Frank Vallentin, Unversity of Cologne
Video
–
Coffee and Check-In
–
When Cryptography Meets Modern Channel Coding

Joseph J. Boutros, Texas A&M University
Video
–
Break
–
Lattice Packings: An Upper Bound on the Number of Perfect Lattices

Wessel van Woerden, CWI
Video
–
A Simplex-Type Voronoi Algorithm Based on Short Vector Computations of Copositive Quadratic Forms

Achill Schurmann, University of Rostock
Video
–
Lunch
–
Coloring the Voronoi Tesselation of Lattices

Mathieu Dutour Sikiric, Institut Rudjer Boskovic
Video
–
On Approximating the Covering Radius and Finding Dense Lattice Subspaces

Daniel Dadush, Centrum Wiskunde & Informatica
Video