The Polynomial Method in Circuit Complexity Applied to Algorithm Design
https://people.csail.mit.edu/rrw/fsttcs-survey.pdf


Hardness Self-Amplification: Simplified, Optimized, and Unified
https://eccc.weizmann.ac.il/report/2023/026/



Revisiting Time-Space Tradeoffs for Function Inversion
https://eccc.weizmann.ac.il/report/2022/145/



Sunflowers: from soil to oil
https://eccc.weizmann.ac.il/report/2022/005/



The Complexity of the Shortest Vector Problem
https://eccc.weizmann.ac.il/report/2022/170/


A Borsuk-Ulam lower bound for sign-rank and its application
https://eccc.weizmann.ac.il/report/2022/130/


Extremely Efficient Constructions of Hash Functions, with Applications to Hardness Magnification and PRFs
https://eccc.weizmann.ac.il/report/2022/086/


On the Satisfaction Probability of k-CNF Formulas

https://arxiv.org/abs/2201.08895