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