## Time:

We will study the Decision-Tree complexity of element distinctness using arbitrary binary gates (an instance of which is comparison gates). Concretely, let $m$ and $n$ be natural numbers with $m>n$.

Speaker:

Siddharth Bhandari, TIFR

Friday, 12 February 2021, 17:15 to 18:15

We will study the Decision-Tree complexity of element distinctness using arbitrary binary gates (an instance of which is comparison gates). Concretely, let $m$ and $n$ be natural numbers with $m>n$.

Speaker:

Vidya Sagar Sharma, TIFR

Saturday, 30 January 2021, 17:15 to 18:15

An undirected graph is chordal if every cycle of length greater than three has a chord: namely, an edge connecting two nonconsecutive vertices on the cycle. A clique of a graph $G$ is any maximal set of vertices that is complete in $G$. Let $G$

Neeraj Kayal

Tuesday, 26 January 2021, 16:00 to 17:00

In this talk, we will consider algorithmic problems which follow the following template: given a real-valued multivariate polynomial f(x) of degree d, is it approximately equal to a sum of a few "simple" polynomials, i

Speaker:

Varun Narayanan, TIFR

Monday, 18 January 2021, 11:00 to 12:00

Information theoretically secure multiparty computation (MPC) is a central primitive in modern cryptography.

Kshitij Gajjar

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

Many graph problems that are NP-hard for general graphs can be solved in polynomial time for planar graphs. We explore the domain of "almost" planar graphs. These are graphs that can be made planar by removing one or two vertices from them.

William K. Moses Jr.

Saturday, 9 January 2021, 10:00 to 11:00

This paper concerns designing distributed algorithms that are singularly optimal, i.e., algorithms that are simultaneously time and message optimal, for the fundamental leader election problem in networks.

Speaker:

Anamay Tengse, TIFR

Friday, 1 January 2021, 17:15 to 18:15

In the late 1990s, a paper by Razborov and Rudich pointed out a barrier towards proving boolean circuit lower bounds.

The paper, "Non-clairvoyant Scheduling of Coflows," jointly authored by Dr. Rahul Vaze with Akhil Bhimaraju (IIT M) and Debanuj Nayak (IIT GN), received the best paper award at WiOpt 2020.

Congratulations, Dr. Rahul Vaze!

STCS TIFR faculty and students in collaboration with IISc develop an City-State Epidemic Simulator.

Dr.Himanshu Asnani joins the School of Technology and Computer Science as a Reader. Himanshu's research interests include Information and Coding Theory, Statistical Estimation and Inference, Machine Learning.

- ‹ previous
- 4 of 16
- next ›