{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:38:39Z","timestamp":1725493119562},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440499"},{"type":"electronic","value":"9783540457060"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45706-2_53","type":"book-chapter","created":{"date-parts":[[2007,10,7]],"date-time":"2007-10-07T05:37:18Z","timestamp":1191735438000},"page":"400-404","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parallel Algorithms for Fast Fourier Transformation Using PowerList, ParList and PList Theories"],"prefix":"10.1007","author":[{"given":"Virginia","family":"Niculescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,20]]},"reference":[{"key":"53_CR1","unstructured":"Kornerup, J.: Data Structures for Parallel Recursion. PhD thesis, University of Texas at Austin (1997)"},{"key":"53_CR2","unstructured":"Kornerup, J.: PLists: Taking PowerLists Beyond Base Two. In: Gorlatch, S. (ed.): First International Workshop on Constructive Methods for Parallel Programming, MIP-9805 (1998) 102\u2013116"},{"issue":"6","key":"53_CR3","doi-asserted-by":"publisher","first-page":"1737","DOI":"10.1145\/197320.197356","volume":"16","author":"J. Misra","year":"1994","unstructured":"Misra, J.: PowerList: A structure for parallel recursion. ACM Transactions on Programming Languages and Systems, Vol. 16 No. 6 (1994) 1737\u20131767","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"53_CR4","volume-title":"Algorithms and Complexity","author":"H.S. Wilf","year":"1985","unstructured":"Wilf, H.S.: Algorithms and Complexity. Mason & Prentice Hall (1985)"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2002 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45706-2_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:21:17Z","timestamp":1587342077000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45706-2_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440499","9783540457060"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-45706-2_53","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"20 August 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}