- K.W. Regan, D. Sivakumar, Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247), 1998, 186
- Guy Moshkovitz, 2012 IEEE 27th Conference on Computational Complexity, 2012, 159
- S. Aaronson, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings., 2003, 171
- Benny Applebaum, Pavel Raykov, 9985, Theory of Cryptography, 2016, 27
- Ryan Williams, Proceedings of the forty-fifth annual ACM symposium on Theory of Computing, 2013, 21
- E. Allender, L. Hellerstein, P. McCabe, T. Pitassi, M. Saks, 21st Annual IEEE Conference on Computational Complexity (CCC'06), 2006, 237
- Antonina Kolokolova, 5028, Logic and Theory of Algorithms, 2008, 316
- Magnus Gausdal Find, 8476, Computer Science - Theory and Applications, 2014, 167
- Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, D. Sivakumar, Martin Strauss, “A Generalization of Resource-Bounded Measure, with Application to the BPP vs. EXP Problem”, SIAM J. Comput., 30, № 2, 2000, 576
- Eric Allender, Michal Koucký, “Amplifying lower bounds by means of self-reducibility”, J. ACM, 57, № 3, 2010, 1