## Speaker:

Mark M. Wilde

## Organisers:

## Time:

Thursday, 19 June 2014, 10:00 to 11:30

Mark M. Wilde

Thursday, 19 June 2014, 10:00 to 11:30

Mark M. Wilde

Wednesday, 18 June 2014, 15:00 to 16:30

Mark M. Wilde

Wednesday, 18 June 2014, 10:00 to 11:30

Mark M. Wilde

Tuesday, 17 June 2014, 14:30 to 16:00

Mark M. Wilde

Tuesday, 17 June 2014, 10:00 to 11:30

Mark M. Wilde

Monday, 16 June 2014, 15:00 to 16:30

Speaker:

Pritam Bhattacharya, TIFR

Friday, 6 June 2014, 14:30 to 16:00

Let s be a point source of light inside an n-sided polygon P. A polygonal path from s to some point t inside P is called a *diffuse reflection path* if the turning points of the path lie on edges of P.

Umang Bhaskar

Thursday, 5 June 2014, 12:00 to 13:00

Abstract: In many applications, users strategically choose paths in a network to minimize the congestion they face. Examples of such applications are road traffic, data networks, and machine scheduling.

Ashutosh Gupta

Monday, 26 May 2014, 16:00 to 17:00

Abstract: Extensionality axioms are common when reasoning about data collections, such as arrays and functions in program analysis, or sets in mathematics.

Speaker:

Girish Varma, TIFR

Friday, 23 May 2014, 10:00 to 11:00

Abstract: The Graph Coloring problem is to efficiently color the vertices of a graph on n vertices using as few colors as possible such that no edge is monochromatic.