Mohammad Bavarian, Thomas Vidick, Henry Yuen, “Anchored Parallel Repetition for Nonlocal Games”, SIAM J. Comput., 51, no. 2, 2022, 214
Nikos Leonardos, Michael Saks, 2009 24th Annual IEEE Conference on Computational Complexity, 2009, 341
H. Klauck, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings., 2003, 118
Benedikt Auerbach, David Cash, Manuel Fersch, Eike Kiltz, 10401, Advances in Cryptology – CRYPTO 2017, 2017, 101
Mark Braverman, Anup Rao, Omri Weinstein, Amir Yehudayoff, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013, 746
Seung Geol Choi, Dana Dachman-Soled, S. Dov Gordon, Linsheng Liu, Arkady Yerukhimovich, 13748, Theory of Cryptography, 2022, 348
Or Meir, Avi Wigderson, “Prediction from Partial Information and Hindsight, with Application to Circuit Lower Bounds”, comput. complex., 28, no. 2, 2019, 145
Thomas Locher, Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures, 2011, 299
Paul Beame, Trinh Huynh, “The Value of Multiple Read/Write Streams for Approximating Frequency Moments”, ACM Trans. Comput. Theory, 3, no. 2, 2012, 1
Itai Ashlagi, Mark Braverman, Yash Kanoria, Peng Shi, “Clearing Matching Markets Efficiently: Informative Signals and Match Recommendations”, Management Science, 66, no. 5, 2020, 2163