Dawei Huang, Seth Pettie, Yixiang Zhang, Zhijun Zhang, “The Communication Complexity of Set Intersection and Multiple Equality Testing”, SIAM J. Comput., 50, no. 2, 2021, 674
Z. Bar-Yossef, T.S. Jayram, R. Kumar, D. Sivakumar, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., 2002, 209
Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary, Ronald de Wolf, “Exponential Lower Bounds for Polytopes in Combinatorial Optimization”, J. ACM, 62, no. 2, 2015, 1
Mika Göös, Toniann Pitassi, Thomas Watson, “Zero-Information Protocols and Unambiguity in Arthur–Merlin Communication”, Algorithmica, 76, no. 3, 2016, 684
Mika Göös, Toniann Pitassi, Proceedings of the forty-sixth annual ACM symposium on Theory of computing, 2014, 847
Andris Ambainis, Proceedings of the forty-fifth annual ACM symposium on Theory of Computing, 2013, 891
Gabor Braun, Sebastian Pokutta, “The Matching Problem Has No Fully Polynomial Size Linear Programming Relaxation Schemes”, IEEE Trans. Inform. Theory, 61, no. 10, 2015, 5754
Shenggen Zheng, Daowen Qiu, Jozef Gruska, 10687, Theory and Practice of Natural Computing, 2017, 305
Amit Chakrabarti, Oded Regev, Proceedings of the forty-third annual ACM symposium on Theory of computing, 2011, 51
Dirk Van Gucht, Ryan Williams, David P. Woodruff, Qin Zhang, Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2015, 199