ActivitiesThis page will list down the course activities in addition to the lectures.
Problem Sets (40%):
- Problem Set 1 : Feb 6, Deadline: Feb 16
- Problem Set 2 : Feb 24, Deadline: Mar 10
- Problem Set 3 : Apr 1, Deadline: Apr 15
- Problem Set 4 : Apr 15, Deadline: Apr 27
- Exam 1 (20%) : Mar 21, Saturday 8am - 10am.
- Exam 2 (20%) : May 2, 4pm - May 3, 4pm (take-home)
Course Project & Presentation (20%):
Here are the ground rules. Topics will be announced on Mar 10th and the choice/assignment of topics will be announced by Mar 17th. Each paper comes with a "bucket size" which indicates the number of students who can take up the project together (as a group). See this number within . The students are encouraged to meet the instructors in person before choosing a topic - especially for Theme 3 and 4 for which the portions are not completely covered before the deadline for choosing topics. The presentations (45 mins per person) will start from first week of April and will be scheduled in extra slots.
Theme: Probablistic Method & Applications
- On Allocations that Maximize Fairness 
- A constructive proof of the general Lovasz Local Lemma 
- New Constructive Aspects of the Lovasz Local Lemma 
- Constructive Discrepancy Minimization by Walking on The Edges 
- Constructive Algorithms for Discrepancy Minimization 
- Constructive discrepancy minimization for convex sets 
- Improved bounds and algorithms for hypergraph two-coloring 
- The complexity of distributions ( if presenting results (1) and (2) from the abstract; 2 if presenting all 4 results mentioned in the abstract)
- The Randomized Communication Complexity of Set Disjointness 
- Simple Analysis of Graph Tests for Linearity and PCP 
Theme : Coding Theory & Applications.
- Complexity of Computational Problems in Coding Theory - See here and here 
- Guruswami-Sudan Algorithm, improvements, & Folded Reed-Solomon Codes 
- Matrix Product and Codes - See here and here. 
- Coding and Decoding of Concatenated Codes - See here and here 
- Expander Codes and their applications - See here and here 
- Identity Testing of Depth-3 circuits and LDCs 
- Multiplicity Codes and Matching Vector Codes 
- Secret Sharing Schemes and Error Correcting Codes .
- Extractor Codes 
- Lower Bounds for 3-query Linear LDCs 
- Lower Bounds for Approximate LDCs 
Theme: Pseudo-randomness, Fourier Analysis & Applications.
- Almost k-wise independent sample space constructions and lower bounds 
- Construction of min-wise independent permutation families 
- Pseudorandom bits for polynomials .
- Learning random monotone DNF 
- Making Polynomials Robust to Noise 
- Testing Properties of Linear Functions 
- The sum of d small-bias generators fools polynomials of degree d 
- Extensions to Method of Multiplicities & Applications.
- Bounded Independence Fools Halfspaces 
- A Simple Proof of Bazzi's Theorem 
- Polylogarithmic Independence Fools Constant Depth Polysize circuits