Playlist: 20 videos

Lattices: Geometry, Algorithms and Hardness

0:37:44

Integer Programming and Convolution, with Applications

Klaus Jansen, University of Kiel
https://simons.berkeley.edu/talks/integer-programming-and-convolution-applications
Lattices: Geometry Algorithms and Hardness
Visit talk page
0:30:38

On Minimal Support for Lattices and Semigroups

Timm Oertel, Cardiff University
https://simons.berkeley.edu/talks/minimal-support-lattices-and-semigroups
Lattices: Geometry Algorithms and Hardness
Visit talk page
0:28:11

Distance-Sparsity Transference for Lattice Points in Knapsack Polytopes

Iskander Aliev, Cardiff University
https://simons.berkeley.edu/talks/distance-sparsity-transference-lattice-points-knapsack-polytopes
Lattices: Geometry Algorithms and Hardness
Visit talk page
0:37:2

PPP-completeness with connections to Cryptography

Aikaterini Sotiraki​​​​, MIT
https://simons.berkeley.edu/talks/ppp-completeness-connections-cryptography
Lattices: Geometry Algorithms and Hardness
Visit talk page
0:18:42

Provable Sieving Algorithms for SVP and CVP in the l_p norm

Priyanka Mukhopadhyay, University of Waterloo
https://simons.berkeley.edu/talks/provable-sieving-algorithms-svp-and-cvp-lp-norm-0
Lattices: Geometry Algorithms and Hardness
Visit talk page
0:32:48

A Polynomial Time Algorithm for Solving the Closest Vector Problem for Lattices Related to Zonotopes

Frank Vallentin, Unversity of Cologne
https://simons.berkeley.edu/talks/polynomial-time-algorithm-solving-closest-vector-problem-lattices-related-zonotopes
Lattices: Geometry Algorithms and Hardness
Visit talk page
1:9:29

When Cryptography Meets Modern Channel Coding

Joseph J. Boutros, Texas A&M University
https://simons.berkeley.edu/talks/when-cryptography-meets-modern-channel-coding
Lattices: Geometry Algorithms and Hardness
Visit talk page
0:29:40

Lattice Packings: An Upper Bound on the Number of Perfect Lattices

Wessel van Woerden, CWI
https://simons.berkeley.edu/talks/lattice-packings-upper-bound-number-perfect-lattices
Lattices: Geometry Algorithms and Hardness
Visit talk page
0:26:58

A Simplex-Type Voronoi Algorithm Based on Short Vector Computations of Copositive Quadratic Forms

Achill Schurmann, University of Rostock
https://simons.berkeley.edu/talks/simplex-type-voronoi-algorithm-based-short-vector-computations-copositive-quadratic-forms
Lattices: Geometry Algorithms and Hardness
Visit talk page
0:39:49

Coloring the Voronoi Tesselation of Lattices

Mathieu Dutour Sikiric, Institut Rudjer Boskovic
https://simons.berkeley.edu/talks/coloring-voronoi-tesselation-lattices
Lattices: Geometry Algorithms and Hardness
Visit talk page