Network Coding Conjecture implies Data Structure Lower Bounds STCS Seminar Speaker: Pavel DvorakOrganisers: Arkadev ChattopadhyayTime: Thursday, 15 April 2021, 17:45 to 18:45 Read more about Network Coding Conjecture implies Data Structure Lower Bounds
Two-and-a-half proofs of "the duality trick" STCS Student Seminar Speaker: Anamay Tengse, TIFR Organisers: Shubhada AgrawalTime: Friday, 9 April 2021, 17:15 to 18:15The fact that the polynomial (x1+...+xn)^d can be written as a poly(n,d)-sum of products of univariates is a consequence of what is popularly known as 'the duality trick' in the algebraic complexity circles. Read more about Two-and-a-half proofs of "the duality trick"
Generalization and Guessing STCS Student Seminar Speaker: Eeshan Modak, TIFR Organisers: Shubhada AgrawalTime: Friday, 26 March 2021, 17:15 to 18:15 Read more about Generalization and Guessing
Chasing Convex Functions STCS Colloquium Speaker: Anupam GuptaOrganisers: Arkadev ChattopadhyayTime: Tuesday, 23 March 2021, 16:00 to 17:00 Read more about Chasing Convex Functions
STCS Annual Symposium Symposium Organisers: Piyush SrivastavaTime: Friday, 19 March 2021, 09:00 to Saturday, 20 March 2021, 18:00Webpage: https://www.tifr.res.in/~piyush.srivastava/stcs-21/ Read more about STCS Annual Symposium
Tensor Rank and Algebraic Formula Lower Bounds STCS Student Seminar Speaker: Prerona Chatterjee, TIFR Organisers: Neha SangwanTime: Friday, 12 March 2021, 17:15 to 18:15 Read more about Tensor Rank and Algebraic Formula Lower Bounds
Existence of Strategy in Games STCS Student Seminar Speaker: Prabhat Kumar Jha, TIFR Organisers: Neha SangwanTime: Friday, 26 February 2021, 15:00 to 16:00 Read more about Existence of Strategy in Games
Banach-Tarski Paradox STCS Student Seminar Speaker: Abhishek KhetanOrganisers: Siddharth BhandariTime: Friday, 19 February 2021, 17:15 to 18:15 Read more about Banach-Tarski Paradox
Element distinctness using arbitrary binary gates STCS Student Seminar Speaker: Siddharth Bhandari, TIFR Time: Friday, 12 February 2021, 17:15 to 18:15 Read more about Element distinctness using arbitrary binary gates
Paper: Pseudorandom Generators from Polarizing Random Walks by Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, and Shachar Lovett Oral Qualifier Speaker: Ashutosh Shankar, TIFR Organisers: Prahladh HarshaTime: Friday, 5 February 2021, 11:30 to 12:30 https://theoryofcomputing.org/articles/v015a010/ Read more about Paper: Pseudorandom Generators from Polarizing Random Walks by Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, and Shachar Lovett