1. S. Aaronson, S. Ben-David and R. Kothari, Separations in query complexity using cheat sheets, in STOC’16—Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, ACM, New York, 2016, pp. 863–876.
2. S. Aaronson, S. Ben-David, R. Kothari, S. Rao and A. Tal, Degree vs. approximate degree and quantum implications of Huang’s sensitivity theorem, in STOC’ 21—Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, ACM, New York, 2021, pp. 1330–1342.
3. A V. Aho, J. D. Ullman and M. Yannakakis, On notions of information transfer in VLSI circuits, in STOC’ 83—Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, ACM, New York, 1983, pp. 133–139.
4. M. Ajtai, J. Komlós and E. Szemerédi, A note on Ramsey numbers, Journal of Combinatorial Theory. Series A 29 (1980), 354–360.
5. N. Alon, Perturbed identity matrices have high rank: proof and applications, Combinatorics, Probability, and Computing 18 (2009), 3–15.