Arkadev Chattopadhyay

  1. Title:
    The Log-Approximate-Rank Conjecture is False
    Speaker:
    Arkadev Chattopadhyay

    Link:
    http://www.birs.ca/events/2019/5-day-workshops/19w5088/videos/watch/201907110904-Chattopadhyay.html

  2. Title:
    Topology Dependent Bounds on Rounds and Communication
    Speaker:
    Arkadev Chattopadhyay

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

  3. Title:
    The state-of-affairs in the Number-on-Forehead model
    Speaker:
    Arkadev Chattopadhyay

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

  4. Title:
    A little advice can be very helpful
    Speaker:
    Arkadev Chattopadhyay

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

  5. Title:
    A Little Advice Can Be Very Helpful
    Speaker:
    Arkadev Chattopadhyay

    Link:
    https://www.ias.edu/video/csdm/arkadev

  6. Title:
    CSDM - Lower Bounds for Circuits with $MOD_m$ Gates
    Speaker:
    Arkadev Chattopadhyay

    Link:
    https://www.ias.edu/video/csdm/mod_m

  7. Title:
    Lower Bounds for Circuits with $MOD_m$ Gates - Part II
    Speaker:
    Arkadev Chattopadhyay

    Link:
    https://www.ias.edu/video/lower-bounds-circuits-modm-gates-part-ii

  8. Title:
    Lower Bounds for Circuits with $MOD_m$ Gates - Part I
    Speaker:
    Arkadev Chattopadhyay

    Link:
    https://www.ias.edu/video/lower-bounds-circuits-modm-gates-part-i

  9. Title:
    Monotone Arithmetic Circuit Lower Bounds Via Communication Complexity
    Speaker:
    Arkadev Chattopadhyay

    Link:
    https://www.ias.edu/video/monotone-arithmetic-circuit-lower-bounds-communication-complexity