{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T20:18:29Z","timestamp":1649189909494},"reference-count":3,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1993,7,1]],"date-time":"1993-07-01T00:00:00Z","timestamp":741484800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. of Compt. Sci. & Technol."],"published-print":{"date-parts":[[1993,7]]},"DOI":"10.1007\/bf02939529","type":"journal-article","created":{"date-parts":[[2008,9,3]],"date-time":"2008-09-03T00:56:52Z","timestamp":1220403412000},"page":"221-232","source":"Crossref","is-referenced-by-count":0,"title":["A methodology for mapping and partitioning arbitraryn-dimensional nested loops into 2-dimensional VLSI arrays"],"prefix":"10.1007","volume":"8","author":[{"given":"Hong","family":"Liu","sequence":"first","affiliation":[]},{"given":"Wenhong","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Defu","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"BF02939529_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TC.1986.1676652","volume":"35","author":"D. I. Moldovan","year":"1986","unstructured":"D. I. Moldovan and J. A. B. Fortes, Partitioning and mapping algorithms into fixed size systolic arrays.IEEE Trans. Comput., 1986, C-35 (1), 1\u201312.","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"BF02939529_CR2","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1109\/PROC.1983.12532","volume":"71","author":"D. I. Moldovan","year":"1983","unstructured":"D. I. Moldovan, On the design of algorithms for VLSI systolic arrays.Proc. IEEE, 1983, 71(1), 113\u2013120.","journal-title":"Proc. IEEE"},{"key":"BF02939529_CR3","unstructured":"Yiwan Wong and Jean-Mare Delosme, Optimal Systolic Implementations ofN-dimensional Recurrences. IEEE ICCD'85 pp. 618\u2013621."}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02939529.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02939529\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02939529","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T18:59:12Z","timestamp":1558551552000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02939529"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":3,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["BF02939529"],"URL":"https:\/\/doi.org\/10.1007\/bf02939529","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}