## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

Many networks and platforms centered around online populations have flourished in the last few decades, riding on the rapid proliferation of web technologies.

Avhishek Chatterjee

Friday, 28 April 2017, 12:00 to 13:00

Many networks and platforms centered around online populations have flourished in the last few decades, riding on the rapid proliferation of web technologies.

Venkat Anantharam

Thursday, 30 March 2017, 16:00 to 17:00

Many modern data sources arising from social networks, biological data, etc. are best viewed as indexed by combinatorial structures such as graphs, rather than as time series.

Virag Shah

Monday, 20 March 2017, 16:00 to 17:00

Online two-sided matching markets such as Q&A forums (e.g. StackOverflow, Quora) and online labour platforms (e.g.

Abhinav Ganesan

Friday, 3 March 2017, 15:30 to 16:30

Design of efficient sampling methodologies to capture the information content in sparse, and thus, "compressible" signals is well known as compressive sensing (CS) in the signal processing community.

Marc Vinyals

Tuesday, 14 February 2017, 16:00 to 17:00

Nowadays SAT solvers are able to solve problems with millions of variables, but some instances are still hard. While some formulas just require large time or memory to solve, other formulas allow to trade these resources.

Speaker:

Rahul Vaze, TIFR

Tuesday, 7 February 2017, 16:00 to 17:00

In a breakthrough, we are able to give a simple description of 'capacity' of cellular wireless networks. Shannon capacity is intractable for most wireless networks, and a surrogate definition is used.

Venkatesan Guruswami

Wednesday, 25 January 2017, 17:00 to 19:00

A subspace design is a (large) collection of subspaces of F_q^n, each of small co-dimension, such that for any low-dimensional subspace W, only a small number from the collection have a non-trivial intersection with W.

Sayan Bhattacharya

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

We consider the problem of maintaining a matching and a vertex cover of approximately maximum (resp. minimum) size in a dynamic graph under a sequence of edge insertions and deletions.

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.

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.