Superlinear Lower Bounds for Multipass Graph Processing

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


Duration: 34:41
208 views
2

Krzysztof Onak, IBM T.J. Watson Research Center
Information Theory in Complexity Theory and Combinatorics
http://simons.berkeley.edu/talks/krzysztof-onak-2015-04-24



Other Videos By Simons Institute for the Theory of Computing


2015-05-12Quantum Error Correction
2015-05-12QEC in AdS/CFT
2015-05-12MERA and Holography
2015-05-12Black Holes, Firewalls, and Chaos
2015-05-12Tensor Networks and Gravity
2015-05-08Modern Coding Theory — Many Ideas, One Goal
2015-04-28Upper Bound on List-decoding Radius of Binary Codes
2015-04-28On the Communication Complexity of Sparse Set Disjointness
2015-04-28Lucky Talk: An Information Theoretic View of Hypercontractivity
2015-04-28A Communication Game Approach to the Sensitivity Conjecture
2015-04-28Superlinear Lower Bounds for Multipass Graph Processing
2015-04-28Lucky Talk: Upper Bound on List-decoding Radius of Binary Codes
2015-04-28Equality, Revisited
2015-04-28Tutorial on Capacity in Coding for Interactive Communication (Part 2 of 2)
2015-04-28An Information Theoretic View of Hypercontractivity
2015-04-28Interactive and Amortized Communication – An Information Theoretic Perspective
2015-04-28Tutorial on Capacity in Coding for Interactive Communication (Part 1 of 2)
2015-04-28Tutorial on List Decodable Coding Schemes and Interactive Communication in Networks (Part 1 of 2)
2015-04-28Information Theory and Polyhedral Combinatorics
2015-04-28Some Novel Computational Models to Think About
2015-04-28Tutorial on List Decodable Coding Schemes and Interactive Communication in Networks (Part 2 of 2)


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Information Theory
Krzysztof Onak