Birs- 22w5124: Communication Complexity and Applications, III

  1. Title:
    The Approximate Degree of DNF and CNF Formulas

    Speaker:

    Link:

  2. Title:
    Separating the Communication Complexity of Truthful and Non-Truthful Algorithms for Combinatorial Auctions

    Speaker:

    Link:

  3. Title:
    Lower Bound Methods for Sign-rank and their Limitations

    Speaker:

    Link:

  4. Title:
    Sketching and Streaming Complexity of Constraint Satisfaction Problems

    Speaker:

    Link:

  5. Title:
    Strong XOR Lemma for Communication with Bounded Rounds

    Speaker:

    Link:

  6. Title:
    Distributed Certification

    Speaker:

    Link:

  7. Title:
    Factorial Lower Bounds for (Almost) Random Order Streams

    Speaker:

    Link:

  8. Title:
    Proofs, Circuits, and Communication

    Speaker:

    Link:

  9. Title:
    Symmetry and Quantum Query-to-Communication Simulation

    Speaker:

    Link:

  10. Title:
    Memory Bounds for the Experts Problem

    Speaker:

    Link:

  11. Title:
    Stronger 3SUM-Indexing Lower Bounds

    Speaker:

    Link:

  12. Title:
    Blocky Rank

    Speaker:

    Link:

  13. Title:
    Recent Advances in Multi-Pass Graph Streaming Lower Bounds

    Speaker:

    Link:

  14. Title:
    A Guide to Estimating Entropy for the Forgetful and Impatient

    Speaker:

    Link: