Birs- 17w5147: Communication Complexity and Applications, II

  1. Title:
    Direct product theorems in communication

    Speaker:

    Link:

  2. Title:
    Optimal lower bound for samplers, finding duplicates, and universal relation

    Speaker:

    Link:

  3. Title:
    Some New Questions in Communication Complexity

    Speaker:

    Link:

  4. Title:
    On Multi-Party Peer-to-Peer Information Complexity

    Speaker:

    Link:

  5. Title:
    Lower bounds on non-adaptive data structures for median and predecessor search

    Speaker:

    Link:

  6. Title:
    A Nearly Optimal Lower Bound on the Approximate Degree of $AC^0$

    Speaker:

    Link:

  7. Title:
    Query-to-Communication Lifting

    Speaker:

    Link:

  8. Title:
    Linear Sketching using Parities

    Speaker:

    Link:

  9. Title:
    Non-adaptive Data Structure Lower Bounds for Predecessor Search

    Speaker:

    Link:

  10. Title:
    Quantum information complexity

    Speaker:

    Link:

  11. Title:
    Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds (Part I)

    Speaker:

    Link:

  12. Title:
    Compressing Interactive Communication under Product Distributions

    Speaker:

    Link:

  13. Title:
    Information Theory and Extended Formulations

    Speaker:

    Link:

  14. Title:
    Lookup functions for separating randomized communication, quantum communication and approximate log-rank

    Speaker:

    Link:

  15. Title:
    Lower bounds for (Streaming) Approximation to MAX-CUT

    Speaker:

    Link:

  16. Title:
    Sketching and Streaming Matrix Norms

    Speaker:

    Link:

  17. Title:
    On The Communication Complexity of Property Testing in Graphs

    Speaker:

    Link:

  18. Title:
    Strong Lower Bounds for Multi-Party Equality with Applications

    Speaker:

    Link:

  19. Title:
    Optimality of the Johnson-Lindenstrauss Lemma

    Speaker:

    Link:

  20. Title:
    Common Randomness Generation

    Speaker:

    Link: