1. Aaronson, S., Kuperberg, G.: Quantum versus classical proofs and advice. Theory of Computing 3, 129–157 (2007)
2. Aaronson, S., Le Gall, F., Russell, A., Tani, S.: The one-way communication complexity of group membership. arXiv:0902.3175v2
3. Alon, N., Babai, L., Itai, A.: A fast and simple randomized parallel algorithm for the maximal independent set problem. J. of Algorithms 7, 567–583 (1986)
4. Alon, N., Lubotzky, A., Wigderson, A.: Semi-direct product in groups and zig-zag product in graphs: connections and applications. In: Proc. 42nd FOCS, pp. 630–637. IEEE Computer Soc., Los Alamitos (2001)
5. Altseimer, C., Borovik, A.V.: Probabilistic recognition of orthogonal and symplectic groups. In: Groups and Computation III, deGruyter, pp. 1–20 (2001)