An undirected graph is chordal if every cycle of length greater than three has a chord: namely, an edge connecting two nonconsecutive vertices on the cycle. A clique of a graph $G$ is any maximal set of vertices that is complete in $G$. Let $G$

Approximating a polynomial as a sum of simple polynomials

STCS Colloquium

Speaker:

Neeraj Kayal

Organisers:

Arkadev Chattopadhyay

Time:

Tuesday, 26 January 2021, 16:00 to 17:00

In this talk, we will consider algorithmic problems which follow the following template: given a real-valued multivariate polynomial f(x) of degree d, is it approximately equal to a sum of a few "simple" polynomials, i

Secure Multiparty Computation with Limited Connectivity

PhD Synopsis Seminar

Speaker:

Varun Narayanan, TIFR

Time:

Monday, 18 January 2021, 11:00 to 12:00

Information theoretically secure multiparty computation (MPC) is a central primitive in modern cryptography.

Hardness of Recognizing Geometric Intersection Graphs

STCS Student Seminar

Speaker:

Kshitij Gajjar

Organisers:

Prerona Chatterjee

Time:

Friday, 15 January 2021, 17:15 to 18:15

Many graph problems that are NP-hard for general graphs can be solved in polynomial time for planar graphs. We explore the domain of "almost" planar graphs. These are graphs that can be made planar by removing one or two vertices from them.

Singularly Optimal Randomized Leader Election

STCS Student Seminar

Speaker:

William K. Moses Jr.

Time:

Saturday, 9 January 2021, 10:00 to 11:00

This paper concerns designing distributed algorithms that are singularly optimal, i.e., algorithms that are simultaneously time and message optimal, for the fundamental leader election problem in networks.

Algebraic Natural Proofs: the plot thickens

STCS Student Seminar

Speaker:

Anamay Tengse, TIFR

Organisers:

Eeshan Modak

Time:

Friday, 1 January 2021, 17:15 to 18:15

In the late 1990s, a paper by Razborov and Rudich pointed out a barrier towards proving boolean circuit lower bounds.

Accelerating Black Box Estimation of Distribution Tails Using Self structuring Importance Samplers

STCS Student Seminar

Speaker:

Anand Deo, TIFR

Organisers:

Eeshan Modak

Time:

Friday, 18 December 2020, 17:15 to 18:15

Motivated by the increasing adoption of models which facilitate greater automation in risk management and decision-making, this talk presents a novel Importance Sampling (IS) scheme for estimating distribution tails for a rich class of objectives

News and Notices

Graduate Courses for August-December 2012

Courses in STCS for the term August-December 2012 will nominally start from Friday 10th August.

Girish Varma wins Google PhD Fellowship

Girish Varma, a graduate student in the School of Technology and Computer Science wins the Google India PhD Fellowship 2012 in Algorithms.

STCS welcomes Ashish Tendulkar

Dr. Ashish Tendulkar joins the School of Technology and Computer Science as a Visiting Fellow.

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:

Organisers:

Time:

Organisers:

Time:

Organisers:

Time:

Speaker:

Organisers:

Time:

Time:

Speaker:

Organisers:

Time:

Speaker:

Time:

Organisers:

Time:

Organisers:

Time:

Pages