With John Wright‘s talk last week, the Spring ’19 season of TCS+ concluded. Thanks to all our followers who tuned in, everyone who suggested a talk or spread the word, and, of course, thanks to all our speakers!
For those who missed a talk, or would like to watch them again in the comfort of your home, institution, or on the seaside: all past talks are now uploaded and available, along with the speakers’ slides.
- Ran Canetti (Boston University and Tel Aviv University) on Fully Bideniable Interactive Encryption
- Sepehr Assadi (Princeton) on A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling
- Shayan Oveis Gharan (University of Washington) on Strongly log concave polynomials, high dimensional simplicial complexes, and an FPRAS for counting Bases of Matroids
- Aleksandar Nikolov (University of Toronto) on Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems
- Richard Peng (Georgia Tech) on Fully Dynamic Spectral Vertex Sparsifiers and Applications
- Thatchaphol Saranurak (TTIC) on Breaking Quadratic Time for Small Vertex Connectivity
- Chris Peikert (University of Michigan) on Noninteractive Zero Knowledge for NP from Learning With Errors
- Ewin Tang (University of Washington) on Quantum-inspired classical linear algebra algorithms: why and how?
- Lior Kamma (Aarhus University) on Lower Bounds for Multiplication via Network Coding
- John Wright (MIT) on NEEXP in MIP*
Have a great summer, and see you in the Fall!