## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

Online two-sided matching markets such as Q&A forums (e.g. StackOverflow, Quora) and online labour platforms (e.g.

Virag Shah

Monday, 20 March 2017,

16:00 to 17:00

Online two-sided matching markets such as Q&A forums (e.g. StackOverflow, Quora) and online labour platforms (e.g.

Speaker:

Aditya Nema, TIFR

Friday, 17 March 2017,

17:15 to 18:15

In this talk, we will discuss De Finetti representation theorem on exchangeable probability assignment, that provides an operational definition of the concept of an unknown probability in Bayesian probability theory, where probabilities are taken

Surender Baswana

Friday, 17 March 2017,

16:00 to 17:00

Until 2014, the admissions to the Indian Institutes of Technology (IITs) were conducted separately (based on JEE Advanced ranks) from the admissions to the non-IIT Centrally Funded Technical Institutes (CFTIs) (based on JEE mains ranks).

Surender Baswana

Thursday, 16 March 2017,

14:00 to 15:00

Consider the following problem of single source reachability under failures of vertices or edges. Let $G$ be a given directed graph on n vertices with a designated source vertex $s$, and $k$ be any positive integer. Compute the sparsest subgraph

Monday, 6 March 2017, 10:00 to Tuesday, 7 March 2017, 00:30

STCS Day 2017 is the 2016-17 edition of our annual symposium.

Abhinav Ganesan

Friday, 3 March 2017,

15:30 to 16:30

Design of efficient sampling methodologies to capture the information content in sparse, and thus, "compressible" signals is well known as compressive sensing (CS) in the signal processing community.

Rakesh Venkat

Friday, 24 February 2017,

16:00 to 17:30

A two-player game is an important construct used in proving many hardness of approximation results.

Rakesh Venkat

Thursday, 23 February 2017,

14:30 to 15:30

Jakob Nordstrom

Tuesday, 21 February 2017,

16:00 to 17:00

We study the problem of certifying unsatisfiability of formulas in propositional logic.

Speaker:

Sayantan Chakraborty, TIFR

Friday, 17 February 2017,

16:00 to 17:30

The usual idea of compactness of a space is that if the space has an open cover then it has a finite subcover which is not very intuitive. In this talk we attempt to look at some equivalent characterisations of compact spaces.

Dr.Piyush Srivastava joins the School of Technology and Computer Science as a Reader.Piyush's research is on probability in computer science and often concerns question

Dr. Ramprasad Saptharishi joins the School of Technology and Computer Science as a Reader. Ramprasad's research interests include Arithmetic complexity, pseudorandomness and derandomization.

- ‹ previous
- 2 of 13
- next ›