Events: STCS Seminar

A sublinear time algorithm for approximately perfect matchings in regular graphs

Speaker:
Varsha Dani (Golisano College of Computing and Information Sciences, Rochester Institute of Technology, U.S.A.)
Organiser:
Prahladh Harsha
Date:
Tuesday, 8 Aug 2023, 16:00 to 17:00
Venue:
A201
Category:

Fast Algorithms for Regression Problems

Speaker:
Deeksha Adil (ETH Zurich, Switzerland)
Organiser:
Prahladh Harsha
Date:
Monday, 24 Jul 2023, 16:00 to 17:00
Venue:
A201
Category:

Strong bounds for three-term progressions (Part II)

Speaker:
Raghu Meka (University of California, Los Angeles)
Organiser:
Prahladh Harsha
Date:
Friday, 21 Jul 2023, 11:00 to 12:00
Venue:
AG-69
Category:

Majority-3SAT in Polynomial Time

Speaker:
Ratnakar Medepalli
Organiser:
Ramprasad Saptharishi
Date:
Friday, 14 Jul 2023, 14:00 to 15:00
Venue:
A201
Category:

A Sanov-type theorem for unimodular marked random graphs and its applications

Speaker:
Sarath Yasodharan (Brown University, U.S.A.)
Organiser:
Piyush Srivastava
Date:
Wednesday, 12 Jul 2023, 16:00 to 17:00
Venue:
A201
Category: