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
An Exploration of R ́enyi Divergence Based Upper Bounds on Generalization Error Project Presentation Speaker: Eeshan Modak, TIFR Organisers: Prahladh HarshaTime: Friday, 5 February 2021, 10:30 to 11:30 Read more about An Exploration of R ́enyi Divergence Based Upper Bounds on Generalization Error
Differential Games in Spread of Diseases. Project Presentation Speaker: Sushant Vijayan, TIFR Organisers: Prahladh HarshaTime: Friday, 5 February 2021, 09:30 to 10:30 Read more about Differential Games in Spread of Diseases.
An Introduction to Chordal Graphs And Clique Trees STCS Student Seminar Speaker: Vidya Sagar Sharma, TIFR Organisers: Sayantan ChakrabortyTime: Saturday, 30 January 2021, 17:15 to 18:15 Read more about An Introduction to Chordal Graphs And Clique Trees
Approximating a polynomial as a sum of simple polynomials STCS Colloquium Speaker: Neeraj KayalOrganisers: Arkadev ChattopadhyayTime: Tuesday, 26 January 2021, 16:00 to 17:00 Read more about Approximating a polynomial as a sum of simple polynomials
Secure Multiparty Computation with Limited Connectivity PhD Synopsis Seminar Speaker: Varun Narayanan, TIFR Time: Monday, 18 January 2021, 11:00 to 12:00 Information theoretically secure multiparty computation (MPC) is a central primitive in modern cryptography. Read more about Secure Multiparty Computation with Limited Connectivity
Hardness of Recognizing Geometric Intersection Graphs STCS Student Seminar Speaker: Kshitij GajjarOrganisers: Prerona ChatterjeeTime: Friday, 15 January 2021, 17:15 to 18:15 Read more about Hardness of Recognizing Geometric Intersection Graphs
Singularly Optimal Randomized Leader Election STCS Student Seminar Speaker: William K. Moses Jr.Time: Saturday, 9 January 2021, 10:00 to 11:00 Read more about Singularly Optimal Randomized Leader Election
Algebraic Natural Proofs: the plot thickens STCS Student Seminar Speaker: Anamay Tengse, TIFR Organisers: Eeshan ModakTime: Friday, 1 January 2021, 17:15 to 18:15In the late 1990s, a paper by Razborov and Rudich pointed out a barrier towards proving boolean circuit lower bounds. Read more about Algebraic Natural Proofs: the plot thickens
Accelerating Black Box Estimation of Distribution Tails Using Self structuring Importance Samplers STCS Student Seminar Speaker: Anand Deo, TIFR Organisers: Eeshan ModakTime: Friday, 18 December 2020, 17:15 to 18:15Motivated by the increasing adoption of models which facilitate greater automation in risk management and decision-making, this talk presents a novel Importance Sampling (IS) scheme for estimating distribution tails for a rich cl Read more about Accelerating Black Box Estimation of Distribution Tails Using Self structuring Importance Samplers
