- Itai Ashlagi, Mark Braverman, Yash Kanoria, Peng Shi, “Communication Requirements and Informative Signaling in Matching Markets”, SSRN Journal, 2017
- Harry Buhrman, Richard Cleve, Serge Massar, Ronald de Wolf, “Nonlocality and communication complexity”, Rev. Mod. Phys., 82, № 1, 2010, 665
- Ying Yan, Jiaxing Zhang, Bojun Huang, Xuzhan Sun, Jiaqi Mu, Zheng Zhang, Thomas Moscibroda, Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, 2015, 3
- Henning Wunderlich, “On a Theorem of Razborov”, comput. complex., 21, № 3, 2012, 431
- Sudipto Guha, Piotr Indyk, Andrew McGregor, “Sketching information divergences”, Mach Learn, 72, № 1-2, 2008, 5
- Jeff M. Phillips, Elad Verbin, Qin Zhang, “Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy”, SIAM J. Comput., 45, № 1, 2016, 174
- Dmitry Gavinsky, “Bare Quantum Simultaneity Versus Classical Interactivity in Communication Complexity”, IEEE Trans. Inform. Theory, 67, № 10, 2021, 6583
- Alexander A. Sherstov, 2008 23rd Annual IEEE Conference on Computational Complexity, 2008, 64
- Karthik C. S., Bundit Laekhanukit, Pasin Manurangsi, “On the Parameterized Complexity of Approximating Dominating Set”, J. ACM, 66, № 5, 2019, 1
- Mark Braverman, “Interactive Information Complexity”, SIAM J. Comput., 44, № 6, 2015, 1698