Amir Yehudayoff, “Pointer chasing via triangular discrimination”, Combinator. Probab. Comp., 29, no. 4, 2020, 485
Ran Raz, “A Parallel Repetition Theorem”, SIAM J. Comput., 27, no. 3, 1998, 763
Z. Bar-Yossef, T.S. Jayram, R. Kumar, D. Sivakumar, Proceedings 17th IEEE Annual Conference on Computational Complexity, 2002, 93
Sepideh Mahabadi, Ilya Razenshteyn, David P. Woodruff, Samson Zhou, Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, 1251
Paul Beame, Dang-Trinh Huynh-Ngoc, 2008 49th Annual IEEE Symposium on Foundations of Computer Science, 2008, 499
Mark Braverman, Omri Weinstein, 7408, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012, 459
Rahul Jain, Hartmut Klauck, Shengyu Zhang, 6196, Computing and Combinatorics, 2010, 54
Mark Braverman, Omri Weinstein, “A Discrepancy Lower Bound for Information Complexity”, Algorithmica, 76, no. 3, 2016, 846
M. Fischlin, Proceedings 38th Annual Symposium on Foundations of Computer Science, 1997, 438
Yi Li, Xiaoming Sun, Chengu Wang, David P. Woodruff, 8784, Distributed Computing, 2014, 499