## Speaker:

## Organisers:

## Time:

## Venue:

This would be an elementary and concrete introduction to classical projective geometry. We'd start with Euclidean geometry of points, lines and circles.

Ashwin Deopurkar

Friday, 11 May 2018, 17:15 to 18:15

This would be an elementary and concrete introduction to classical projective geometry. We'd start with Euclidean geometry of points, lines and circles.

Abhishek Khetan

Friday, 4 May 2018, 17:15 to 18:15

In this talk we will discuss a topological proof of the fundamental theorem of algebra which states that any non-constant polynomial over the field of complex numbers has a complex root.

Speaker:

Neha ., TIFR

Friday, 27 April 2018, 16:00 to 17:00

In this talk, we will discuss the multiplicative weights algorithm and its application in approximately finding the optimal row and column strategies in a two player, zero sum game.

Arindam Khan

Thursday, 26 April 2018, 10:00 to 11:00

Multidimensional packing problems find numerous applications in robotics, cloud computing, smart-grids and many other scheduling and resource allocation problems.

Atreyee Kundu

Wednesday, 25 April 2018, 11:30 to 12:30

Switched systems find wide applications in power systems and power electronics, automotive control, aircraft and air traffic control, network and congestion control, etc.

Soumen Chakrabarti

Tuesday, 24 April 2018, 14:30 to 15:30

Web search has come a long way from matching query words with document words. It is now mediated by knowledge graphs (KGs) such as Freebase, having hundreds of millions of entities belonging to tens of thousands of types, connected by billions of

Speaker:

Anamay Tengse, TIFR

Friday, 20 April 2018, 17:15 to 18:15

In this talk we will look at $n$-variate polynomials that can be expressed as a small (poly$(n)$) sum of powers of linear polynomials. That is, polynomials that have efficient {\em depth-3-powering} circuits.

Speaker:

Nikhil S Mande, TIFR

Tuesday, 17 April 2018, 16:00 to 17:30

Given a boolean function $f : \{0, 1\}^n \rightarrow \{0, 1\}$ define the function $f \circ \mathsf{XOR}$ on $2n$ bits by $f \circ \mathsf{XOR} (x_1, \dots, x_n, y_1, \dots, y_n) = f(x_1 \oplus y_1, \dots, x_n \oplus y_n)$. Such a function is cal

Speaker:

Suhail Sherif, TIFR

Friday, 13 April 2018, 16:00 to 17:00

A threshold function on n bits is a function that can be represented as the sign of a linear function of its inputs, i.e. f(x) = sign(w_1 x_1 + ... w_n x_n + c)

Sayan Bhattacharya

Friday, 13 April 2018, 11:45 to 12:45

Many real-world networks such as the ones arising out of facebook and twitter, webpages and hyperlinks etc. evolve with the passage of time.

Nikhil Mande, graduate student in the School of Technology and Computer Science, win the TCS Research Scholarship.

Congrats Nikhil!

Dr. Prahladh Harsha has been awarded the prestigious Swarnajayanti Fellowship by DST, GOI for the year 2015-16.

- ‹ previous
- 2 of 15
- next ›