## Organisers:

## Time:

## Venue:

Abstract: An atomic splittable routing game (ASRG) is a network congestion problem where each player has some finite amount of flow he wants to send in the network, while minimizing his cost.

Speaker:

Phani Raj Lolakapuri, TIFR

Monday, 8 February 2016, 16:00 to 17:00

Abstract: An atomic splittable routing game (ASRG) is a network congestion problem where each player has some finite amount of flow he wants to send in the network, while minimizing his cost.

Aseem Rastogi

Monday, 22 February 2016, 15:00 to 16:00

Abstract: Applications that combine code and data from multiple sources are hard to program and even harder to get right. For example, cryptographic protocols for Secure Multi-party Computation (SMC) are known for a long time.

Speaker:

Phani Raj Lolakapuri, TIFR

Friday, 29 January 2016, 16:00 to 17:00

Abstract: In 1853, Liouville proved a fundamental result concerning approximations of algebraic numbers by rationals, which said one can't approximate algebraic numbers "well" using rationals.

Amey Karkare

Tuesday, 9 February 2016, 16:00 to 17:00

Abstrat: Current garbage collectors leave much heap-allocated data uncollected because they preserve data reachable from a root set.

Manjunath Krishnapur

Tuesday, 23 February 2016, 16:00 to 17:00

Abstract: S. Ghosh and Y. Peres showed that in certain point processes, the configuration outside a bounded domain determines the number of points of the process inside the domain (and in some cases even the center of mass).

Speaker:

Gowtham Raghunath Kurri, TIFR

Wednesday, 20 January 2016, 14:00 to 15:00

Abstract: The correlation of a quantum system *A *to an initially correlated system *E * generally decreases when *A *undergoes an evolution separated from *E*.

Andrej Bogdanov

Wednesday, 2 March 2016, 16:00 to 17:00

Abstract: A $t$-out-of-$n$ threshold secret sharing scheme is a protocol for sharing a secret among $n$ parties so that no $t -1$ parties gain any information about the secret but any $t$ parties can recover the secret.

Amit Kumar

Tuesday, 29 March 2016, 16:00 to 17:00

Abstract: Given a set of points $P$ in a $d$-dimensional Euclidean space, the $k$-means clustering problem seeks to find a set $C$ of $k$ centers such that the sum over all points in $P$ of the square of the distance to the closest center in $C$ i

Speaker:

Aditya Nema, TIFR

Wednesday, 20 January 2016, 15:00 to 16:00

Abstract : Research in quantum information theory suggests that if a quantum channel is used to transmit classical information then the capacity (also referred to as classical capacity) of a quantum channel is super additive.

Piyush Srivastava

Friday, 22 January 2016, 11:30 to 12:30

Abstract: Probabilistic graphical models provide a very useful framework for studying several problems across theoretical computer science and statistics.