## Time:

## Venue:

Fair division of a set of resources among several agents is a commonly occurring problem in many real-world settings.

Speaker:

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

Fair division of a set of resources among several agents is a commonly occurring problem in many real-world settings.

Raghuvansh Saxena

Tuesday, 21 February 2023, 09:00

Communication complexity is the study of how two or more parties with private inputs compute a function that depends on all their inputs. The scarce resource is communication, or the number of bits exchanged between the parties.

Rafael Oliviera

Monday, 20 February 2023, 14:30 to 15:30

Hyperbolicity cones are convex semialgebraic sets generalizing both polyhedral and spectrahedral cones, the latter forming the basic geometric sets from linear and semidefinite programming.

Speaker:

Eeshan Modak, TIFR

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

In the composite hypothesis testing setting, the detector receives n i.i.d. samples either from a distribution p∈P or from a distribution q∈Q. It then decides the correct set from which the samples were drawn.

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.

Drs. Jatin Batra and Abhishek Sinha join the School of Technology and Computer Science as a Reader.

Suhail Sherif wins ACM India best thesis award for his thesis titled “Communication Complexity and Quantum Optimization Lower Bounds via Query Comp

Anand Deo and Karthyek Murthy receive honourable mention (third place) in INFORMS Junior Faculty Interest Group (JFIG

- ‹ previous
- 3 of 20
- next ›