Here are the videos and slides of this workshop on Information Theory in Complexity Theory and Combinatorics organized at the Simons Institute at Berkeley. But in the meantime here are the links to pages that generally features both the slides and the videos (and sometimes none of the two).
- Tutorial on Coding for Interactive Communication: Introduction and Overview Anup Rao, University of Washington
- Exponential Separation of Information and Communication Gillat Kol, Institute for Advanced Study, Princeton
- Small Value Parallel Repetition for General Games Ankit Garg, Princeton University
- Answering FAQs in CSPs, PGMs, Databases, Logic and Matrix Operation Atri Rudra, SUNY Buffalo
- Streaming Lower Bounds for Approximating MAX-CUT Michael Kapralov, IBM T.J. Watson Research Center
- Extended Formulations and Information Complexity Ankur Moitra, Massachusetts Institute of Technology
- Welfare Maximization with Limited Interaction: Information and Communication in Economics Omri Weinstein, Princeton University
- A New Look at Gallager's Bounds Nati Linial, Hebrew University of Jerusalem
- Tutorial on Efficient Coding for Interactive Communication via List Decoding Bernhard Haeupler, Carnegie Mellon University
- Relative Discrepancy Does Not Separate Information and Communication Complexity Sophie Laplante, Université Paris Diderot
- Internal Compression of Protocols to Entropy Shay Moran, Technion Israel Institute of Technology
- Lucky Talk: Exponential Separation of Information and Communication Gillat Kol, Institute for Advanced Study, Princeton
- Information Complexity for Multi-Party NIH Communication Rotem Oshman, Tel Aviv University
- Upper Bound on List-decoding Radius of Binary Codes Yury Polyanskiy, Massachusetts Institute of Technology
- On the Communication Complexity of Sparse Set Disjointness Gábor Tardos, Alfréd Rényi Institute of Mathematics
- Some Novel Computational Models to Think About D. Sivakumar, Google Research
- Tutorial on Capacity in Coding for Interactive Communication Ran Raz, Weizmann Institute and Institute for Advanced Study and Bernhard Haeupler, Carnegie Mellon University
- An Information Theoretic View of Hypercontractivity Ehud Friedgut, Weizmann Institute
- Equality, Revisited Hartmut Klauck, Nanyang Technological University
- Lucky Talk: Upper Bound on List-decoding Radius of Binary Codes Yury Polyanskiy, Massachusetts Institute of Technology
- Non-Signalling Parallel Repetition Using de Finetti Reductions Thomas Vidick, California Institute of Technology
- Limits to Efficient Preprocessing Andrew Drucker, University of Chicago
- Parallel Repetition for Entangled Games via Fast Quantum Search Henry Yuen, Massachusetts Institute of Technology
- Do Read Errors Matter for DNA Assembly? Thomas Courtade, UC Berkeley
- Tutorial on List Decodable Coding Schemes and Interactive Communication in Networks Klim Efremenko, Tel Aviv University and Ran Gelles, Princeton University
- Information Theory and Polyhedral Combinatorics Sebastian Pokutta, Georgia Institute of Technology
- Information Theory and Additive Combinatorics Mokshay Madiman, University of Delaware
- Lucky Talk: An Information Theoretic View of Hypercontractivity Ehud Friedgut, Weizmann Institute
- On Parallelizing Streaming Algorithms Makrand Sinha, University of Washington
- Streaming Interactive Proofs and Arthur-Merlin Communication Amit Chakrabarti, Dartmouth College
- A Communication Game Approach to the Sensitivity Conjecture Mike Saks, Rutgers University
- Deterministic Communication vs. Partition Number Toniann Pitassi, University of Toronto
- Interactive and Amortized Communication – An Information Theoretic Perspective Alon Orlitsky, UC San Diego
- Lucky Talk: A Communication Game Approach to the Sensitivity Conjecture Mike Saks, Rutgers University
- Counting Distinct Elements in the Message Passing Model David Woodruff, IBM Almaden
- Superlinear Lower Bounds for Multipass Graph Processing Krzysztof Onak, IBM T.J. Watson Research Center
- Tribes is Hard in the Message Passing Model Arkadev Chattopadhyay, Tata Institute of Fundamental Research
- Combinatorial Proofs of Concentration Bounds Thomas Holenstein, ETH Zürich
- How to Compress Asymmetric Communication Sivaramakrishnan Natarajan Ramamoorthy, University of Washington
- On Geometric Measures for Information Complexity T.S. Jayram, IBM Almaden
- Information Complexity is Computable Mark Braverman, Princeton University
Liked this entry ? subscribe to Nuit Blanche's feed, there's more where that came from. You can also subscribe to Nuit Blanche by Email, explore the Big Picture in Compressive Sensing or the Matrix Factorization Jungle and join the conversations on compressive sensing, advanced matrix factorization and calibration issues on Linkedin.
No comments:
Post a Comment