####
**Activities**

This page will list down the course activities in addition to the lectures.

**Problem Sets** :

- Problem Set 1, Jan 14, (Sent on Jan 15) Deadline: Jan 26
- Problem Set 2, Feb 08 (delayed, sent on 10 Feb) , Deadline: Feb 24 (extend as per request)
- Problem Set 3, Feb 24 (Delayed, sent on 02 Mar), Deadline: Mar 19
- Problem Set 4, Apr 05, Deadline: Apr 19
- Problem Set 5, Apr 15, Deadline: May 04 (Optional)

**Presentation**:

- Vivek V. P. A constructive proof of Lovasz' Local Lemma , Date: TBA.
- Om Prakash Short paths in expander graphs
- Goovwanth An elementary construction of constant-degree expanders
- Vipin Pseudorandom bits for polynomials
- Santhoshini Linear-algebraic list decoding for variants of Reed-Solomon codes
- Aakash The sum of d small-bias generators fools polynomials of degree d.
- Shom Abraham Efficiently decoding Reed-Muller codes from random errors
- Ankit Yadav Derandomized Squaring of graphs
- Nada Improved Bounds and Algorithms for Hypergraph Two-coloring
- Shiv Krishna Combinatorial limitations of average-radius list-decoding

**List of Topics**Here are the ground rules. Topics will be allocated in a first cum first serve basis starting 21 Mar 10 am. (Mails sent before the start time will not be considered.) The process will be completed by Mar 22 5pm and final list will be announced on 24th Mar. The presentations (45 mins per person) will start from first week of April and will be scheduled in extra slots

- Exctractor Codes
- Quadratic Lower bound for 3 querry LDCs
- Extractors for Low-Weight Affine Sources
- Combinatorial limitations of average-radius list-decoding
- Linear-algebraic list decoding for variants of Reed-Solomon codes
- Efficiently decoding Reed-Muller codes from random errors
- Improved Bounds and Algorithms for Hypergraph Two-coloring
- Derandomized Squaring of graphs
- An elementary construction of constant-degree expanders
- The sum of d small-bias generators fools polynomials of degree d.
- Learning Random Monotone DNF
- Making Polynomials Robust to Noise
- Bounded Independence Fools Halfspaces
- Pseudorandom bits for polynomials
- A Chernoff Bound for Random Walks on Expander Graphs
- Short paths in expander graphs
- Cryptographic Hash Functions from Expander Graphs

**Exams**:

**Mid Sem**Mar 04, 9-11AM-
**End Sem**Apr 24, 1-4 PM