Past Events

Distribution oblivious risk-aware bandit algorithms

Seminar

Speaker:

Jayakrishnan Nair

Organisers:

Rahul Vaze

Time:

Tuesday, 5 May 2020, 16:00

Venue:

A-201 (STCS Seminar Room)

Classical multi-armed bandit algorithms are tuned to work well for a pre-specified class of reward distributions, defined via their support, or moment/tail bounds.

Integer Linear Programs and Local Search for Max-Cut (Author: Svatopluk Poljak)

STCS Student Seminar

Speaker:

Vidya Sagar Sharma, TIFR

Organisers:

Kumar Saurav

Time:

Friday, 6 March 2020, 14:00 to 15:00

Venue:

A-201 (STCS Seminar Room)

Abstract: Schaffer and Yannakakis have shown that the max-cut problem with the FLIP neighborhood is polynomial-time local search (PLS) complete, and hence among the most difficult problems in the PLS class.

STCS Annual Symposium

Symposium

Organisers:

Piyush Srivastava

Time:

Friday, 28 February 2020, 09:30 to Sunday, 1 March 2020, 16:30

Venue:

AG-69

Webpage:

https://www.tifr.res.in/~piyush.srivastava/stcs-20/

Optimal Resource Allocation and Scheduling in Networks and Systems

STCS Seminar

Speaker:

Rahul Singh

Organisers:

Rahul Vaze

Time:

Monday, 24 February 2020, 11:00 to 12:00

Venue:

A-201 (STCS Seminar Room)

Abstract: I will provide an account of my research in various areas. As an exemplar, I will discuss the first two topics in greater detail.

The Skolem - Mahler - Lech Theorem

STCS Student Seminar

Speaker:

Prabhat Kumar Jha, TIFR

Organisers:

Anirban Bhattacharjee

Time:

Friday, 21 February 2020, 14:00 to 15:00

Venue:

A-201 (STCS Seminar Room)

Abstract: The Skolem - Mahler - Lech Theorem states that given any linear recurrence sequence over any field of characteristic 0, the set of positions where 0 occurs is union of a finite set and finitely many arithmetic progressio

Unique Games with Value Half and its Applications.

STCS Seminar

Speaker:

Amey Bhangale

Organisers:

Prahladh Harsha

Time:

Tuesday, 18 February 2020, 14:15 to 15:15

Venue:

A-201 (STCS Seminar Room)

Abstract: PCP Theorem characterizes the class NP and gives hardness of approximation for many optimization problems. Despite this, several tight hardness of approximation results remain elusive via the PCP theorem.

The Propp-Wilson Perfect Sampling Algorithm

STCS Student Seminar

Speaker:

Sayantan Chakraborty

Organisers:

Anirban Bhattacharjee

Time:

Friday, 14 February 2020, 14:00 to 15:00

Venue:

A-201 (STCS Seminar Room)

Abstract:*The problem of approximate sampling using Markov Chain Monte Carlo has received considerable attention in the Theoretical Computer Science and Physics communities.

Characterization of Reed Muller Codes

Project Presentation

Speaker:

Arghya Chakraborty, TIFR

Organisers:

Prahladh Harsha

Time:

Wednesday, 12 February 2020, 16:00 to 17:00

Venue:

A-201 (STCS Seminar Room)

Abstract : In this talk, I shall discuss about linear codes-specifically Reed Solomon, Reed Muller codes and their duals.

Artificial Intelligence using Emerging Eevices and Architectures

Seminar

Speaker:

Dr. Debanjan Bhowmik

Organisers:

Jaikumar Radhakrishnan

Time:

Tuesday, 11 February 2020, 14:00 to 15:00

Venue:

A-201 (STCS Seminar Room)

Abstract: Artificial Intelligence (AI)/ Machine Learning (ML)/ Neural Network (NN) algorithms are being widely used currently for various applications that include self driving cars, virtual assistants on smartphones and other dev

Quantum versus Randomized Communication Complexity, with Efficient Players

STCS Seminar

Speaker:

Uma Girish

Organisers:

Jaikumar Radhakrishnan

Time:

Friday, 7 February 2020, 11:30 to 12:30

Venue:

A-201 (STCS Seminar Room)

Abstract: We study a new type of separation between quantum and classical communication complexity, a separation which is obtained using quantum protocols where all parties are efficient, in the sense that they can be implemented

News and Notices

Rahul Vaze wins best paper award at NCC

"Maximizing Utility Among Selfish Users in Social Groups"
co-authored with Ashwin Pananjady and Vivek Bagaria (interns from IIT-Madras)

Gugan wins IBM Fellowship

Gugan Thoppe, a graduate student in the School of Technology and Computer Science, wins the IBM PhD Fellowship Award. From the IBM PhD Fellowship Award webpage, "The IBM PhD Fellowship is an intensely competitive worldwide program, which honors exceptional Ph.D.

Ramanujan Fellow: Arkadev Chattopadhyay

Dr. Arkadev Chattopadhyay was selected for the Ramanujan Fellowship. The Ramanujan Fellowship is given by the Department of Science and Technology for attracting brilliant scientists and engineers from all over the world to take up scientific research positions in India.

Calendar

July

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

Speaker:

Organisers:

Time:

Venue:

Organisers:

Time:

Venue:

Organisers:

Time:

Venue:

Webpage:

Speaker:

Organisers:

Time:

Venue:

Organisers:

Time:

Venue:

Speaker:

Organisers:

Time:

Venue:

Speaker:

Organisers:

Time:

Venue:

Organisers:

Time:

Venue:

Speaker:

Organisers:

Time:

Venue:

Speaker:

Organisers:

Time:

Venue:

Pages