Karl Bringmann, Sebastian Krinninger, “A note on hardness of diameter approximation”, Information Processing Letters, 133, 2018, 10
Ran Raz, “Fourier analysis for probabilistic communication complexity”, Comput Complexity, 5, no. 3-4, 1995, 205
Taisuke Izumi, 8576, Structural Information and Communication Complexity, 2014, 137
Benjamin E. Diamond, Amir Yehudayoff, “Explicit exponential lower bounds for exact hyperplane covers”, Discrete Mathematics, 345, no. 11, 2022, 113114
Sima Hajiaghaei Shanjani, Valerie King, “Communication costs in a geometric communication network”, Theoretical Computer Science, 977, 2023, 114161
Anirban Dasgupta, Ravi Kumar, D. Sivakumar, 7408, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012, 517
Stilian A. Stoev, Marios Hadjieleftheriou, George Kollios, Murad S. Taqqu, 2007 IEEE 23rd International Conference on Data Engineering, 2007, 1006
Ran Raz, Proceedings of the thirty-first annual ACM symposium on Theory of Computing, 1999, 358
A. Knop, S. Lovett, S. McGuire, W. Yuan, “Guest Column”, SIGACT News, 52, no. 2, 2021, 46
Joakim Blikstad, Jan Van Den Brand, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai, 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), 2022, 1174