1. Ambainis, A.: Superlinear advantage for exact quantum algorithms. In: Proceedings of the 45th Annual ACM Symposium on Theory of Computing, pp. 891–900. ACM (2013).
http://dl.acm.org/citation.cfm?id=2488721
2. Ambainis, A., Balodis, K., Belovs, A., Lee, T., Santha, M., Smotrovs, J.: Separations in query complexity based on pointer functions. In: Proceedings of the 48th Annual ACM Symposium on Theory of Computing, pp. 800–813. ACM (2016)
3. Ambainis, A., Iraids, J., Nagaj, D.: Exact quantum query complexity of
$$\text{EXACT}_{k,l}^n$$
. arXiv preprint abs/1608.02374 (2016).
http://arxiv.org/abs/1608.02374
4. Ambainis, A., Iraids, J., Smotrovs, J.: Exact quantum query complexity of EXACT and THRESHOLD. In: TQC, pp. 263–269 (2013)
5. Beals, R., Buhrman, H., Cleve, R., Mosca, M., de Wolf, R.: Quantum lower bounds by polynomials. J. ACM 48(4), 778–797 (2001)