- Rahul Jain, Srijita Kundu, 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), 2022, 1285
- Noam Nisan, Avi Wigderson, “On rank vs. communication complexity”, Combinatorica, 15, no. 4, 1995, 557
- Yannai A. Gonczarowski, Noam Nisan, Rafail Ostrovsky, Will Rosenbaum, “A stable marriage requires communication”, Games and Economic Behavior, 118, 2019, 626
- Toniann Pitassi, Morgan Shirley, Thomas Watson, “Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity”, comput. complex., 30, no. 2, 2021, 10
- Maria Kontaki, Anastasios Gounaris, Apostolos N. Papadopoulos, Kostas Tsichlas, Yannis Manolopoulos, “Efficient and flexible algorithms for monitoring distance-based outliers over data streams”, Information Systems, 55, 2016, 37
- Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, Roger Wattenhofer, Proceedings of the forty-third annual ACM symposium on Theory of computing, 2011, 363
- Александр Александрович Разборов, Alexander Alexandrovich Razborov, “О квантовой коммуникационной сложности симметрических предикатов”, Изв. РАН. Сер. матем., 67, no. 1, 2003, 159
- Mark Braverman, Ankit Garg, Young Kun Ko, Jieming Mao, Dave Touchette, “Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness”, SIAM J. Comput., 47, no. 6, 2018, 2277
- Scott Aaronson, Avi Wigderson, Proceedings of the fortieth annual ACM symposium on Theory of computing, 2008, 731
- Alexander A. Sherstov, Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, 2022, 1194