| 20 Mar 2023 | Ted on Making Sense of Directed Graphs |
|---|
| 06 Mar 2023 | Zach on Techniques for private resource allocation |
|---|---|
| 27 Feb 2023 | Yihui on The true hardness of quantum error mitigation |
| 21 Feb 2023 | Yeongwoo on Max Cut and Hardness of Approximation |
| 13 Feb 2023 | Prayaag on Pseudorandom Graphs for Logical Adversaries |
| 02 Feb 2023 | Jamie on Pseudorandom Graphs for Logical Adversaries |
| 26 Jan 2023 | Initial Meeting on Initial Meeting |
| 05 Nov 2018 | Chi-Ning on Graph Complexity |
|---|---|
| 29 Oct 2018 | Ben on Cap Sets and Rigid Matrices |
| 22 Oct 2018 | Sasha on The Minrank of Random Graph |
| 15 Oct 2018 | Prayaag on Mean estimation in high dimensions |
| 01 Oct 2018 | Preetum on On Science |
| 20 Sep 2018 | Fred on Revisit minimum spanning tree |
| 09 Jul 2018 | Chi-Ning on ACC lower bounds for NQP |
| 14 May 2018 | Yi-Hsiu on Flattening Entropies |
| 30 Apr 2018 | Andrea on Tight Hardness for Shortest Cycles and Paths in Sparse Graphs |
| 23 Apr 2018 | Chi-Ning on Learning algorithm from natural proofs |
| 16 Apr 2018 | Kyle on Grothendieck's inequality |
| 09 Apr 2018 | Preetum on Prediction with Short Memory |
| 02 Apr 2018 | Zhixian on Noisy graph isomorphism |
| 26 Mar 2018 | Thibaut on Black box separations in cryptography and random oracles |
| 19 Mar 2018 | Nic on Dense Model Theorem |
| 05 Mar 2018 | Jarek on Monumental Graph Minor Theory |
| 26 Feb 2018 | Mrinal on Multivariate Polynomial Factorization - 101 |
| 12 Feb 2018 | Chi-Ning on Subgraph conditioning method |