Past Events

A Largish Sum-of-squares Implies Circuit Hardness (and Derandomization)

STCS Seminar

Speaker:

Prof. Nitin Saxena

Organisers:

Time:

Thursday, 23 July 2020, 14:00 to 15:00

Abstract: We study the sum of squares (*SOS*) representation of polynomials, i.e. f = \sum_{i\in s} c_i f_i^2 , where c_i are field elements and f_i(x_1,\ldots,x_n) are polynomials.

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.

Approximating the Nash Social Welfare with Subadditive Valuations

STCS Seminar

Speaker:

Umang Bhaskar, TIFR

Organisers:

Rahul Vaze

Time:

Friday, 17 July 2020, 14:00 to 15:00

Abstract: How should one divide $m$ goods between $n$ agents, given the utility each agent has when allocated a subset of goods?

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

On Decision Tree Complexity of Boolean Functions

STCS Seminar

Speaker:

Swagato Sanyal

Organisers:

Arkadev Chattopadhyay

Time:

Tuesday, 7 July 2020, 14:00 to 15:00

Talk will be held on Zoom.

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

Half-integral Duals, Connectivity Augmentation and Multiflows in Planar Graphs

STCS Seminar

Speaker:

Naveen Garg

Organisers:

Rahul Vaze

Time:

Tuesday, 23 June 2020, 14:00 to 15:00

Venue:

A-201 (STCS Seminar Room)

Abstract: Given an edge weighted graph and a spanning tree, $T$, the {\em tree augmentation problem} is to pick a minimum weight set of edges, $F$, such that $T\cup F$ is 2-edge connected. Williamson et.al.

Optimal Design of Queuing Systems via Compositional Stochastic Programming

STCS Seminar

Speaker:

Ketan Rajawat

Organisers:

Rahul Vaze

Time:

Tuesday, 16 June 2020, 14:00 to 15:00

Venue:

A-201 (STCS Seminar Room)

Abstract: Well-designed queuing systems form the backbone of modern communications, distributed computing, and content delivery architectures.

Weighted min-cut: Sequential, Cut-query and Streaming algorithms

STCS Seminar

Speaker:

Dr. Sagnik Mukhopadhyay

Organisers:

Arkadev Chattopadhyay

Time:

Tuesday, 9 June 2020, 14:00 to 15:00

Venue:

A-201 (STCS Seminar Room)

Abstract: Consider the following 2-respecting min-cut problem: Given a weighted graph G and its spanning tree T, find the minimum cut among the cuts that contain at most two edges in T.

News and Notices

JRF positions: list of candidates called for interview

List of candidates shortlisted for interview for the

Rahul Vaze wins Ramakrishna Cowsik Medal

Rahul Vaze's paper “On the capacity and diversity-multiplexing tradeoff of the two-way relay channel, IEEE T

Deepesh wins Microsoft Fellowship

Deepesh Data, graduate student in STCS, wins the 2014 Microsoft Research India PhD Fellowship.

Calendar

September

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

Search form

Speaker:

Organisers:

Time:

Organisers:

Time:

Organisers:

Time:

Time:

Speaker:

Organisers:

Time:

Organisers:

Time:

Speaker:

Organisers:

Time:

Speaker:

Organisers:

Time:

Venue:

Speaker:

Organisers:

Time:

Venue:

Speaker:

Organisers:

Time:

Venue:

Pages