STCS Colloquium

Communication Complexity of Randomness Manipulation

Speaker: 

Madhu Sudan

Organisers: 

Prahladh Harsha

Time: 

Wednesday, 29 May 2019, 11:00 to 12:00

Venue: 

Webpage: 

http://madhu.seas.harvard.edu/

Abstract:  The task of manipulating randomness has been a subject of intense investigation in computational complexity with dispersers, extractors, pseudorandom generators, condensers, mergers being just a few of the objects of interest.

Recovering Causality Graphs from Time Series Data

Speaker: 

Ravi R. Mazumdar

Organisers: 

Sandeep K Juneja

Time: 

Friday, 26 April 2019, 16:00 to 17:00

Venue: 

Webpage: 

https://uwaterloo.ca/electrical-computer-engineering/profile/mazum

Abstract: Suppose we have N time series available where one time-series could be causally dependent on others. For example, such dependence can be found in economic data or weather data.

Bring Down the Walls!: Why this is the right time for Theoreticians and Computer Architects to Talk

Speaker: 

Dipankar Das, Bharat Kaul, Abhisek Kundu

Organisers: 

Sandeep K Juneja

Time: 

Monday, 18 March 2019, 11:00 to 12:00

Venue: 

Abstract: Deep Learning has witnessed a 300,000X growth in compute demand in the last 6 years, matched equally by a growth in hardware capability – primarily riding on half precision compute and systolic arrays.

The Polynomial Method Strikes Back: Tight Quantum Query Bounds via Dual Polynomials

Speaker: 

Robin Kothari

Organisers: 

Pranab Sen

Time: 

Tuesday, 26 February 2019, 16:00 to 17:00

Venue: 

Webpage: 

http://www.robinkothari.com/

Abstract: The approximate degree of a Boolean function f is the least degree of a real polynomial that approximates f pointwise to error at most 1/3. Approximate degree is known to be a lower bound on quantum query complexity.

Uncovering Algebraic Structures in the MPC Landscape

Speaker: 

Manoj M. Prabhakaran

Organisers: 

Prahladh Harsha

Time: 

Tuesday, 30 April 2019, 16:00 to 17:00

Venue: 

Webpage: 

https://www.cse.iitb.ac.in/~mp/

Abstract: A fundamental open problem in information-theoretically secure multi-party computation (MPC) is to characterize functions which admit MPC protocols (say, secure against passive corruption), when more than 2 parties are i

The Frontiers of Machine Learning

Speaker: 

Sunita Sarawagi

Organisers: 

Prahladh Harsha

Time: 

Tuesday, 9 April 2019, 14:30 to 15:30

Venue: 

Webpage: 

https://www.cse.iitb.ac.in/~sunita/

Abstract: Machine Learning (ML) started as a niche field of computer science in the 80s and is now impacting several aspects of modern life.  I will start with an overview of the core ML primitives  that drive these tasks includin

Pages

Subscribe to RSS - STCS Colloquium