1. Allender, E., Rubinstein, R.: P-printable sets. SIAM J. Comput. 17, 1193–1202 (1988)
2. Allender, E., Strauss, M.: Measure on small complexity classes with applications for BPP. In: Proceedings of the 35th Symposium on Foundations of Computer Science, pp. 807–818. IEEE Computer Society (1994)
3. Allender, E., Strauss, M.: Measure on P Robustness of the notion. In: International Symposium on Mathematical Foundations of Computer Science, pp. 129–138. Springer (1995)
4. Ambos-Spies, K., Mayordomo, E.: Resource-bounded measure and randomness. In: Sorbi, A. (ed.) Complexity, Logic and Recursion Theory, Lecture Notes in Pure and Applied Mathematics, pp 1–47. Marcel Dekker, New York (1997)
5. Cai, J., Sivakumar, D., Strauss, M.: Constant-depth circuits and the Lutz hypothesis. In: Proceedings of the 38th Symposium on Foundations of Computer Science, pp. 595–604. IEEE Computer Society (1997)