## Organisers:

## Time:

## Venue:

Abstract: In the first half of this talk, I will talk about the halting problem and show that there are well defined functions f:N->N that no computable function can dominate.

Speaker:

Suhail Sherif, TIFR

Friday, 10 October 2014, 14:00 to 15:30

Abstract: In the first half of this talk, I will talk about the halting problem and show that there are well defined functions f:N->N that no computable function can dominate.

Madhu Sudan

Saturday, 4 October 2014, 11:30 to 13:00

In a seminal work in 1992, Schulman raised the question of whether an interaction can be protected from errors that occur on a noisy channel.

Monday, 29 September 2014, 10:00 to Tuesday, 30 September 2014, 17:00

STCS symposium is an annual event.

Speaker:

Pritam Bhattacharya, TIFR

Friday, 26 September 2014, 14:00 to 15:30

Abstract: The VERTEX GUARD (VG) problem is defined as follows: Given a polygon P (with holes allowed) with n vertices, find a smallest subset S of the set of vertices of P such that every point in the polygon P can be

Speaker:

Gowtham Raghunath Kurri, TIFR

Friday, 19 September 2014, 14:00 to 15:30

Abstract: We discuss a proof of the classical CLT (in Wasserstein metric) using Stein's Lemma.

Izhak Shafran

Wednesday, 3 September 2014, 15:00 to 16:00

Abstract: Speech recognizers are typically trained with data from a standard dialect and do not generalize to non-standard dialects.

Speaker:

Ankush Agarwal, TIFR

Tuesday, 26 August 2014, 14:30 to 16:00

Abstract: In this thesis, we develop computational algorithms in a number of different regimes for pricing financial *American* options.

Satwik Mukherjee

Friday, 22 August 2014, 14:00 to 15:30

Abstract: I will sketch the proof as given by C. Reiher.

Ankit Garg

Thursday, 21 August 2014, 16:00 to 17:00

Abstract: We prove a parallel repetition theorem for general games with value tending to 0. Previously Dinur and Steurer proved such a theorem for the special case of projection games. We use information theoretic techniques in our proof.

Krishna B. Athreya

Thursday, 14 August 2014, 16:00 to 17:00

Deepesh Data, graduate student in STCS, wins the 2014 Microsoft Research India PhD Fellowship.

"Maximizing Utility Among Selfish Users in Social Groups"