Pseudorandomness and Regularity in Graphs I

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


Duration: 55:15
925 views
7

David Conlon, University of Oxford
https://simons.berkeley.edu/talks/pseudorandomness-and-regularity-in-graphs-1
Pseudorandomness Boot Camp



Other Videos By Simons Institute for the Theory of Computing


2017-01-19Pseudorandom Generators I
2017-01-19Pseudorandomness and Regularity in Graphs III
2017-01-19Arithmetic Applications of Pseudorandomness III
2017-01-18Pseudorandomness and Regularity in Graphs II
2017-01-18Arithmetic Applications of Pseudorandomness II
2017-01-18Extractors and Expanders II
2017-01-18Fundamental Techniques in Pseudorandomness IV
2017-01-18Fundamental Techniques in Pseudorandomness III
2017-01-17Arithmetic Applications of Pseudorandomness I
2017-01-17Extractors and Expanders I
2017-01-17Pseudorandomness and Regularity in Graphs I
2017-01-17Fundamental Techniques in Pseudorandomness II
2017-01-17Fundamental Techniques in Pseudorandomness I
2016-12-19Probabilistic Call By Push Value
2016-12-09Programming Recurrence Relations
2016-12-09A Compositional Quantum Programming Language
2016-12-09About the Provenance of Truth
2016-12-09Composing Schema Mappings: An Overview
2016-12-08Completeness and Incompleteness of Quantum Diagram Reasoning
2016-12-08Linear Logic, Session Types and Deadlock-Freedom
2016-12-08Composing Strategies in Pebble Games


Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Pseudorandomness Boot Camp
David Conlon