Paper: Pseudorandom Generators from Polarizing Random Walks by Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, and Shachar Lovett Oral Qualifier Speaker: Aparna Shankar, TIFR Organisers: Prahladh HarshaTime: Friday, 5 February 2021, 11:30 to 12:30https://theoryofcomputing.org/articles/v015a010/ Read more about Paper: Pseudorandom Generators from Polarizing Random Walks by Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, and Shachar Lovett
Paper: The Capacity of Wireless Networks Oral Qualifier Speaker: Kumar Saurav, TIFR Organisers: Prahladh HarshaTime: Friday, 24 January 2020, 14:00 to 15:00 Venue: A-201 (STCS Seminar Room) Gupta, P., & Kumar, P. R. (2000). The capacity of wireless networks. IEEE Transactions on information theory, 46(2), 388-404. Read more about Paper: The Capacity of Wireless Networks
The Directed Subgraph Homeomorphism Problem Oral Qualifier Speaker: Vipin S, TIFR Organisers: Umang BhaskarTime: Tuesday, 28 January 2020, 14:00 to 15:30 Venue: A-201 (STCS Seminar Room) The Directed Subgraph Homeomorphism Problem", Fortune, Hopcroft and Wyllie, Theoretical Computer Science, 1980. Read more about The Directed Subgraph Homeomorphism Problem
