## Organisers:

## Time:

## Venue:

## Webpage:

Consider a service utility where customers arrive over time, and the server is lazy and wants to serve customers with as little effort as possible.

Speaker:

Rahul Vaze, TIFR

Wednesday, 1 June 2016,

14:00 to 15:30

Consider a service utility where customers arrive over time, and the server is lazy and wants to serve customers with as little effort as possible.

Speaker:

Varun Narayanan, TIFR

Friday, 27 May 2016,

16:00 to 17:30

A randomized algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space was proposed by Martin Dyer, Alan Frieze and Ravi Kannan in 1988.

Speaker:

Ashutosh Gupta, TIFR

Thursday, 26 May 2016,

11:00 to 12:30

Computer science (CS) has emerged in last 40+ years to be a branch of science on its own. The concerns in CS involve all the way from fundamentals of mathematics to designing usable social networking apps.

Anirban Dasgupta

Tuesday, 24 May 2016,

11:00 to 12:00

A set function on a ground set of size n is approximately modular if it satisfies every modularity requirement to within an additive error;approximate modularity is the set analog of approximate linearity.

Speaker:

Rakesh Venkat, TIFR

Monday, 23 May 2016,

14:00 to 15:30

We consider the following three problems in the areas of Algorithms, Complexity theory and Streaming algorithms respectively.

Speaker:

Swagato Sanyal, TIFR

Friday, 20 May 2016,

10:30 to 11:30

Boolean functions are central to computer science. This presentation will focus on Boolean functions from the perspective of certain measures of complexity.

Abhishek Behera

Friday, 13 May 2016,

16:00 to 17:30

In this talk we will introduce the optimal transportation problem and mention some of its applications. We will then present the duality theory for the optimal transportation problem.

Speaker:

Jaikumar Radhakrishnan, TIFR

Thursday, 12 May 2016,

17:30 to 19:00

There are an equal number of eligible women and men in a village. They have their preferences.

Speaker:

Varun Narayanan, TIFR

Tuesday, 10 May 2016,

16:00 to 17:30

Groebner basis for a multivariate polynomial ideal is a finite basis of polynomials that has many useful properties. Large memory requirements and computation time for most practical problems hinder the use of Groebner basis in many areas.

Speaker:

Nikhil S Mande, TIFR

Friday, 6 May 2016,

16:00 to 17:00

We will talk about the notion of the sign-rank of a {-1, 1}-valued matrix, which measures the robustness of it's rank under sign preserving changes. We will first see a neat geometric interpretation of the sign-rank, and then see how showing an u

Dr. Simoni Shah was awarded the Sasken Best Thesis Award for the year 2013-14 for her Ph.D.

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

- ‹ previous
- 2 of 11
- next ›