18.S096: Synchronization Problems and Alignment

The last set of Lecture notes for my course are now available here and are about Synchronization problems. They also include the last four open problems of the course. I will document the open problems here, while referring a much more detailed description of the problems on the notes, including description of partial progress.

18.S096: Compressed Sensing and Sparse Recovery

Another set of Lecture notes for my course, this time about Compressed Sensing and Sparse Recovery, is available here. As usual, I will document the open problems here, while referring to a much more detailed description of the problems on the notes, including description of partial progress.

18.S096: Max-Cut and Approximation Algorithms

The eight set of Lecture notes, now about Max Cut and Approximation Algorithms, is available here. They include five open problems, briefly documented here. Please see the notes for a lot more detail on the problems, relevant references and more.

18.S096: An extra Open Problem

I have just added an extra open problem (4.6.) to the fourth set of lecture notes. I am documenting it here.

18.S096: Community dection and the Stochastic Block Model

A new set of lecture notes is available here about community detection and recovery in the stochastic block model, including five open problems . As usual, I will document the open problems here, while referring a much more detailed description of the problems on the notes, including description of partial progress.

18.S096: Group Testing and Error-Correcting Codes

A new set of Lecture notes is available here. These ones are about group testing and contain a very brief “crash-course” on error-correction codes. They also include five open problems. As usual, I will document the open problems here, while referring a much more detailed description of the problems on the notes.

18.S096: Johnson-Lindenstrauss Lemma and Gordon’s Theorem

The fifth set of Lecture notes for my course is available here. They are about dimension reduction, Johnson-Lindenstrauss Lemma and Gordon’s Escape Through a Mesh Theorem, it also includes three open problems. As usual, I will document the open problems here, while referring a much more detailed description of the problems on the notes, including description of partial progress.