1. Computational Complexity and Nondeterminism in Flowchart Programs;Baker;Ph.D. Dissertation, Cornell Computer Science Technical Report 73-185,1973
2. “Natural” properties of flowchart complexity measures;Baker,1974
3. A machine independent theory of the complexity of recursive functions;Blum;J. Assoc. Comput. Mach.,1967
4. Dense and non-dense families of complexity classes;Borodin,1969
5. On the Problem of Finding Natural Computational Complexity Measures;Hartmanis;Cornell Computer Science Technical Report 73-179,1973