{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T07:07:25Z","timestamp":1763968045916},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540617563"},{"type":"electronic","value":"9783540706540"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61756-6_91","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:20:33Z","timestamp":1330294833000},"page":"274-288","source":"Crossref","is-referenced-by-count":11,"title":["Systematic extraction and implementation of divide-and-conquer parallelism"],"prefix":"10.1007","author":[{"given":"Sergei","family":"Gorlatch","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"K. Achatz and W. Schulte. Architecture independent massive parallelization of divide-and-conquer algorithms. In B. Moeller, editor, Mathematics of Program Construction, Lecture Notes in Computer Science 947, pages 97\u2013127, 1995.","key":"19_CR1","DOI":"10.1007\/3-540-60117-1_7"},{"key":"19_CR2","first-page":"131","volume":"43","author":"D. Barnard","year":"1991","unstructured":"D. Barnard, J. Schmeiser, and D. Skillicorn. Deriving associative operators for language recognition. Bulletin of EATCS, 43:131\u2013139, 1991.","journal-title":"Bulletin of EATCS"},{"key":"19_CR3","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1145\/358234.381162","volume":"27","author":"J. Bentley","year":"1984","unstructured":"J. Bentley. Programming pearls. Communications of the ACM, 27:865\u2013871, 1984.","journal-title":"Communications of the ACM"},{"doi-asserted-by":"crossref","unstructured":"R. S. Bird. Lectures on constructive functional programming. In M. Broy, editor, Constructive Methods in Computing Science, NATO ASO Series F: Computer and Systems Sciences. Vol. 55, pages 151\u2013216. Springer Verlag, 1988.","key":"19_CR4","DOI":"10.1007\/978-3-642-74884-4_5"},{"issue":"11","key":"19_CR5","doi-asserted-by":"crossref","first-page":"1526","DOI":"10.1109\/12.42122","volume":"38","author":"G. Blelloch","year":"1989","unstructured":"G. Blelloch. Scans as primitive parallel operations. IEEE Trans. on Computers, 38(11):1526\u20131538, November 1989.","journal-title":"IEEE Trans. on Computers"},{"issue":"10","key":"19_CR6","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/122616.122620","volume":"20","author":"B. Carpentieri","year":"1991","unstructured":"B. Carpentieri and G. Mou. Compile-time transformations and optimizations of parallel divide-and-conquer algorithms. ACM SIGPLAN Notices, 20(10):19\u201328, 1991.","journal-title":"ACM SIGPLAN Notices"},{"issue":"2","key":"19_CR7","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1142\/S0129626495000175","volume":"5","author":"M. Cole","year":"1994","unstructured":"M. Cole. Parallel programming with list homomorphisms. Parallel Processing Letters, 5(2):191\u2013204, 1994.","journal-title":"Parallel Processing Letters"},{"unstructured":"A. Gibbons and W. Rytter. Efficient Parallel Algorithms. Cambridge Univ. Press, 1988.","key":"19_CR8"},{"unstructured":"J. Gibbons. The third homomorphism theorem. J. Fun. Programming. To appear.","key":"19_CR9"},{"doi-asserted-by":"crossref","unstructured":"J. Gibbons. Upwards and downwards accumulations on trees. In R. Bird, C. Morgan, and J. Woodcock, editors, Mathematics of Program Construction, Lecture Notes in Computer Science 669, pages 122\u2013138, 1992.","key":"19_CR10","DOI":"10.1007\/3-540-56625-2_11"},{"unstructured":"J. Gibbons. The third homomorphism theorem. Technical report, Univ. of Auckland, 1994.","key":"19_CR11"},{"unstructured":"S. Gorlatch. Constructing list homomorphisms. Technical Report MIP-9512, Universit\u00e4t Passau, 1995.","key":"19_CR12"},{"unstructured":"S. Gorlatch. Stages and transformations in parallel programming. In M. Kara et al., editors, Abstract Machine Models for Parallel and Distributed Computing, pages 147\u2013162. IOS Press, 1996.","key":"19_CR13"},{"doi-asserted-by":"crossref","unstructured":"S. Gorlatch. Systematic optimal parallelization of scan and other list homomorphisms. In Proceedings of the Euro-Par'96. LNCS, to appear, 1996.","key":"19_CR14","DOI":"10.1007\/BFb0024729"},{"doi-asserted-by":"crossref","unstructured":"Z. Grant-Duff and P. Harrison. Parallelism via homomorphisms. Parallel Processing Letters. To appear.","key":"19_CR15","DOI":"10.1142\/S0129626496000285"},{"unstructured":"B. Heinz. Lemma discovery by anti-unification of regular sorts. Technical Report 94-21, TU Berlin, May 1994.","key":"19_CR16"},{"key":"19_CR17","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0020-0190(94)00213-I","volume":"53","author":"J. Kornerup","year":"1995","unstructured":"J. Kornerup. Mapping a functional notation for parallel programs onto hypercubes. Information Processing Letters, 53:153\u2013158, 1995.","journal-title":"Information Processing Letters"},{"key":"19_CR18","first-page":"464","volume":"817","author":"H. Kuchen","year":"1994","unstructured":"H. Kuchen, R. Plasmeijer, and H. Stolze. Distributed implementation of a dataparallel functional language. In PARLE'94, LNCS 817, pages 464\u2013477, 1994.","journal-title":"PARLE'94, LNCS"},{"issue":"3","key":"19_CR19","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/0167-8191(94)00104-I","volume":"21","author":"K. Kumar","year":"1995","unstructured":"K. Kumar and D. Skillicorn. Data parallel geometric operations on lists. Parallel Computing, 21(3):447\u2013459, 1995.","journal-title":"Parallel Computing"},{"key":"19_CR20","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","volume":"27","author":"R. Ladner","year":"1980","unstructured":"R. Ladner and M. Fischer. Parallel prefix computation. J. ACM, 27:831\u2013838, 1980.","journal-title":"J. ACM"},{"issue":"6","key":"19_CR21","doi-asserted-by":"crossref","first-page":"1737","DOI":"10.1145\/197320.197356","volume":"16","author":"J. Misra","year":"1994","unstructured":"J. Misra. Powerlist: a structure for parallel recursion. ACM TOPLAS, 16(6):1737\u20131767, 1994.","journal-title":"ACM TOPLAS"},{"doi-asserted-by":"crossref","unstructured":"Z. G. Mou. Divacon: A parallel language for scientific computing based on divide and conquer. In Proc. 3rd Symposium on the Frontiers of Massively Parallel Computation, pages 451\u2013461, October 1990.","key":"19_CR22","DOI":"10.1109\/FMPC.1990.89496"},{"issue":"3","key":"19_CR23","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1142\/S0129626494000302","volume":"4","author":"J. O'Donnell","year":"1994","unstructured":"J. O'Donnell. A correctness proof of parallel scan. Parallel Processing Letters, 4(3):329\u2013338, 1994.","journal-title":"Parallel Processing Letters"},{"issue":"5","key":"19_CR24","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/358645.358660","volume":"24","author":"F. Preparata","year":"1981","unstructured":"F. Preparata and J. Vuillemin. The cube-connected cycles: A versatile network for parallel computation. Communications of the ACM, 24(5):300\u2013309, 1981.","journal-title":"Communications of the ACM"},{"unstructured":"M. J. Quinn. Parallel Computing. McGraw-Hill, Inc., 1994.","key":"19_CR25"},{"doi-asserted-by":"crossref","unstructured":"D. Skillicorn. Foundations of Parallel Programming. Cambridge Univ. Press, 1994.","key":"19_CR26","DOI":"10.1017\/CBO9780511526626"},{"key":"19_CR27","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1006\/jpdc.1995.1089","volume":"28","author":"D. Skillicorn","year":"1995","unstructured":"D. Skillicorn and W. Cai. A cost calculus for parallel functional programming. Journal of Parallel and Distributed Computing, 28:65\u201383, 1995.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"19_CR28","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0167-6423(87)90034-7","volume":"8","author":"D. Smith","year":"1987","unstructured":"D. Smith. Applications of a strategy for designing divide-and-conquer algorithms. Science of Computer Programming, (8):213\u2013229, 1987.","journal-title":"Science of Computer Programming"},{"doi-asserted-by":"crossref","unstructured":"D. Swierstra and O. de Moor. Virtual data structures. In B. Moeller, H. Partsch, and S. Schuman, editors, Formal Program Development, Lecture Notes in Computer Science 755, pages 355\u2013371.","key":"19_CR29","DOI":"10.1007\/3-540-57499-9_26"},{"key":"19_CR30","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1016\/0167-8191(94)90033-7","volume":"20","author":"D. Walker","year":"1994","unstructured":"D. Walker. The design of a standard message passing interface for distributed memory concurrent computers. Parallel Computing, 20:657\u2013673, 1994.","journal-title":"Parallel Computing"}],"container-title":["Lecture Notes in Computer Science","Programming Languages: Implementations, Logics, and Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61756-6_91.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:10:23Z","timestamp":1605647423000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61756-6_91"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617563","9783540706540"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-61756-6_91","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}