## Speaker:

## Organisers:

## Time:

In 1948, Claude Shannon wrote his landmark paper on "A mathematical theory of communication", which paved way to the field of information theory.

Lalitha Vadlamani

Thursday, 24 June 2021, 18:00 to 19:00

In 1948, Claude Shannon wrote his landmark paper on "A mathematical theory of communication", which paved way to the field of information theory.

Preethi Jyothi

Tuesday, 22 June 2021, 18:00 to 19:00

Artificial Intelligence, specifically machine learning (ML), has increasingly been making inroads into society and our lives over the last decade.

Pavel Dvorak

Thursday, 15 April 2021, 17:45 to 18:45

Network coding conjecture (NCC) by Li and Li asserts that network coding for undirected graphs does not bring any advantage over multicommodity flows.

Jatin Batra

Thursday, 10 December 2020, 16:00 to 17:00

Scheduling provides an interesting context for optimization methods.

Rohit Gupta

Tuesday, 24 November 2020, 14:00 to 15:00

Symmetry reduction is a well studied subject in geometric mechanics, where symmetries are usually described as an invariance under an action of a Lie group.

Siddharth Barman

Tuesday, 10 November 2020, 16:00 to 17:00

The cake-cutting problem provides a model for addressing fair allocation of a divisible resource (metaphorically, the cake) among agents with distinct preferences.

Ankit Garg

Tuesday, 20 October 2020, 16:00 to 17:00

The problem of learning arithmetic circuits is the following: given a polynomial as a black box that is promised to have a small arithmetic circuit computing it, can we find this arithmetic circuit?

Shay Moran

Tuesday, 6 October 2020, 16:00 to 17:00

Distributed learning protocols are designed to train on distributed data without gathering it all on a single centralized machine, thus contributing to the efficiency of the system and enhancing its privacy.

Eric Blais

Tuesday, 27 October 2020, 16:00 to 17:00

Randomness is a remarkably powerful tool in the design of algorithms. By giving algorithms the ability to use random bits and letting them err with some small probability, we can solve many computational problems with remarkable efficiency.

Meena Mahajan

Tuesday, 29 September 2020, 16:00 to 17:00

This talk will start with an overview of the relatively young field of QBF proof complexity, explaining the QBF proof system QURes, and an assessment of existing lower bound techniques.