1. Towards optimal two-source extractors and Ramsey graphs;Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing;2017-06-19
2. Extractors for sumset sources;Proceedings of the forty-eighth annual ACM symposium on Theory of Computing;2016-06-19
3. Communication is Bounded by Root of Rank;Journal of the ACM;2016-03-30
4. The Complexity of DNF of Parities;Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science;2016-01-14
5. An Additive Combinatorics Approach Relating Rank to Communication Complexity;Journal of the ACM;2014-07