Birs- 17w5147: Communication Complexity and Applications, II
-
Title: Direct product theorems in communication
Speaker:
Link:
-
Title: Optimal lower bound for samplers, finding duplicates, and universal relation
Speaker:
Link:
-
Title: Some New Questions in Communication Complexity
Speaker:
Link:
-
Title: On Multi-Party Peer-to-Peer Information Complexity
Speaker:
Link:
-
Title: Lower bounds on non-adaptive data structures for median and predecessor search
Speaker:
Link:
-
Title: A Nearly Optimal Lower Bound on the Approximate Degree of $AC^0$
Speaker:
Link:
-
Title: Query-to-Communication Lifting
Speaker:
Link:
-
Title: Linear Sketching using Parities
Speaker:
Link:
-
Title: Non-adaptive Data Structure Lower Bounds for Predecessor Search
Speaker:
Link:
-
Title: Quantum information complexity
Speaker:
Link:
-
Title: Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds (Part I)
Speaker:
Link:
-
Title: Compressing Interactive Communication under Product Distributions
Speaker:
Link:
-
Title: Information Theory and Extended Formulations
Speaker:
Link:
-
Title: Lookup functions for separating randomized communication, quantum communication and approximate log-rank
Speaker:
Link:
-
Title: Lower bounds for (Streaming) Approximation to MAX-CUT
Speaker:
Link:
-
Title: Sketching and Streaming Matrix Norms
Speaker:
Link:
-
Title: On The Communication Complexity of Property Testing in Graphs
Speaker:
Link:
-
Title: Strong Lower Bounds for Multi-Party Equality with Applications
Speaker:
Link:
-
Title: Optimality of the Johnson-Lindenstrauss Lemma
Speaker:
Link:
-
Title: Common Randomness Generation
Speaker:
Link: