Ad placement in web-browsing and wireless mobiles is an increasingly important component of the advertisement market. The market size is over $ 100 billion and counting.

An almost-efficient deterministic parallel algorithm for Bipartite Perfect Matching

STCS Student Seminar

Speaker:

Varun Ramanathan, TIFR

Time:

Friday, 22 July 2022, 16:00 to 17:00

Venue:

A201

We will try to understand the paper "Bipartite Perfect Matching is in quasi-NC" by Fenner, Gurjar and Thierauf (2016).

Written Qualifier

Written Qualifier

Time:

Friday, 22 July 2022, 09:30 to 12:30

Venue:

A201

Written Qualifier

Written Qualifier

Time:

Thursday, 21 July 2022, 09:30 to 12:30

Venue:

A201

Best arm Identification in Multi-Armed Bandits

Oral Qualifier

Speaker:

Agniv Bandyopadhyay, TIFR

Organisers:

Sandeep K Juneja

Time:

Wednesday, 20 July 2022, 15:00 to 16:00

Venue:

Via Zoom

Papers by:
(1)"Best Arm Identification in Multi-Armed Bandits" by Audibert and Bubeck, 2010.
(2)"Tight (Lower) Bounds for the Fixed Budget Best Arm IdentificationBandit Problem" Carpentier and Locatelli 2016.

Oral Qualifier

Oral Qualifier

Speaker:

Yeshwant Chandrakant Pandit, TIFR

Organisers:

Rahul Vaze

Time:

Tuesday, 19 July 2022, 15:00 to 16:30

Venue:

A201

Oral qualifier

Oral Qualifier

Speaker:

Sreejata Kishor Bhattacharya, TIFR

Organisers:

Arkadev Chattopadhyay

Time:

Monday, 18 July 2022, 10:30 to 11:30

Venue:

A201

A talk on Pseudo-determinism.

On Complexity measures of Boolean functions

PhD Synopsis Seminar

Speaker:

Tulasi mohan Molli, TIFR

Organisers:

Prahladh Harsha

Time:

Friday, 15 July 2022, 14:00 to 15:00

Venue:

Via Zoom

Boolean functions capture various problems and situations arising in computer science and other areas. In this synopsis, we study boolean functions using two complexity measures.

The complexity of formal proofs

STCS VV distinguished lecture

Speaker:

Meena Mahajan

Organisers:

Prahladh Harsha

Time:

Wednesday, 13 July 2022, 17:00 to 18:30

Venue:

AG-66

A proof of a statement convinces the person/entity addressed that the statement is true. Intuitively, a good proof is short, and easy to verify. A formal proof must convince an automated checking program (that may have limited resources).

News and Notices

Best paper award at WiOpt 2020

The paper, "Non-clairvoyant Scheduling of Coflows," jointly authored by Dr.

City-State Epidemic Simulator

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

STCS welcomes Himanshu Asnani

Dr.Himanshu Asnani joins the School of Technology and Computer Science as a Reader.

Calendar

October

S	M	T	W	T	F	S
					1	2
3	4	5	6	7	8	9
10	11	12	13	14	15	16
17	18	19	20	21	22	23
24	25	26	27	28	29	30
31

Search form

Organisers:

Time:

Venue:

Speaker:

Organisers:

Time:

Venue:

Time:

Venue:

Time:

Venue:

Time:

Venue:

Organisers:

Time:

Venue:

Organisers:

Time:

Venue:

Organisers:

Time:

Venue:

Organisers:

Time:

Venue:

Speaker:

Organisers:

Time:

Venue:

Pages