Amir Abboud, Keren Censor-Hillel, Seri Khoury, Christoph Lenzen, “Fooling views: a new lower bound technique for distributed computations under congestion”, Distrib. Comput., 33, no. 6, 2020, 545
Anat Ganor, Gillat Kol, Ran Raz, “Exponential Separation of Communication and External Information”, SIAM J. Comput., 50, no. 3, 2021, STOC16-236
Gábor Braun, Samuel Fiorini, Sebastian Pokutta, David Steurer, “Approximation Limits of Linear Programs (Beyond Hierarchies)”, Mathematics of OR, 40, no. 3, 2015, 756
Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli, 271, Integer Programming, 2014, 129
Alexander A. Sherstov, “The Multiparty Communication Complexity of Set Disjointness”, SIAM J. Comput., 45, no. 4, 2016, 1450
Andris Ambainis, Proceedings of the thirty-second annual ACM symposium on Theory of computing, 2000, 636
Hartmut Klauck, Ved Prakash, 8572, Automata, Languages, and Programming, 2014, 919
Joshua Brody, Amit Chakrabarti, Ranganath Kondapally, David P. Woodruff, Grigory Yaroslavtsev, Proceedings of the 2014 ACM symposium on Principles of distributed computing, 2014, 106
Scott Aaronson, Avi Wigderson, “Algebrization”, ACM Trans. Comput. Theory, 1, no. 1, 2009, 1
Rahul Jain, Attila Pereszlényi, Penghui Yao, “A Direct Product Theorem for Two-Party Bounded-Round Public-Coin Communication Complexity”, Algorithmica, 76, no. 3, 2016, 720