## Organisers:

## Time:

## Venue:

Fermat's two square theorem states that:

An odd prime p can be written as a sum of two squares if and only if p = 1 (mod 4)

Speaker:

Malhar Ajit Managoli, TIFR

Friday, 10 February 2023, 16:00 to 17:00

Fermat's two square theorem states that:

An odd prime p can be written as a sum of two squares if and only if p = 1 (mod 4)

Sabyasachi Chatterjee

Friday, 10 February 2023, 14:00 to 15:00

We formulate a general cross validation framework for signal denoising. The general framework is then applied to nonparametric regression methods such as Trend Filtering and Dyadic CART.

Speaker:

Shanthanu Suresh Rai, TIFR

Friday, 3 February 2023, 16:00 to 17:00

What is the largest number of edges in a graph of order n and girth g? For d-regular graphs, essentially the best known answer is provided by the Moore bound. This result can be extended to cover irregular graphs as well.

Nikhil Kumar

Tuesday, 31 January 2023, 09:30 to 10:30

We consider the problem of multicommodity flows in planar graphs. Okamura and Seymour showed that if all the demands are incident on one face, then the cut-condition is sufficient for routing demands.

Sourav Chakraborty

Friday, 27 January 2023, 16:00 to 17:00

We present a very simple and efficient sampling-based algorithm for estimating the union of sets in the streaming setting. Suppose we have a collection of sets S_1, . . .

Dr. Justin Gilmer

Tuesday, 24 January 2023, 09:30 to 10:30

I will introduce Frankl's. conjecture, discuss prior approaches and why it is a bit notorious.

Speaker:

Arghya Chakraborty, TIFR

Friday, 20 January 2023, 16:00 to 17:00

In any tournament between several participants, transitivity is sometimes not satisfied (i.e. A may defeat B, B defeats C and C in turn defeats A). In any case, we shall have to define a winner.

Raghav Somani

Tuesday, 17 January 2023, 16:00 to 17:00

Wasserstein gradient flows often arise from mean-field interactions among exchangeable particles.

Manideep Mamindlapally

Friday, 6 January 2023, 16:00 to 17:00

Quantum computers are in general believed to be more powerful than classical computers, but it is not clear if they are powerful enough to solve problems that a classical computer can’t even verify.

Nisheeth Vishnoi

Tuesday, 3 January 2023, 14:00 to 15:00

In this talk, I will discuss the following connections between private optimization and statistical physics in the context of the low-rank matrix approximation problem:

Neha Sangwan received the runner-up award for her poster at the Croucher Summer School on Information Theory held in Hong Kong

Shibashis Guha’s paper titled “A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct”, co-authored w

Three (3) graduate students from STCS, Prerona Chatterjee, Shubhada Agrawal and Sayantan Chakraborty, win the 2021 Google PhD Fellowship in Algorit

- ‹ previous
- 4 of 20
- next ›