Birs- 22w5124: Communication Complexity and Applications, III
-
Title: The Approximate Degree of DNF and CNF Formulas
Speaker:
Link:
-
Title: Separating the Communication Complexity of Truthful and Non-Truthful Algorithms for Combinatorial Auctions
Speaker:
Link:
-
Title: Lower Bound Methods for Sign-rank and their Limitations
Speaker:
Link:
-
Title: Sketching and Streaming Complexity of Constraint Satisfaction Problems
Speaker:
Link:
-
Title: Strong XOR Lemma for Communication with Bounded Rounds
Speaker:
Link:
-
Title: Distributed Certification
Speaker:
Link:
-
Title: Factorial Lower Bounds for (Almost) Random Order Streams
Speaker:
Link:
-
Title: Proofs, Circuits, and Communication
Speaker:
Link:
-
Title: Symmetry and Quantum Query-to-Communication Simulation
Speaker:
Link:
-
Title: Memory Bounds for the Experts Problem
Speaker:
Link:
-
Title: Stronger 3SUM-Indexing Lower Bounds
Speaker:
Link:
-
Title: Blocky Rank
Speaker:
Link:
-
Title: Recent Advances in Multi-Pass Graph Streaming Lower Bounds
Speaker:
Link:
-
Title: A Guide to Estimating Entropy for the Forgetful and Impatient
Speaker:
Link: