## Speaker:

## Organisers:

## Time:

## Venue:

**Abstract:** The problem of ascertaining conditional independence or dependence is central to causal discovery and statistical inference in several dynamical systems, such as gene regulatory networks, fi

Himanshu Asnani

Monday, 15 October 2018, 14:30 to 15:30

**Abstract:** The problem of ascertaining conditional independence or dependence is central to causal discovery and statistical inference in several dynamical systems, such as gene regulatory networks, fi

Mohit Garg

Monday, 17 September 2018, 10:00 to 11:00

Abstract: The submodular welfare maximization problem (SWM) captures an important subclass of combinatorial auctions and has been extensively studied in various settings.

Alexandre Reiffers-Masson

Tuesday, 4 September 2018, 16:00 to 17:00

In this presentation, we adapt mathematical tools and models from Telecommunication Networks to Online Social networks.

Arup Bose

Friday, 31 August 2018, 14:30 to 15:30

Shivaram Kalyanakrishnan

Tuesday, 28 August 2018, 14:00 to 15:00

**Abstract: **Markov Decision Problems (MDPs) are a well-studied abstraction of sequential decision making. Policy Iteration (PI) is a classical, widely-used family of algorithms to compute an optimal policy for a given MDP.

Kunal Dutta

Friday, 20 July 2018, 14:00 to 15:00

**Abstract:** In this talk we shall see three very different areas of applications of combinatorics in mathematics and computer science, illustrating different flavours of combinatorial reasoning.

Andrew Heunis

Tuesday, 24 July 2018, 16:00 to 17:00

We address a problem of stochastic optimal control motivated by portfolio optimization in mathematical finance, the goal of which is to minimize the expected value of a general quadratic loss function of the wealth at close of trade when there is

Madhu Sudan

Wednesday, 11 July 2018, 14:00 to 15:00

I will describe a recent approach to designing codes that correct for "editing" errors - i.e., where an adversary is allowed to delete some of the symbols in a string being transmitted and insert new symbols. The classical Hamming model of errors

Abhik Ray

Friday, 6 July 2018, 14:30 to 15:30

Even though classical computers have evolved immensely in the past decades, there remain problems that we can never imagine solving on a classical computer in reasonable time.

Amey Bhangale

Tuesday, 3 July 2018, 14:00 to 15:00

A k-uniform hypergraph is defined to be q-rainbow colorable (q\leq k) if there exists a coloring of the vertex set with q colors such that every hyperedge contains all the q colors.