Theoretical CS Reading Group
|
The reading group meets once a week
usually, Monday 1:30-2:30pm to discuss
a particular paper or topic.
Please join our mailing list to get notifications about the weekly meetings and discussions. You might also be interested in the Theory Seminar. |
|
Spring 2019 Fall 2018 Spring 2018 Fall 2017 Spring 2017 Fall 2016 Spring & Summer 2016 Fall 2015 Spring & Summer 2015 Fall 2014 Spring 2014 Summer & Fall 2013 |
Spring & Summer 2016
Monday, 25th Jan 2016 —
Schmudgen's theorem
Presenter: Akash Kumar
Monday, 1st Feb 2016 —
Schmudgen's theorem (contd.)
Presenter: Akash Kumar
Monday, 8th Feb 2016 —
Esfandiari et.al, "Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond"
Presenter: Samson Zhou
Monday, 15th Feb 2016 —
Blekherman et al., "Sum of Squares on the Hypercube"
Presenter: Abhiram Natrajan
Monday, 22th Feb 2016 —
Blekherman et al., "Sum of Squares on the Hypercube" (contd. )
Presenter: Abhiram Natrajan
Monday, 28th March 2016 —
Recent progress in the field of Correlation Extractors
Presenter: Prof. Hemanata Maji
Wednesday, 6th April 2016 —
Recent results on Group Testing
Presenter: Samson Zhou
Monday, 11th April 2016 —
Recent results on Group Testing (contd.)
Presenter: Samson Zhou
Group testing is the challenge of finding d defective items among a population of n total items. In this talk, we will explore the upper and lower bounds on the number of the tests necessary, and introduce interesting variations on the classic problems. We will also talk about quickly identifying the defective items, following the completion of the tests.
Monday, 25th April 2016 —
Approximating Permanents and Hafnians
Presenter: Young San-Lin
Thursday, 19th May 2016 —
Lior Eldar, Peter Shor, "Systematic Normal Form of Lattices"
Presenter: GV
Thursday, 28th May 2016 —
Do Prices Coordinate Markets ?
Presenter: Young San-Lin
Friday, 3rd June 2016 —
Discrete Gaussian Sampling to solve SVP and CVP in lattices
Presenter: GV
Tuesday, 7th June 2016 —
Theory Seminar - Prof. Elena Grigorescu, Purdue University
Hardness of Decoding Reed-Solomon Codes