1. The space complexity of approximating the frequency moments
2. Sepehr Assadi , Vaggos Chatziafratis , Jakub Lacki , Vahab Mirrokni , and Chen Wang . 2022 . Hierarchical Clustering in Graph Streams: Single-Pass Algorithms and Space Lower Bounds. In Conference on Learning Theory , 2-5 July 2022, London, UK, Po-Ling Loh and Maxim Raginsky (Eds.) (Proceedings of Machine Learning Research , Vol. 178). PMLR, 4643– 4702 . Sepehr Assadi, Vaggos Chatziafratis, Jakub Lacki, Vahab Mirrokni, and Chen Wang. 2022. Hierarchical Clustering in Graph Streams: Single-Pass Algorithms and Space Lower Bounds. In Conference on Learning Theory, 2-5 July 2022, London, UK, Po-Ling Loh and Maxim Raginsky (Eds.) (Proceedings of Machine Learning Research, Vol. 178). PMLR, 4643–4702.
3. Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems
4. Graph streaming lower bounds for parameter estimation and property testing via a streaming XOR lemma
5. Exponential separation of quantum and classical one-way communication complexity