Parikshit Gopalan, Subhash Khot, Rishi Saket, “Hardness of Reconstructing Multivariate Polynomials over Finite Fields”, SIAM J. Comput., 39:6 (2010), 2598
Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 2010, 695
Omer Barkol, Yuval Ishai, Enav Weinreb, “On d-Multiplicative Secret Sharing”, J Cryptol, 23:4 (2010), 580
Mark Braverman, 2009 24th Annual IEEE Conference on Computational Complexity, 2009, 3
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai, “Zero-Knowledge Proofs from Secure Multiparty Computation”, SIAM J. Comput., 39:3 (2009), 1121
Parikshit Gopalan, Shachar Lovett, Amir Shpilka, 2009 24th Annual IEEE Conference on Computational Complexity, 2009, 173
Rahul Santhanam, “Circuit Lower Bounds for Merlin–Arthur Classes”, SIAM J. Comput., 39:3 (2009), 1038
Benjamin Rossman, Lecture Notes in Computer Science, 5514, Logic, Language, Information and Computation, 2009, 350
Arkadev Chattopadhyay, Avi Wigderson, 2009 50th Annual IEEE Symposium on Foundations of Computer Science, 2009, 43
Ido Ben-Eliezer, Rani Hod, Shachar Lovett, Lecture Notes in Computer Science, 5687, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2009, 366