Integer points in irrational polyhedra and an extension of Presburger Arithmetic, ACO Seminar, Sep 2019, CMU.
Integer points in irrational polyhedra and an extension of Presburger Arithmetic, Combinatorics Seminar, Oct 2018, UMICH.
Presburger arithmetic and its computational complexity, Nov 2017, UMICH.
Presburger arithmetic and its computational complexity, Oct 2017, UIUC.
Presburger arithmetic and its computational complexity, Oct 2017, Indiana University.
Integer points, generating functions and computational complexity, Oct 2017, UChicago.
Short Presburger arithmetic is hard, FOCS, Oct 2017, Berkeley.
The complexity of integer points in polytopes, Claremont McKenna College, Sep 2017.
Complexity of integer points in convex polytopes, MSRI Geometric and Topological Combinatorics Program, Aug 2017.
Enumeration of Integer Points in Projections of Unbounded Polyhedra, IPCO, Jun 2017, Waterloo.
Short Generating Functions and Integer Points in Polyhedra, Southern California Discrete Math Symposium 2017, UCLA (poster).
Presburger arithmetic and integer points in polyhedra, Kansas University, Apr 2017.
The computational complexity of integer programming with alternations, UCLA, Mar 2017.
“What is Hilbert’s 10th problem?”, Graduate Students Seminar, May 2016, UCLA.
Computing Littlewood-Richardson coefficients is #P-complete, Jun 2016, UCLA.
The upper bound conjecture for simplicial spheres and Stanley’s proof, Feb 2016, UCLA.
The Levy-Khintchine representation of infinitely divisible distributions, Oct 2015, UCLA.