{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T15:25:05Z","timestamp":1772205905417,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Supercomputing"],"published-print":{"date-parts":[[1998,1]]},"DOI":"10.1023\/a:1007981511582","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T07:13:40Z","timestamp":1040541220000},"page":"85-97","source":"Crossref","is-referenced-by-count":10,"title":["Programming with Divide-and-Conquer Skeletons: A Case Study of FFT"],"prefix":"10.1007","volume":"12","author":[{"given":"Sergei","family":"Gorlatch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"158093_CR1","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.","DOI":"10.1007\/3-540-60117-1_7"},{"key":"158093_CR2","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1145\/359576.359579","volume":"21","author":"J. W. Backus","year":"1978","unstructured":"J. W. Backus. Can programming be liberated from the von Neumann style? Communications of the ACM, 21:613\u2013641, 1978.","journal-title":"Communications of the ACM"},{"key":"158093_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":"158093_CR4","unstructured":"M. Cole. Algorithmic Skeletons: A Structured Approach to the Management of Parallel Computation. PhD thesis, University of Edinburgh, 1988."},{"key":"158093_CR5","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":"158093_CR6","doi-asserted-by":"crossref","unstructured":"S. Gorlatch. Systematic efficient parallelization of scan and other list homomorphisms. In L. Boug\u00e9 et al., editors, Parallel Processing. Euro-Par'96, Lecture Notes in Computer Science 1124, pages 401\u2013408. Springer-Verlag, 1996.","DOI":"10.1007\/BFb0024729"},{"key":"158093_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. PLILP'96, Lecture Notes in Computer Science 1140, pages 274\u2013288. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61756-6_91"},{"key":"158093_CR8","unstructured":"S. Gorlatch. Optimizing compositions of scans and reductions in parallel program derivation. Technical Report MIP-9711, Universit\u00e4t Passau, May 1997."},{"key":"158093_CR9","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. Workshop at IPPS'97, pages 80\u201394, 1997. Available from http:\/\/brahms.fmi.unipassau.de\/cl\/papers\/GorBi97.html."},{"issue":"6","key":"158093_CR10","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1007\/BF01211000","volume":"7","author":"S. Gorlatch","year":"1995","unstructured":"S. Gorlatch and C. Lengauer. Parallelization of divide-and-conquer in the Bird-Meertens formalism. Formal Aspects of Computing, 7(6):663\u2013682, 1995.","journal-title":"Formal Aspects of Computing"},{"key":"158093_CR11","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":"158093_CR12","unstructured":"V. Kumar et al. Introduction to Parallel Computing. Benjamin\/Cummings Publ., 1994."},{"issue":"6","key":"158093_CR13","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"},{"issue":"3","key":"158093_CR14","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF00129780","volume":"2","author":"Z. G. Mou","year":"1988","unstructured":"Z. G. Mou and P. Hudak. An algebraic model for divide-and-conquer algorithms and its parallelism. Journal of Supercomputing, 2(3):257\u2013278, 1988.","journal-title":"Journal of Supercomputing"},{"key":"158093_CR15","doi-asserted-by":"crossref","unstructured":"D. Skillicorn. Foundations of Parallel Programming. Cambridge U. P., 1994.","DOI":"10.1017\/CBO9780511526626"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007981511582.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1007981511582\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007981511582.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T05:11:17Z","timestamp":1754629877000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1007981511582"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["158093"],"URL":"https:\/\/doi.org\/10.1023\/a:1007981511582","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}