224 citations to https://www.mathnet.ru/rus/mzm4883
  1. Arkadev Chattopadhyay, Ricard Gavaldà, Kristoffer Arnsfelt Hansen, Denis Thérien, Lecture Notes in Computer Science, 6651, Computer Science – Theory and Applications, 2011, 29  crossref
  2. Fengming Wang, Lecture Notes in Computer Science, 6648, Theory and Applications of Models of Computation, 2011, 164  crossref
  3. Arkadev Chattopadhyay, Shachar Lovett, 2011 IEEE 26th Annual Conference on Computational Complexity, 2011, 300  crossref
  4. Sebastian Faust, Tal Rabin, Leonid Reyzin, Eran Tromer, Vinod Vaikuntanathan, Lecture Notes in Computer Science, 6110, Advances in Cryptology – EUROCRYPT 2010, 2010, 135  crossref
  5. Mark Braverman, “Polylogarithmic independence fools AC 0 circuits”, J. ACM, 57:5 (2010), 1  crossref
  6. Parikshit Gopalan, Subhash Khot, Rishi Saket, “Hardness of Reconstructing Multivariate Polynomials over Finite Fields”, SIAM J. Comput., 39:6 (2010), 2598  crossref
  7. Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 2010, 695  crossref
  8. Omer Barkol, Yuval Ishai, Enav Weinreb, “On d-Multiplicative Secret Sharing”, J Cryptol, 23:4 (2010), 580  crossref
  9. Mark Braverman, 2009 24th Annual IEEE Conference on Computational Complexity, 2009, 3  crossref
  10. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai, “Zero-Knowledge Proofs from Secure Multiparty Computation”, SIAM J. Comput., 39:3 (2009), 1121  crossref
Предыдущая
1
9
10
11
12
13
14
15
23
Следующая