{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:41:25Z","timestamp":1725457285781},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540633983"},{"type":"electronic","value":"9783540695370"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0033839","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T07:27:37Z","timestamp":1134286057000},"page":"95-109","source":"Crossref","is-referenced-by-count":1,"title":["Transformation of divide & conquer to nested parallel loops"],"prefix":"10.1007","author":[{"given":"Christoph A.","family":"Herrmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Lengauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,21]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"K. Achatz and W. Schulte. Architecture independent massive parallelization of divide-and-conquer algorithms. In Mathematics of Program Construction, Lecture Notes in Computer Science 947, pages 97\u2013127. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60117-1_7"},{"key":"7_CR2","unstructured":"A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Series in Computer Science and Information Processing. Addison-Wesley, 1974."},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"R. S. Bird. Lectures on constructive functional programming. In M. Broy, editor, Constructive Methods in Computing Science, NATO ASI Series F: Computer and Systems Sciences, Vol. 55, pages 151\u2013216. Springer-Verlag, 1988.","DOI":"10.1007\/978-3-642-74884-4_5"},{"key":"7_CR4","unstructured":"M. I. Cole. Algorithmic Skeletons: Structured Management of Parallel Computation. Research Monographs in Parallel and Distributed Computing. Pitman, 1989."},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"J. Darlington, A. Field, P. Harrison, P. Kelly, D. Sharp, Q. Wu, and R. While. Parallel programming using skeleton functions. In A. Bode, M. Reeve, and G. Wolf, editors, Parallel Architectures and Languages Europe (PARLE '93), Lecture Notes in Computer Science 694, pages 146\u2013160. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-56891-3_12"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"S. Gorlatch. Systematic efficient parallelization of scan and other list homomorphisms. In L. Boug\u00e9, P. Fraigniaud, A. Mignotte, and Y. Robert, editors, Euro-Par'96, Lecture Notes in Computer Science 1124, pages 401\u2013408. Springer-Verlag, 1996.","DOI":"10.1007\/BFb0024729"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"S. Gorlatch. Systematic extraction and implementation of divide-and-conquer parallelism. In H. Kuchen and D. Swierstra, editors, Programming Languages: Implementation, Logics and Programs, Lecture Notes in Computer Science 1140, pages 274\u2013288. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61756-6_91"},{"key":"7_CR8","unstructured":"S. Gorlatch and H. Bischof. Formal derivation of divide-and-conquer programs: A case study in the multidimensional FFT's. In D. Mery, editor, Formal Methods for Parallel Programming: Theory and Applications, pages 80\u201394. IEEE Computer Society Press, 1997."},{"issue":"4","key":"7_CR9","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1142\/S0129626496000479","volume":"6","author":"C. A. Herrmann","year":"1996","unstructured":"C. A. Herrmann and C. Lengauer. On the space-time mapping of a class of divideand-conquer recursions. Parallel Processing Letters, 6(4):525\u2013537, 1996.","journal-title":"Parallel Processing Letters"},{"key":"7_CR10","unstructured":"C. A. Herrmann and C. Lengauer. Parallelization of divide-and-conquer by translation to nested loops. Technical Report MIP-9705, Fakult\u00e4t f\u00fcr Mathematik und Informatik, Universit\u00e4t Passau, March 1997."},{"key":"7_CR11","unstructured":"E. Horowitz and S. Sahni. Fundamentals of Computer Algorithms. Computer Software Engineering Series. Computer Science Press, 1984."},{"key":"7_CR12","unstructured":"C.-H. Huang, J.R. Johnson, and R.W. Johnson. Generating parallel programs from tensor product formulas: A case study of Strassens's matrix multiplication algorithm. In Proc. Int. Conf. on Parallel Processing, volume III, pages 104\u2013108, 1992."},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"S. Kindermann. Flexible program and architecture specification for massively parallel systems. In B. Buchberger and J. Volkert, editors, Parallel Processing: CONPAR 94 \u2014 VAPP VI, Lecture Notes in Computer Science 854, pages 160\u2013171. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58430-7_15"},{"issue":"6","key":"7_CR14","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 Trans. on Programming Languages and Systems, 16(6):1737\u20131767, November 1994.","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Z. G. Mou. Divacon: A parallel language for scientific computing based on divideand-conquer. In Proc. 3rd Symp. Frontiers of Massively Parallel Computation, pages 451\u2013461. IEEE Computer Society Press, October 1990.","DOI":"10.1109\/FMPC.1990.89496"},{"key":"7_CR16","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF02242355","volume":"7","author":"A. Sch\u00f6nhage","year":"1971","unstructured":"A. Sch\u00f6nhage and V. Strassen. Schnelle Multiplikation grosser Zahlen. Computing, 7:281\u2013292, 1971.","journal-title":"Computing"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"D. B. Skillicorn. Foundations of Parallel Programming. Cambridge International Series on Parallel Computation. Cambridge University Press, 1994.","DOI":"10.1017\/CBO9780511526626"},{"key":"7_CR18","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V. Strassen","year":"1969","unstructured":"V. Strassen. Gaussian elimination is not optimal. Numerische Mathematik, 13:354\u2013356, 1969.","journal-title":"Numerische Mathematik"}],"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\/BFb0033839","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T13:51:19Z","timestamp":1586613079000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0033839"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633983","9783540695370"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0033839","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}