1. Aggarwal, A., Chandra, A. K., and Snir, M.: Hierarchical memory with block transfer. Proc. 28th Annual IEEE Symposium on Foundations of Computer Science (1987) 204–216
2. Boppana, R. B. and Sipser, M.: The complexity of finite functions, in Handbook of Theoretical Computer Science Vol. A, J. van Leeuwen, ed. (1990) 757–804
3. Buss, J. F. and Goldsmith, J.: Nondeterminism within P. SIAM J. Comput.
22 (1993) 560–572
4. Buss, S. R.: The Boolean formula value problem is in ALOGTIME. Proc. 19th Annual ACM Symposium on Theory of Computing (1987) 123–131
5. Buss, S., Cook, S., Gupta, A., and Ramachandran, V.: An optimal parallel algorithm for formula evaluation. SIAM J. Comput.
21 (1992) 755–780