1. Akers, S., Robbins, T.: Logical design with three-input majority gates. Comput. Des. 12–27 (1963)
2. Ambainis, A.: Upper bound on the communication complexity of private information retrieval. In: Proc. of the 24th International Colloquium on Automata Languages and Programing (ICALP), pp. 401–407 (1997)
3. Arora, S., Safra, S.: Probabilistic checking of proofs: a new characterization of NP. J. ACM 45(1), 70–122 (1998). Preliminary version in FOCS ’92
4. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. J. ACM 45(3), 501–555 (1998). Preliminary version in FOCS ’92
5. Assmus, E., Key, J.: Designs and Their Codes. Cambridge University Press, Cambridge (1992)