{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T23:41:29Z","timestamp":1767138089896,"version":"build-2238731810"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540068419","type":"print"},{"value":"9783662215456","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1974]]},"DOI":"10.1007\/978-3-662-21545-6_9","type":"book-chapter","created":{"date-parts":[[2013,12,7]],"date-time":"2013-12-07T05:10:34Z","timestamp":1386393034000},"page":"129-140","source":"Crossref","is-referenced-by-count":1,"title":["Relations between Semantics and Complexity of Recursive Programs"],"prefix":"10.1007","author":[{"given":"Giorgio","family":"Ausiello","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","volume-title":"Mass","author":"G Ausiello","year":"1970","unstructured":"G. Ausiello: On bounds on the number of steps to compute functions, Second Annual Symp. on Theory of Computing, Northampton, Mass. (1970)"},{"key":"9_CR2","unstructured":"G. Ausiello: Resource bounded computations, to be published"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"M. Blum: A machine independent theory of the complexity of recursive functions, J. ACM 14 (1967)","DOI":"10.1145\/321386.321395"},{"key":"9_CR4","volume-title":"Type two computational complexity, Fifth Annual ACM Symposium on Theory of Computing","author":"RL Constable","year":"1973","unstructured":"R.L. Constable: Type two computational complexity, Fifth Annual ACM Symposium on Theory of Computing, Austin, Texas (1973)"},{"key":"9_CR5","volume-title":"Amsterdam","author":"JW Bakker","year":"1971","unstructured":"J.W. De Bakker: Recursive procedures, Math. Centre Tracts 24, Amsterdam (1971)"},{"key":"9_CR6","volume-title":"On the problem of finding natural complexity measures, Mathematical Foundations of Computer Science","author":"J Hartmanis","year":"1973","unstructured":"J. Hartmanis: On the problem of finding natural complexity measures, Mathematical Foundations of Computer Science, High Tatras, Czechoslovakia (1973)"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"J. Hartmanis, J.Hoperoft: An overview of the theory of computational complexity, J. ACM 18 (1971)","DOI":"10.1145\/321650.321661"},{"key":"9_CR8","unstructured":"N. Lynch: Relativization of the theory of computational complexity, MAC-TR 99, MIT (1972)"},{"key":"9_CR9","volume-title":"N.M","author":"[9]Z Manna","year":"1972","unstructured":"]Z. Manna, S. Ness, J. Vuillemin: Inductive methods for proving properties of programs, ACM Conference on proving assertions about programs, Las Cruces, N.M. (1972)"},{"key":"9_CR10","volume-title":"of Waterloo","author":"DM Symes","year":"1971","unstructured":"D.M. Symes: The extension of machine independent computational complexity theory to oracle machines computations and to the computation of finite functions, Research Report CSRR 2057, Univ. of Waterloo (1971)"},{"key":"9_CR11","volume-title":"Mc Graw Hill","author":"H Rogers","year":"1967","unstructured":"H. Rogers: Theory of recursive functions and effective computability, Mc Graw Hill (1967)"},{"key":"9_CR12","volume-title":"Oxford University Computing Laboratory PRG-2","author":"D Scott","year":"1970","unstructured":"D. Scott: Outline of a mathematical theory of computation, Oxford University Computing Laboratory PRG-2 (1970)"},{"key":"9_CR13","volume-title":"Correct and optimal implementations of recursion in a simple programming language, Fifth Annual ACM Symposium on Theory of Computing","author":"J Vuillemin","year":"1973","unstructured":"J. Vuillemin: Correct and optimal implementations of recursion in a simple programming language, Fifth Annual ACM Symposium on Theory of Computing, Austin, Texas (1973)"},{"key":"9_CR14","volume-title":"On the computational complexity of program schemata TR 74-196, Dept. of Computer Science","author":"K Weihrauch","year":"1974","unstructured":"K. Weihrauch: On the computational complexity of program schemata TR 74\u2013196, Dept. of Computer Science, Cornell University, Ithaca, n.y. (1974)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-21545-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T08:56:37Z","timestamp":1561971397000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-21545-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974]]},"ISBN":["9783540068419","9783662215456"],"references-count":14,"aliases":["10.1007\/3-540-06841-4_56"],"URL":"https:\/\/doi.org\/10.1007\/978-3-662-21545-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1974]]}}}