## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

How should a group of friends decide which movie to watch together or which restaurant to go for dinner? How should a municipal corporation decide which set of public projects to undertake?

Swaprava Nath

Friday, 23 September 2016, 16:00 to 17:00

How should a group of friends decide which movie to watch together or which restaurant to go for dinner? How should a municipal corporation decide which set of public projects to undertake?

Speaker:

Prahladh Harsha, TIFR

Tuesday, 30 August 2016, 16:30 to 17:30

In this talk, we will survey questions related to polynomial approximations of AC0.

Bruce Hajek

Thursday, 11 August 2016, 11:30 to 12:30

Detecting or estimating a dense community from a network graph offers a rich set of problems involving the interplay of algorithms, complexity, and information limits.

Krishna Athreya

Monday, 25 July 2016, 16:00 to 17:00

Karl Weierstrass showed that given a continuous function $f$ on $[0,1]$ and an epsilon positive, there is a polynomial $p$ such that it is uniformly epsilon close to $f$ on $[0,1]$.

Santosh Nagarakatte

Friday, 5 August 2016, 15:00 to 16:00

Peephole optimizations perform local rewriting to improve the efficiency of the code input to the compiler.

Ness B. Shroff

Friday, 10 June 2016, 16:00 to 17:00

We are in the midst of a major data revolution. The total data generated by humans from the dawn of civilization until the turn of the new millennium is now being generated every two days.

Piyush Kurur

Monday, 25 April 2016, 16:00 to 17:00

Abstract: In many programming languages, values have an associated type that the compilers enforces. For example, adding a value of type INTEGER to a value of type STRING will be flagged as an error by these compilers.

Michal Koucky

Wednesday, 6 April 2016, 16:00 to 17:00

Abstract: The Hamming and the edit metrics are two common notions of measuring distances between pairs of strings $x,y$ lying in the Boolean hypercube.

Bruno Loff

Wednesday, 20 April 2016, 16:00 to 17:00

Abstract: Suppose that you have log(n) bits of free working memory, plus an additional poly(n) bits of auxiliary memory which is *full*.

Sumedh Tirodkar

Friday, 1 April 2016, 16:00 to 17:00

Abstract: In this series of two talks, we will investigate the power of randomized algorithms for the maximum cardinality matching (MCM) and the maximum weight matching (MWM) problems in the online preemptive model.