## Organisers:

## Time:

## Venue:

In this talk, we shall discuss the fully quantum Slepian Wolf theorem and it's proof (Winter et al).

Speaker:

Aditya Nema, TIFR

Friday, 29 June 2018, 17:15 to 18:15

In this talk, we shall discuss the fully quantum Slepian Wolf theorem and it's proof (Winter et al).

Mrinal Kumar

Wednesday, 27 June 2018, 14:00 to 15:00

A well known fact is that there are polynomials of degree 2 (for instance, inner product, or elementary symmetric polynomials of degree 2), such that any representation of these as a sum of product of affine forms requires Omega(n) summands, where

Speaker:

Sayantan Chakraborty, TIFR

Friday, 22 June 2018, 17:15 to 18:15

We shall discuss classical rate distortion, i.e., message compression with a distortion criterion, in the one-shot setting with and without side information at the decoder. The rate distortion problem with side information at the decoder is also c

Pritam Bhattacharya

Wednesday, 20 June 2018, 14:00 to 15:00

The art gallery problem deals with determining the minimum number of guards (or cameras) that are sufficient to cover or see every point in the interior of an art gallery, assuming that the guards have 360° visibility and can see an unbounded dist

Speaker:

Kshitij Gajjar, TIFR

Friday, 15 June 2018, 17:15 to 18:15

Hansel's lemma (not Hensel's lemma) states that if the complete graph on $n$ vertices can be expressed as the union of $r$ bipartite graphs $B_1,B_2,\ldots,B_r$ such that $n_i$ is the number of non-isolated vertices in $B_i$, then $n_1+n_2+\cdots+

Gérard Huet

Thursday, 7 June 2018, 16:00 to 17:00

The talk will discuss the delicate balance between theory and practice in software design, in light of the author’s experience.

P.R. Kumar

Thursday, 7 June 2018, 11:00 to 12:00

Inspired by classical results in real-time scheduling, we consider a model of an access point serving several flows, and provide a possibly surprising characterization of what throughput vectors feasible, as well as throughput-optimal scheduling p

Ravi Kannan

Wednesday, 6 June 2018, 17:00 to 18:00

A small random sample of rows/columns of any matrix is a decent proxy for the matrix, provided sampling probabilities are proportional to squared lengths.

Leonard J. Schulman

Monday, 4 June 2018, 16:00 to 17:00

There are several prominent computational problems for which simple iterative methods are widely preferred in practice despite an absence of runtime or performance analysis (or "worse", actual evidence that more sophisticated methods have superior

Rabin Patra

Friday, 1 June 2018, 16:00 to 17:00

Fixed and mobile access networks are still swamped by ever-increasing demand fueled from cloud computing and video.

Dr.Hariharan Narayanan joins the School of Technology and Computer Science as a Reader. Hariharan's research interests include manifold learning, randomized algorithms

Dr.Piyush Srivastava joins the School of Technology and Computer Science as a Reader.Piyush's research is on probability in computer science and often concerns question

- ‹ previous
- 4 of 17
- next ›