{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T23:48:45Z","timestamp":1767138525896,"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_12","type":"book-chapter","created":{"date-parts":[[2013,12,7]],"date-time":"2013-12-07T05:10:34Z","timestamp":1386393034000},"page":"170-184","source":"Crossref","is-referenced-by-count":1,"title":["Application of Church-Rosser Properties to Increase the Parallelism and Efficiency of Algorithms"],"prefix":"10.1007","author":[{"given":"Mariangiola","family":"Dezani-Ciancaglini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maddalena","family":"Zacchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"B\u00f6hm, C., M. Dezani-Ciancaglini, To what extent can or must a computation be parallelized, to appear in Proc. of the International Summer School on New Concepts and Technologies in Parallel Information Processing, ed.E. Caianiello, NATO ASI SERIES."},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1145\/355592.365646","volume":"5","author":"C B\u00f6hm","year":"1966","unstructured":"B\u00f6hm, C., G. Jacopini, Flow Diagrams, Turing Machines and Languages with only two Formation Rules, Comm.of the ACM,9, 5, (1966), 366\u2013371.","journal-title":"Comm.of the ACM,9"},{"key":"12_CR3","unstructured":"Caracciolo di Forino, A., Generalized Markow Algorithms and Automata Theory\u201e Proc. of the International Summer School on Automata Theory, ed. E.Caianiello, Academic Press, New Yrk, (1966), 115\u2013130."},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/BF02575518","volume":"8","author":"G Germano","year":"1971","unstructured":"Germano, G., A. Maggiolo-Schettini, Equivalence of Partial Recursivity and Computability by Algorithms Without Concluding Formulas, Calcolo, 8, (1971), 273\u2013291.","journal-title":"Calcolo"},{"key":"12_CR5","first-page":"32","volume-title":"On maximally parallel schemata","author":"M Keller","year":"1970","unstructured":"Keller, M., On maximally parallel schemata, IEEE Conf., Santa Monica, (1970), 32\u201350."},{"issue":"3","key":"12_CR6","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/321765.321782","volume":"20","author":"M Keller","year":"1973","unstructured":"Keller, M., Parallel program schemata and maximal parallelism 1: Fundamental results, Journal of the ACM, 20, 3, (1973), 514\u2013537.","journal-title":"Journal of the ACM"},{"issue":"4","key":"12_CR7","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1145\/321784.321795","volume":"20","author":"M Keller","year":"1973","unstructured":"Keller, M., Parallel program schemata and maximal parallelism 11: Construction of Closures, Journal of the ACM, 20, 4, (1973), 696\u2013710.","journal-title":"Journal of the ACM"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Knuth, D.E., P.E.Bendix, Simple Word Problem in Universal Algebra, Computational Problems in Abstract Algebra, ed. J.Leech, Pergamon Press, Braunschweig, (1970), 263\u2013297.","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"key":"12_CR9","first-page":"7","volume":"1","author":"DE Knuth","year":"1968","unstructured":"Knuth, D.E., The Art of Computer Programming, Addison-Wesley, 1, (1968), 7\u20138.","journal-title":"Addison-Wesley"},{"key":"12_CR10","first-page":"27","volume-title":"Inductive Methods for Proving Properties of Programs, Proc","author":"Z Manna","year":"1972","unstructured":"Manna, Z., S. Ness, J. Vuillemin, Inductive Methods for Proving Properties of Programs, Proc. of ACM Conference on Proving Assertion About Programs, Las Cruces, (1972), 27\u201350."},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1145\/321738.321750","volume":"20","author":"BK Rosen","year":"1973","unstructured":"Rosen, B.K., Tree Manipulating Systems and Church-Rosser Theorems, ACM Journal, 20, (1973), 160\u2013187.","journal-title":"ACM Journal"},{"key":"12_CR12","volume-title":"Une transformation de programmes sequentiels en programmes paralleles, to appear in Proc. of Colloque sur la programmation","author":"G Roucairol","year":"1974","unstructured":"Roucairol, G., Une transformation de programmes sequentiels en programmes paralleles, to appear in Proc. of Colloque sur la programmation, Paris, Springer Verlag ed., (1974)."},{"key":"12_CR13","unstructured":"Roucairol, G., A., Widory, Programmes sequentiels et parallelisme, R.A.I.R.O., B-2, (1973), 5\u201322."},{"key":"12_CR14","unstructured":"Wirth, M., Systematiches Programnieren, B.G. Tenbner, Stuttgart, (1972)."}],"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_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,4]],"date-time":"2019-08-04T12:42:32Z","timestamp":1564922552000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-21545-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974]]},"ISBN":["9783540068419","9783662215456"],"references-count":14,"aliases":["10.1007\/3-540-06841-4_59"],"URL":"https:\/\/doi.org\/10.1007\/978-3-662-21545-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1974]]}}}