1. Adleman, L., Two Theorems on Random Polynomial Time Proc. 19th IEEE FOCS (1978), pp. 75–83
2. Adleman, L., and Manders, K., Reducibility, Randomness and Intractability Proc. 9th ACM STOC (1977), pp. 151–163
3. Ajtai, M., and Ben-Or, M., A Theorem on Probabilistic Constant Depth Computations Proc. 16th ACM STOC (1984), pp. 471–474
4. Ajtai, M., and Wigderson, A., Deterministic Simulation of Probabilistic Constant Depth Circuits Proc. 26th IEEE FOCS (1985), pp. 11–19
5. Aleliunas, R., Karp, R.M., Lipton, R.J., Lovász, L., and Rackoff, C., Random Walks, Traversal Sequences and the Complexity of Maze Problems Proc. 20th IEEE FOCS (1979), pp. 218–223