**Monday Oct 03**. Sushen: Section 2 of Lecture 4. Connection between -disjunct matrix construction and the -restriction problem.**Wednesday Oct 05.**Hung, Section 1 of Lecture 5. Connection between -disjunct matrix construction and the set-cover problem.**Monday Oct 10.**Erdong: Section 2 of Lecture 5. Strongly explicit construction of disjunct matrices by concatenating the Reed-Solomon code with the identity code.**Wednesday Oct 12**. Nguyen: Section 3 of Lecture 5. Derandomizing the Gilbert-Varshamov bound’s probabilistic proof.**Monday Oct 17**. Jesse. coNP-completeness of testing whether a matrix is separable.**Wednesday Oct 19**. Shishir. Efficient decoding and the notions of list-disjunct and list separable matrices.**Monday Oct 24**Aggrey. Upper bound for list-disjunct matrices. Section 2 of lecture 8.**Wednesday Oct 26**Eric. Sections 1 & 2 of lecture 9. Recursive construction of list disjunct matrices**Monday Oct 31**Atri. Section 1 of lecture 10. List-decoding and list-recoverable codes**Wednesday Nov 02**Nikhil. Section 2 of lecture 10. List disjunct matrices from RS-based list recoverable codes**Monday Nov 07**Venkata S. Section 3 of lecture 10. List disjunct matrices from PV-based list recoverable codes**Wednesday Nov 09**Utkarsh. Section 1 of lecture 11. (At least up to Theorem 1.1) Condensers, extractors, and codes.**Monday Nov 14**Sandeep. Section 1 of lecture 11. (The rest of section 1.) List-disjunct matrices from extractors**Wednesday Nov 16**Vikramsinh. Section 2 of lecture 11. List-disjunct matrices from expanders**Monday Nov 21**Sujith. Application: explicit monotone encodings.**Monday Nov 28**We won’t have any presentation on this day due to the move to the new building**Mon Dec 05**Weixian. Error tolerant case, part I.**Wed Dec 07**Nikhil. Error tolerant case, part II.

Advertisements
(function(g,$){if("undefined"!=typeof g.__ATA){
g.__ATA.initAd({collapseEmpty:'after', sectionId:26942, width:300, height:250});
g.__ATA.initAd({collapseEmpty:'after', sectionId:114160, width:300, height:250});
}})(window,jQuery);
var o = document.getElementById('crt-1111249075');
if ("undefined"!=typeof Criteo) {
var p = o.parentNode;
p.style.setProperty('display', 'inline-block', 'important');
o.style.setProperty('display', 'block', 'important');
Criteo.DisplayAcceptableAdIfAdblocked({zoneid:388248,containerid:"crt-1111249075",collapseContainerIfNotAdblocked:true,"callifnotadblocked": function () {var o = document.getElementById('crt-1111249075'); o.style.setProperty('display','none','important');o.style.setProperty('visbility','hidden','important'); } });
} else {
o.style.setProperty('display', 'none', 'important');
o.style.setProperty('visibility', 'hidden', 'important');
}
var o = document.getElementById('crt-705383849');
if ("undefined"!=typeof Criteo) {
var p = o.parentNode;
p.style.setProperty('display', 'inline-block', 'important');
o.style.setProperty('display', 'block', 'important');
Criteo.DisplayAcceptableAdIfAdblocked({zoneid:837497,containerid:"crt-705383849",collapseContainerIfNotAdblocked:true,"callifnotadblocked": function () {var o = document.getElementById('crt-705383849'); o.style.setProperty('display','none','important');o.style.setProperty('visbility','hidden','important'); } });
} else {
o.style.setProperty('display', 'none', 'important');
o.style.setProperty('visibility', 'hidden', 'important');
}