For information on how to write up your scribe notes in LaTeX, check out these
guidelines.
|
| Date
| Topic
| Scribes
|
| 1 |
1/23 |
Introduction |
Michael Kowalczyk |
| 2 |
1/25 |
Existence of Expanders |
Jurgen Van Gael,
Bess Berg |
| 3 |
1/27 |
Spectral Gap Implies Expansion |
Ashwin Ganesan,
Anand Sinha |
| 4 |
1/30 |
Expansion Implies Spectral Gap |
Prem Mansukhani,
Matthew Anderson |
| 5 |
2/3 |
Explicit Constructions |
Siddharth Barman,
Mark Cowlishaw |
| 6 |
2/6 |
Zig-Zag Product |
Scott Diehl,
Jeff Kinne |
| 7 |
2/10 |
Iterative Construction |
Shuaiqi Gu,
Vinay Choudhary |
| 8 |
2/13 |
More on Iterative Construction |
Siddharth Barman,
Anand Sinha |
| 9 |
2/15 |
One-Sided Error Reduction |
Shuaiqi Gu,
Matthew Anderson |
| 10 |
2/17 |
Two-Sided Error Reduction |
Jurgen Van Gael,
Bess Berg |
| 11 |
2/20 |
Pseudorandom Generators |
Scott Diehl,
Jeff Kinne |
| 12 |
2/22 |
Extractors |
Vinay Choudhary |
| 13 |
2/24 |
Superconcentrators |
Prem Mansukhani,
Mark Cowlishaw |
| 14 |
3/1 |
Coding Theory |
Michael Kowalczyk |
| 15 |
3/3 |
Error Correcting Codes |
Scott Diehl,
Jeff Kinne |
| 16 |
3/6 |
Expander Codes |
Michael Kowalczyk,
Matthew Anderson |
| 17 |
3/8 |
Linear Time Expander Codes |
Vinay Choudhary |
| 18 |
3/20 |
Undirected ST-Connectivity in Deterministic Log-Space |
Jurgen Van Gael,
Bess Berg |
| 19 |
3/22 |
The PCP Theorem |
Siddharth Barman,
Anand Sinha |
| 20 |
3/24 |
Proof of the PCP Theorem |
Prem Mansukhani,
Mark Cowlishaw |
| 21 |
3/27 |
Satisfiability Gap Amplification |
Siddharth Barman,
Anand Sinha |
| 22 |
3/29 |
Constraint Graph Alphabet Reduction |
Jurgen Van Gael,
Bess Berg |
| 23 |
3/31 |
Static Membership Problem |
Prem Mansukhani,
Matthew Anderson |
| 24 |
4/3 |
Metric Embeddings |
Michael Kowalczyk,
Mark Cowlishaw |
| 25 |
4/7 |
Proof Complexity |
Scott Diehl,
Jeff Kinne |
| 26 |
4/12 |
Resolution |
Vinay Choudhary,
Michael Kowalczyk |
| 27 |
4/14 |
Resolution Lower Bounds |
Michael Kowalczyk |
