## Organisers:

## Time:

## Venue:

## Webpage:

One of the basic questions in complexity theory is how the complexity of computing $k$ instances of a function relates to the complexity of computing a single instance.

Speaker:

Sagnik Mukhopadhyay, TIFR

Friday, 16 September 2016,

16:00 to 17:30

One of the basic questions in complexity theory is how the complexity of computing $k$ instances of a function relates to the complexity of computing a single instance.

Speaker:

Phani Raj Lolakapuri, TIFR

Wednesday, 14 September 2016,

14:00 to 15:30

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 due to congestion.

Speaker:

Prerona Chatterjee, TIFR

Friday, 9 September 2016,

16:00 to 17:30

The compactness theorem states that there is a model for an infinite set S of propositional formulas, if and only if, there is a model for every finite subset of S.

Speaker:

Anand Deo, TIFR

Friday, 2 September 2016,

16:00 to 17:30

The Brownian motion is one of the most interesting and useful of all Stochastic Processes. It has an enormous range of applications ranging from physics (Einstein) to finance (starting with Bachelier).

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.

Mrinal Kumar

Tuesday, 23 August 2016,

16:00 to 17:00

We will show that there is a family of n- variate polynomials of degree d = O(log^2 n), which can be computed by linear sized homogeneous depth-5 arithmetic circuits, where as any homogeneous depth-4 circuit computing it must have size at least n^

Jenish Mehta

Friday, 12 August 2016,

16:00 to 17:30

Cheeger inequalities in spectral graph theory help to comment on the approximate connectivity or expansion of a graph (a combinatorial property) from the eigenvalues of the adjacency matrix of the graph (an algebraic property).

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.

Animesh Kumar

Tuesday, 9 August 2016,

16:00 to 17:00

Remote sensing with a distributed array of stationary sensors or a mobile sensor has been of great interest.

Viral Acharya

Friday, 5 August 2016,

16:00 to 17:00

The financial crisis of 2007‐2009 has given way to the sovereign debt crisis of 2010‐2012, yet many of the banking issues remain the same. We discuss a method to estimate the capital that a financial firm would need to rais

Dr. Ashutosh Gupta joins the School of Technology and Computer Science as a Reader.

- ‹ previous
- 3 of 12
- next ›