1. A. Ambainis, A note on quantum black-box complexity of almost all Boolean functions, Inform. Process. Lett. 71(1) (1999) 5–7. Also at http://arxiv.org/abs/quant-ph/9811080.
2. A. Ambainis, R. de Wolf, Average-case quantum query complexity, in: Proc. 17th Annu. Symp. on Theoretical Aspects of Computer Science (STACS’2000), Lecture Notes in Computer Science, Vol. 1770, Springer, Berlin, 2000, pp. 133–144, quant-ph/9904079.
3. R. Beals, H. Buhrman, R. Cleve, M. Mosca, R. de Wolf, Quantum lower bounds by polynomials, in: Proc. 39th FOCS, 1998, pp. 352–361, quant-ph/9802049.
4. R. Beigel, The polynomial method in circuit complexity. Proc. 8th IEEE Structure in Complexity Theory Conf., 1993, pp. 82–95.
5. Sensitivity vs. block sensitivity (an average-case study);Bernasconi;Inform. Process. Lett.,1996