1. A lower bound for primality;Allender;J. Comput. System Sci.,2001
2. Multiparty protocols, pseudorandom generators for logspace and time–space trade-offs;Babai;J. Comput. System Sci.,1992
3. Double character sums over elliptic curves and finite fields;Banks;Quart. J. Appl. Pure Math.,2005
4. A. Bernasconi, C. Damm, I.E. Shparlinski, Circuit and decision tree complexity of some number theoretic problems, Tech. Report 98–21, Dept. of Math. and Comp. Sci., Univ. of Trier, 1998, pp. 1–17
5. On the average sensitivity of testing square-free numbers;Bernasconi,1999