Berkeley in the 80s, Episode 1: Shafi Goldwasser VIDEO
The first episode in a series of video interviews with Turing Laureates whose award-winning research on the theory of computing was conducted at Berkeley.
“Berkeley in the 80s” features conversations with Shafi Goldwasser, Manuel Blum, Silvio Micali, Andrew Chi-Chih Yao, and Richard Karp.
"Berkeley in the 80s" was produced in tandem with the ACM A.M. Turing Colloquium series, which featured talks by Turing Laureates with ties to UC Berkeley -- either as current or past faculty members, or as alumni.
Watch the colloquium talks here:
https://www.youtube.com/playlist?list=PLJ66BAXN6D8FoDJH7N7gkNgTEmua5tyg_
Other Videos By Simons Institute for the Theory of Computing 2019-01-23 The Barrier Method and the Kadison-Singer Problem - A 2019-01-23 The Barrier Method and the Kadison-Singer Problem - B 2019-01-22 Ramanujan Graphs, Treelike Walks, and Mixed Characteristic Polynomials - A 2019-01-22 Ramanujan Graphs, Treelike Walks, and Mixed Characteristic Polynomials - B 2019-01-22 The Method of Interlacing Polynomials - B 2019-01-22 The Method of Interlacing Polynomials - A 2019-01-22 Real Stable Polynomials, Strongly Rayleigh Distributions, and Applications, Part I-B 2019-01-22 Real Stable Polynomials, Strongly Rayleigh Distributions, and Applications, Part I-A 2019-01-22 Real-Rooted Polynomials (problem session) 2019-01-22 Real-Rooted Polynomials 2018-12-20 Berkeley in the 80s, Episode 1: Shafi Goldwasser 2018-12-07 Fast Exact Algorithms Using Hadamard Product of Polynomials 2018-12-07 Torus Quotients in the Grassmannian 2018-12-07 Complexity of Separation of Variables and Splitting of Monomials 2018-12-07 Small-Depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication with Applications 2018-12-06 Near-Optimal Bootstrapping of Hitting Sets 2018-12-06 Generic vs Symbolic Behaviour, and Power Series Expansion 2018-12-06 Barriers for Rank Methods in Arithmetic Complexity 2018-12-06 Formal Series and Non-Commutative Computations 2018-12-06 Complete Derandomization of Identity Testing of Read-Once Formulas 2018-12-06 PIT Questions in Invariant Theory
Tags: Simons Institute
theoretical computer science
UC Berkeley
Berkeley in the 80s
Shafi Goldwasser