Talks

Improved bounds for the sunflower lemma
with Ryan Alweiss, Shachar Lovett and Jiapeng Zhang.
Institute of Computing Technology, Chinese Academy of Sciences, Mar 2020
Center on Frontiers of Computing Studies, Peking University, Jul 2020

Decision list compression by mild random restrictions
with Shachar Lovett and Jiapeng Zhang.
Institute of Computing Technology, Chinese Academy of Sciences, Oct 2019
ACM Symposium on Theory of Computing (STOC), Jun 2020

Randomness vs structure — DNF compression and sunflower lemma
with Ryan Alweiss, Shachar Lovett and Jiapeng Zhang.
Institute for Theoretical Computer Science, Shanghai University of Finance and Economics, Feb 2020