1. Adleman, L. Two theorems on random polynomial time, Proc. 19th IEEE FOCS (1978), 75–83.
2. Aho, A.V., Hopcroft, J.E. and Ullman, J.D. The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass. (1974).
3. Awerbuch, B. and Shiloach, Y. New connectivity and MSF algorithms for Ultracomputer and PRAM. Preprint, IBM-Israel Scientific Center, Technion, Haifa (1983).
4. Beame, P.W., Cook, S.A. and Hoover, H.J. Small depth circuits for integer products, powers, and division. Preprint (1983).
5. Berkowitz, S.J. On computing the determinant in small parallel time using a small number of processors. Preprint (1982).