## Organisers:

## Time:

## Venue:

An n × n Latin square is a grid with n rows and n columns such that each cell of the grid is filled with one number from the set {1,2,...n} and no number is repeated in any row or any column.

Speaker:

Kshitij Gajjar, TIFR

Friday, 20 January 2017, 16:00 to 17:30

An n × n Latin square is a grid with n rows and n columns such that each cell of the grid is filled with one number from the set {1,2,...n} and no number is repeated in any row or any column.

Abhishek Sinha

Friday, 20 January 2017, 11:30 to 13:00

One of the fundamental problems in Computer Networking is to efficiently transport packets belonging to different sessions, such as unicast, broadcast, multicast and anycast, collectively known as the generalized flows.

Speaker:

Abhishek Singh, TIFR

Friday, 13 January 2017, 16:00 to 17:30

A graph is said to be perfect if the chromatic number of every induced subgraph equals its clique number.

Kuldeep S. Meel

Wednesday, 11 January 2017, 11:00 to 12:30

Constrained counting and sampling are two fundamental problems in Computer Science with numerous applications, including network reliability, decision making under certainty, probabilistic reasoning, and constrained-random verification.

Rajesh Chitnis

Tuesday, 10 January 2017, 16:00 to 17:00

The classical approach for designing algorithms measures the time complexity only as a measure of the input size.

Swagato Sanyal

Friday, 6 January 2017, 16:00 to 17:30

Linear sketch complexity of a Boolean function f on a set of n inputs, introduced by Kannan, Mossel and Yaroslavtsev, is, in informal terms, the smallest integer d such that the value of the function can be concluded with high probability from the

Swagato Sanyal

Thursday, 5 January 2017, 11:30 to 12:30

Speaker:

Suhail Sherif, TIFR

Friday, 30 December 2016, 16:00 to 17:30

Lee and Zhang showed that the communication complexity of "f composed with g" is high when f is hard to approximate with a low degree polynomial (also g has to be from a good class of functions, more details will be given in the talk).

Riddhipratim Basu

Thursday, 29 December 2016, 11:30 to 12:30

Kardar, Parisi and Zhang introduced a universality class (the so-called KPZ universality class) in 1986 which is believed to explain the universal behaviour in a large class of two dimensional random growth models including first and last passage

Riddhipratim Basu

Wednesday, 28 December 2016, 16:00 to 17:00

Two metric spaces are said to be quasi isometric if their metrics are equivalent up to multiplicative and additive constants. This notion, introduced by Gromov (1981) for

Dr. Rahul Vaze, Fellow STCS, and Prof. Robert W. Health Jr. (University of Texas at Austin) win the 2011 EURASIP 2011 best paper award.

As a tribute to Homi Bhabha on his birth centenary year, a book entitled “Homi Bhabha and the Computer Revolution” edited by RK Shyamasundar (TIFR) and MA Pai (UIUC) is being released on 18 Feb 2011 at TIFR.

- ‹ previous
- 16 of 16