Rotem Oshman

  1. Title:
    On The Communication Complexity of Property Testing in Graphs
    Speaker:
    Rotem Oshman

    Link:
    http://www.birs.ca/events/2017/5-day-workshops/17w5147/videos/watch/201703231114-Oshman.html

  2. Title:
    CONGEST lower bounds : beyond two-party reductions
    Speaker:
    Rotem Oshman

    Link:
    http://www.birs.ca/events/2016/5-day-workshops/16w5152/videos/watch/201612010900-Oshman.html

  3. Title:
    The Role of Communication Complexity in Distributed Computing
    Speaker:
    Rotem Oshman

    Link:
    http://www.birs.ca/events/2014/5-day-workshops/14w5164/videos/watch/201408260918-Oshman.html

  4. Title:
    Mutual Exclusion with Faulty Memory
    Speaker:
    Rotem Oshman

    Link:
    http://www.birs.ca/events/2012/5-day-workshops/12w5122/videos/watch/201202071625-Oshman.html

  5. Title:
    The communication complexity of distributed subgraph detection
    Speaker:
    Rotem Oshman

    Link:
    https://www.ias.edu/video/csdm/2014/1006-RotemOshman

  6. Title:
    Tight Bounds for Set Disjointness in the Message-Passing Model
    Speaker:
    Rotem Oshman

    Link:
    https://www.ias.edu/video/csdm/1213/0506-RotemOshman

  7. Title:
    Distributed Certification
    Speaker:
    Rotem Oshman

    Link:
    http://www.birs.ca/events/2022/5-day-workshops/22w5124/videos/watch/202207261113-Oshman.html

  8. Title:
    Computationally Sound Proofs of Network Properties
    Speaker:
    Rotem Oshman

    Link:
    https://www.ias.edu/video/computationally-sound-proofs-network-properties