1. Batcher, K.E., Sorting networks and their applications, Proc. AFIPS Spring Joint Computer Conference, Vol. 32, AFIPS Press, Montvale, N.J., (1968), 296–291.
2. Ehrenfeucht, A., Practical decidability, Report CU-CS-008-72, Dept. of Computer Science, Univ. of Colorado, Boulder, Colo., (1972), 14 pp.
3. Fischer, M.J., Lectures on network complexity, University of Frankfurt, Germany, June 1974, 25 pp.
4. Fischer M.J., and A.R. Meyer, Boolean matrix multiplication and transitive closure, Proc. 12th IEEE Symp. on Switching and Automata Theory (1971), 129–131.
5. Fischer, M.J. and M.O. Rabin, Super-exponential complexity of Presburger arithmetic. In Complexity of Computation, SIAM-AMS Proceedings, Vol. 7 (1974), 27–41.