- Keren Censor-Hillel, Michal Dory, “Distributed Spanner Approximation”, SIAM J. Comput., 50, № 3, 2021, 1103
- H. Buhrman, R. de Wolf, Proceedings 16th Annual IEEE Conference on Computational Complexity, 2000, 120
- Alexander A. Sherstov, “The Pattern Matrix Method”, SIAM J. Comput., 40, № 6, 2011, 1969
- Ido Shahaf, Or Ordentlich, Gil Segev, 2020 IEEE International Symposium on Information Theory (ISIT), 2020, 858
- Amnon Ta-Shma, “Classical versus quantum communication complexity”, SIGACT News, 30, № 3, 1999, 25
- S. Matthew Weinberg, Zixin Zhou, Proceedings of the 23rd ACM Conference on Economics and Computation, 2022, 875
- Arkadev Chattopadhyay, Rajit Datta, Partha Mukhopadhyay, Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021, 786
- Hamed Hatami, Pooya Hatami, “Guest Column: Structure in Communication Complexity and Constant-Cost Complexity Classes”, SIGACT News, 55, № 1, 2024, 67
- Alexander A. Razborov, An Invitation to Mathematics, 2011, 97
- Mark Braverman, “Information complexity and applications”, Jpn. J. Math., 14, № 1, 2019, 27