Dmitry Gavinsky, Shachar Lovett, Srikanth Srinivasan, 2012 IEEE 27th Conference on Computational Complexity, 2012, 287
Ido Ben-Eliezer, Rani Hod, Shachar Lovett, “Random low-degree polynomials are hard to approximate”, comput. complex., 21:1 (2012), 63
Gil Cohen, Amir Shpilka, Avishay Tal, Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, 2012, 409
Richard J. Lipton, Kenneth W. Regan, Atri Rudra, Lecture Notes in Computer Science, 6907, Mathematical Foundations of Computer Science 2011, 2011, 436
Andrej Bogdanov, Akinori Kawachi, Hidetoki Tanaka, Lecture Notes in Computer Science, 6907, Mathematical Foundations of Computer Science 2011, 2011, 120
Arkadev Chattopadhyay, Ricard Gavaldà, Kristoffer Arnsfelt Hansen, Denis Thérien, Lecture Notes in Computer Science, 6651, Computer Science – Theory and Applications, 2011, 29
Fengming Wang, Lecture Notes in Computer Science, 6648, Theory and Applications of Models of Computation, 2011, 164
Arkadev Chattopadhyay, Shachar Lovett, 2011 IEEE 26th Annual Conference on Computational Complexity, 2011, 300
Sebastian Faust, Tal Rabin, Leonid Reyzin, Eran Tromer, Vinod Vaikuntanathan, Lecture Notes in Computer Science, 6110, Advances in Cryptology – EUROCRYPT 2010, 2010, 135
Mark Braverman, “Polylogarithmic independence fools AC 0 circuits”, J. ACM, 57:5 (2010), 1