Harry Buhrman, Richard Cleve, Wim van Dam, “Quantum Entanglement and Communication Complexity”, SIAM J. Comput., 30, no. 6, 2001, 1829
Andrew Drucker, Fabian Kuhn, Rotem Oshman, Proceedings of the 2012 ACM symposium on Principles of distributed computing, 2012, 67
Troy Lee, Adi Shraibman, Robert Spalek, 2008 23rd Annual IEEE Conference on Computational Complexity, 2008, 71
Alexander A. Sherstov, Proceedings of the forty-fourth annual ACM symposium on Theory of computing, 2012, 525
Arkadev Chattopadhyay, Jaikumar Radhakrishnan, Atri Rudra, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 2014, 631
Talya Eden, Nimrod Fiat, Orr Fischer, Fabian Kuhn, Rotem Oshman, “Sublinear-time distributed algorithms for detecting small cliques and even cycles”, Distrib. Comput., 35, no. 3, 2022, 207
Romain Gay, Iordanis Kerenidis, Hoeteck Wee, 9216, Advances in Cryptology – CRYPTO 2015, 2015, 485
Adi Shraibman, “The corruption bound, log-rank, and communication complexity”, Information Processing Letters, 141, 2019, 16
Aggelos Kiayias, Antonina Mitrofanova, 3570, Financial Cryptography and Data Security, 2005, 109
Mark Braverman, Faith Ellen, Rotem Oshman, Toniann Pitassi, Vinod Vaikuntanathan, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013, 668