Shengyu Zhang, 5878, Algorithms and Computation, 2009, 434
Yuyu Wang, Takahiro Matsuda, Goichiro Hanaoka, Keisuke Tanaka, 10820, Advances in Cryptology – EUROCRYPT 2018, 2018, 61
Peter Høyer, Ronald de Wolf, 2285, STACS 2002, 2002, 299
Ulrich Tamm, Numbers, Information and Complexity, 2000, 589
Alexander A. Sherstov, “Communication Lower Bounds Using Directional Derivatives”, J. ACM, 61, № 6, 2014, 1
Rotem Oshman, 8576, Structural Information and Communication Complexity, 2014, 14
Alexander A. Sherstov, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07), 2007, 83
Rahul Jain, “New Strong Direct Product Results in Communication Complexity”, J. ACM, 62, № 3, 2015, 1
MohammadHossein Bateni, Hossein Esfandiari, Vahab Mirrokni, Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017, 13
Anna Gál, Ridwan Syed, “Upper Bounds on Communication in Terms of Approximate Rank”, Theory Comput Syst, 2023