## Speaker:

## Time:

The Strahler number of a rooted tree is the largest height of a perfect binary tree that is its minor.

Thejaswini Raghavan

Friday, 23 July 2021, 17:15 to 18:15

The Strahler number of a rooted tree is the largest height of a perfect binary tree that is its minor.

Speaker:

Aparna Shankar, TIFR

Friday, 16 July 2021, 17:15 to 18:15

Expander graphs are sparse but highly connected graphs, which find a variety of uses in CS. If the vertices of an expander are labelled by 0 or 1, a $t$-step walk gives a $t$-bit string.

Speaker:

Pranshu Gaba, TIFR

Friday, 9 July 2021, 15:00 to 16:00

A directed graph is said to be k-vertex-connected if after deleting any k-1 vertices, therer is a directed path from every vertex to every other vertex along the directed edges.

Shweta Agrawal

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

Cryptography is a beautiful branch of theoretical computer science that seeks to provide guarantees to the art of secret keeping. The questions it poses are fundamental -- does the universe permit asymmetry of computation?

Karthikeyan Shanmugan

Monday, 28 June 2021, 09:00 to 10:00

One of the fundamental issues facing deployment of supervised learning models in real life applications is the issue of out-of-distribution (OOD) generalization.

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.

Nitin Saurabh

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

A Boolean function f on n variables is called a polymorphism of another Boolean function g on m variables if their operations commute.

Gorav Jindal

Friday, 11 June 2021, 17:15 to 18:15

Given n-variate polynomials f,g,h such that f=g/h, where both g and h are computable by arithmetic circuits of size s, we show that f can be computed by a circuit of size poly(s, deg(h)).

Speaker:

Anamay Tengse, TIFR

Wednesday, 9 June 2021, 14:30 to 15:30

We study hitting sets for polynomials computed by several algebraic models.

Deepesh Data, graduate student in STCS, wins the 2014 Microsoft Research India PhD Fellowship.

"Maximizing Utility Among Selfish Users in Social Groups"

Gugan Thoppe, a graduate student in the School of Technology and Computer Science, wins the IBM PhD Fellowship Award.

- ‹ previous
- 15 of 20
- next ›