Erdős and Shannon: A Story of Probability, Communication, and Combinatorics

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


Duration: 56:30
2,751 views
61

Jacob Fox (Stanford University)
https://simons.berkeley.edu/events/richard-m-karp-distinguished-lecture-erdos-shannon-story-probability-communication
Richard M. Karp Distinguished Lecture



Other Videos By Simons Institute for the Theory of Computing


2023-07-11Validated Quantum Advantage via Bell Sampling
2023-07-11Verifiable Quantum Supremacy: What I Hope Will Be Done
2023-07-01Representation Theory in TCS and Extremal Combinatorics
2023-07-01On Perfectly Friendly Bisections of Random Graphs
2023-07-01Localization Schemes
2023-07-01Linearity Testing over the Biased Cube
2023-06-30Sparsifying Sums of Norms
2023-06-30It ain't over till it's over
2023-06-30Separating Quantum from Classical with k-fold Forrelation and Friends
2023-06-29Noise Stability - Beyond the Boolean cube
2023-06-29Erdős and Shannon: A Story of Probability, Communication, and Combinatorics
2023-06-29Fractional Pseudorandom Generators
2023-06-29Strong Bounds for 3-Progressions
2023-06-28Parallel Discrete Sampling via Continuous Walks
2023-06-28Unique Games and Expansion
2023-06-28Small-Set Expansion in the 2-Degree Short-Code Graph, the Easier Version
2023-06-27Product Mixing, Quantum Separation, and Comfortable Juntas
2023-06-27Explicit SoS Lower Bounds from (Small-Set) High Dimensional Expanders
2023-06-27Hypercontractivity Inequality on $\varepsilon$-product Spaces
2023-06-27Reverse Hypercotractivity and Improved Sampling in High Dimensional Expanders
2023-06-26Explicit Orthogonal and Unitary Designs


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Richard M. Karp Distinguished Lecture
Jacob Fox