1. Aanderaa, S. O, 1971, On the decision problem for formulas in which all disjunctions are binary. Proc. 2nd Scandinavian Logic Symposium, 1–18.
2. Aanderaa, S. O, 1974, On k-tape versus (k-1)-tape real time computation. SIAM-AMS Proc. 7, 75–96.
3. Aanderaa, S. O, 1976, Horn formulas and the P=NP problem. European Meeting of the ASL, Oxford (See JSL 42(1977) p437 and full version in Theorem 1 of Aanderaa & Börger 1979
4. Aanderaa, S. O. & Börger, E., 1979, The Horn Complexity of Boolean functions and Cook's problem. Proc. 5th Scan. Logic Symp. (Eds. B. Mayoh & F. Jensen), Aalborg University Press, 231–256
5. The equivalence of Horn and network complexity of Boolean functions;Aanderaa;Acta Informatica,1981