Parity Games are solvable in quasipolynomial time

We consider a node-monitor pair, where updates are generated stochastically (according to a known distribution) at the node that it wishes to send to the monitor.

Directed Information and Pearl's Causal Calculus

STCS Student Seminar

Speaker:

Eeshan Modak, TIFR

Organisers:

Shubhada Agrawal

Time:

Friday, 28 August 2020, 17:15 to 18:15

Venue:

Zoom link: https://zoom.us/j/92834710011?pwd=WURSa3JsRVpJYWhONEExYTdDcENDQT09

This will be a tweaked version of my Qualifier talk. I will mostly focus on:
1. The notion of interventional distributions (as defined by Judea Pearl) and how they can be used to identify causal linkages.

Guarding Polygons via CSPs

STCS Student Seminar

Speaker:

Akanksha Agrawal

Organisers:

Shubhada Agrawal

Time:

Friday, 21 August 2020, 17:15 to 18:15

Venue:

Zoom link: https://zoom.us/j/92834710011?pwd=WURSa3JsRVpJYWhONEExYTdDcENDQT09

Abstract: Introduced by Klee in 1973, the Art Gallery problem asks the following question.

Identifying some necessary conditions for a function to be Boolean

STCS Student Seminar

Speaker:

Nikhil Mande

Organisers:

Neha Sangwan

Time:

Saturday, 15 August 2020, 11:00 to 12:00

The seminar will happen via Google meet.

Average Sensitivity of Graph Algorithms

STCS Student Seminar

Speaker:

Nithin Varma

Organisers:

Neha Sangwan

Time:

Saturday, 8 August 2020, 16:00 to 17:00

Abstract: In modern applications of graph algorithms, where the graphs of interest are large and dynamic, it is unrealistic to assume that an input representation contains the full information of a graph being studied.

The class of poly-sized Algebraic Branching Programs is closed under Factoring

STCS Student Seminar

Speaker:

Prerona Chatterjee, TIFR

Organisers:

Siddharth Bhandari

Time:

Saturday, 18 July 2020, 16:00 to 17:00

Talk will be held in Zoom.

On Realizable Distributions

STCS Student Seminar

Speaker:

Siddharth Bhandari, TIFR

Time:

Saturday, 11 July 2020, 16:00 to 17:00

Join Zoom Meeting
https://zoom.us/j/98172222418?pwd=b0htSDQ5NDRKQ050K0d6cHJ3YnZXQT09
Meeting ID: 981 7222 2418
Password: studsem

Theory of Field $\mathbb{C} $ is Decidable

STCS Student Seminar

Speaker:

Prabhat Kumar Jha, TIFR

Organisers:

Prerona Chatterjee

Time:

Saturday, 4 July 2020, 16:00 to 17:00

Zoom Details:
Link: https://zoom.us/j/98172222418?pwd=b0htSDQ5NDRKQ050K0d6cHJ3YnZXQT09
Meeting ID: 981 7222 2418

Proof Complexity of MaxSAT Resolution

STCS Student Seminar

Speaker:

Gaurav Sood

Organisers:

Prerona Chatterjee

Time:

Thursday, 25 June 2020, 14:30 to 15:30

Zoom details:
Meeting ID: 613 566 8340
Password: 183102

School of Technology and Computer Science

STCS Student Seminar

Parity Games are solvable in quasipolynomial time

Organisers:

Time:

Venue:

Minimizing the Sum of Age of Information and Transmission Cost under Stochastic Arrival Model

Organisers:

Time:

Venue:

Directed Information and Pearl's Causal Calculus

Organisers:

Time:

Venue:

Guarding Polygons via CSPs

Speaker:

Organisers:

Time:

Venue:

Identifying some necessary conditions for a function to be Boolean

Speaker:

Organisers:

Time:

Average Sensitivity of Graph Algorithms

Speaker:

Organisers:

Time:

The class of poly-sized Algebraic Branching Programs is closed under Factoring

Organisers:

Time:

On Realizable Distributions

Time:

Theory of Field $\mathbb{C} $ is Decidable

Organisers:

Time:

Proof Complexity of MaxSAT Resolution

Speaker:

Organisers:

Time:

Pages

Search form

Organisers:

Time:

Venue:

Organisers:

Time:

Venue:

Organisers:

Time:

Venue:

Speaker:

Organisers:

Time:

Venue:

Speaker:

Organisers:

Time:

Speaker:

Organisers:

Time:

Organisers:

Time:

Time:

Organisers:

Time:

Speaker:

Organisers:

Time:

Pages