Combinatorial Proofs of Concentration Bounds

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


Duration: 31:31
793 views
18

Thomas Holenstein, ETH Zürich
Information Theory in Complexity Theory and Combinatorics
http://simons.berkeley.edu/talks/thomas-holenstein-2015-04-24



Other Videos By Simons Institute for the Theory of Computing


2015-04-27Streaming Lower Bounds for Approximating MAX-CUT
2015-04-27Answering FAQs in CSPs, PGMs, Databases, Logic and Matrix Operations
2015-04-27Exponential Separation of Information and Communication
2015-04-27Small Value Parallel Repetition for General Games
2015-04-27Welfare Maximization with Limited Interaction: Information and Communication in Economics
2015-04-27Information Complexity for Multi-Party NIH Communication
2015-04-27Lucky Talk: Exponential Separation of Information and Communication
2015-04-27Extended Formulations and Information Complexity
2015-04-27Relative Discrepancy Does Not Separate Information and Communication Complexity
2015-04-27A New Look at Gallager's Bounds
2015-04-27Combinatorial Proofs of Concentration Bounds
2015-04-27Tribes is Hard in the Message Passing Model
2015-04-27How to Compress Asymmetric Communication
2015-04-27Do Read Errors Matter for DNA Assembly?
2015-04-08Interactive Information: Applications and New Directions
2015-03-25Lucky Talk: An Algorithmic Characterization of a Class of Inequalities
2015-03-25Strong Data Processing Inequalities and Estimation with Constraints
2015-03-25Low-Rank Matrix Recovery Through Rank-One Projections
2015-03-25Adaptive Coding over Countable Alphabets
2015-03-25Fundamental Limit of Community Detection in Stochastic Block Models
2015-03-25Constrained Rank Aggregation and Correlation Clustering


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Information Theory
Thomas Holenstein