Foundations of Computing: Tal Rabin | Polylogues

Foundations of Computing: Tal Rabin | Polylogues

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=Wk61TF-t_X4


Duration: 27:29
468 views
6

A computer scientist at the University of Pennsylvania and a consultant to the Algorand Foundation, Tal Rabin conducts research on cryptography.

In this episode of Polylogues, former Simons Institute Journalist in Residence Siobhan Roberts sits down with Rabin to discuss her career and key developments in cryptographic research.

This video is the second installment of a three-part miniseries on the Foundations of Computing.



Other Videos By Simons Institute for the Theory of Computing


2021-12-02Matrix Multiplication, And The Asymptotic Spectrum Of Tensors
2021-12-02The Kronecker Coefficients Of The Symmetric Group In Complexity And Combinatorics
2021-12-02Two Tensor Optimization Problems From Quantum Information
2021-12-01Complexity Of Computing Complex Zeros Of Structured Polynomial Systems
2021-12-01Groups And Symmetries In Statistical Models
2021-12-01A Productization Property/Trick For H-Stable(And Hopefully Strongly Log-Concave) Polynomials
2021-12-01Panel on Making Predictions in a Quantum World | Quantum Colloquium
2021-12-01Making Predictions in a Quantum World | Quantum Colloquium
2021-12-01Sampling Matrices From Harish-Chandra-Itzykson-Zuber Densities
2021-11-30Continuous Maximum Entropy Distributions
2021-11-30Foundations of Computing: Tal Rabin | Polylogues
2021-11-30Constrained Optimization On Riemannian Manifolds
2021-11-30Near Optimal Sample Complexity For Matrix And Tensor Normal Models Via Geodesic Convexity
2021-11-30Computing The Nc-Rank Via Discrete Convex Optimization On Cat(0) Spaces
2021-11-29Norm Minimization, Invariant Theory, And Quantum Tomography
2021-11-19Discussion: Structure and RL
2021-11-17Panel on Verifiable Quantum Advantage | Quantum Colloquium
2021-11-17Interactive Protocols for Classically-Verifiable Quantum Advantage with an Ion-Trap Quantum Computer
2021-11-11On the Cryptographic Hardness of Learning Single Periodic Neurons
2021-11-11Worst-Case Robustness in Machine Learning
2021-11-11Computational trade-offs in graph models


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing