1. Three theorems on polynomial degrees of NP-sets. In: Proceedings of the 26th Ann. IEEE Symp. Found. of Comp. Sci (1985), pp. 51–55.
2. and , Succinctness, verifiability and determinism in representations of polynomial time languages. In: Proceedings of the 20th Ann. IEEE Symp. Found of Comp. Sci. (1979), pp. 392–396.
3. and , Theory of Computation. John Wiley & Sons, New York 1974.
4. A Machine-Independent Theory of the Complexity of Recursive Functions
5. An invariance notion in recursion theory