{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:47:11Z","timestamp":1725662831507},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540089216"},{"type":"electronic","value":"9783540357575"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1978]]},"DOI":"10.1007\/3-540-08921-7_80","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T11:37:12Z","timestamp":1330169832000},"page":"326-332","source":"Crossref","is-referenced-by-count":0,"title":["Complexity measures defined by mazurkiewicz-algorithms"],"prefix":"10.1007","author":[{"given":"Gerhard","family":"Lischke","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"key":"29_CR1","first-page":"118","volume":"5","author":"G. Ausiello","year":"1971","unstructured":"Ausiello, G., Abstract computational complexity and cycling computations. JCSS 5 (1971) 118\u2013128.","journal-title":"JCSS"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Biskup, J., Path measures of Turing machine computations. To be presented at the 5th Colloquium Automata, Languages and Programming, Udine, July 1978.","DOI":"10.1007\/3-540-08860-1_8"},{"key":"29_CR3","unstructured":"Blikle, A., An algebraic approach to programs and their computations. Proc. of Symp. and Summer School MFCS, High Tatras, September 3\u20138, 1973, 17\u201326."},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Blikle, A., An extended approach to mathematical analysis of programs. CC PAS Reports 169, Warsaw 1974. Or: An analysis of programs by algebraic means. In: Banach Center Publications, Vol. 2, Warsaw 1977.","DOI":"10.4064\/-2-1-167-213"},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/321386.321395","volume":"14","author":"M. Blum","year":"1967","unstructured":"Blum, M., A machine-independent theory of the complexity of recursive functions. JACM 14 (1967) 322\u2013336.","journal-title":"JACM"},{"key":"29_CR6","volume-title":"Automata, languages and machines, vol. A","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg, S., Automata, languages and machines, vol. A. Academic Press, New York-London 1974."},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Havel, I.M., Weak complexity measures. SIGACT News, January 1971, 21\u201330.","DOI":"10.1145\/1247063.1247064"},{"key":"29_CR8","first-page":"423","volume":"11","author":"G. Lischke","year":"1975","unstructured":"Lischke, G., Flu\u00dfbildma\u00dfe \u2014 Ein Versuch zur Definition nat\u00fcrlicher Kompliziertheitsma\u00dfe. EIK 11 (1975) 423\u2013436.","journal-title":"EIK"},{"key":"29_CR9","volume-title":"Theory of recursive functions and effective computability","author":"H. Rogers Jr.","year":"1967","unstructured":"Rogers, H., Jr., Theory of recursive functions and effective computability. McGraw-Hill, New York 1967."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1978"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-08921-7_80.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:00:25Z","timestamp":1605625225000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-08921-7_80"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"ISBN":["9783540089216","9783540357575"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-08921-7_80","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1978]]}}}