Past events

Communication Complexity and Quantum Optimization Lower Bounds via Query Complexity

Speaker:
Suhail Sherif
Organiser:
Arkadev Chattopadhyay
Date:
Monday, 17 May 2021, 17:00 to 18:00
Category:

Eluder dimension and sample complexity of Optimistic exploration

Speaker:
Sushant Vijayan
Organiser:
Anirban Bhattacharjee
Date:
Friday, 7 May 2021, 17:15 to 18:15

A Tale of Turing Machines, Quantum-Entangled Particles, and Operator Algebras

Speaker:
Henry Yuen (University of Toronto)
Organiser:
Anirban Bhattacharjee
Date:
Friday, 30 Apr 2021, 17:15 to 18:15

Singly Connected Vertex Deletion Problem

Speaker:
Avinandan Das (Institut de Recherche en Informatique Fondamentale, Paris)
Organiser:
Prabhat Kumar Jha
Date:
Friday, 23 Apr 2021, 17:15 to 18:15

Fair Cake Division

Speaker:
Nidhi Rathi (IISc Bangalore)
Organiser:
Prabhat Kumar Jha
Date:
Friday, 16 Apr 2021, 17:15 to 18:15

Network Coding Conjecture implies Data Structure Lower Bounds

Speaker:
Pavel Dvorak (Charles University, Prague)
Organiser:
Arkadev Chattopadhyay
Date:
Thursday, 15 Apr 2021, 17:45 to 18:45
Category:

Two-and-a-half proofs of "the duality trick"

Speaker:
Anamay Tengse
Organiser:
Shubhada Agrawal
Date:
Friday, 9 Apr 2021, 17:15 to 18:15

Generalization and Guessing

Speaker:
Eeshan Modak
Organiser:
Shubhada Agrawal
Date:
Friday, 26 Mar 2021, 17:15 to 18:15

Chasing Convex Functions

Speaker:
Anupam Gupta (Carnegie Mellon University)
Organiser:
Arkadev Chattopadhyay
Date:
Tuesday, 23 Mar 2021, 16:00 to 17:00
Category:

STCS Annual Symposium

Organiser:
Piyush Srivastava
Date:
Friday, 19 Mar 2021 09:00 to Saturday, 20 Mar 2021 18:00
Category: