{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T15:21:37Z","timestamp":1761578497423,"version":"build-2065373602"},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4184,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Mathematics Letters"],"published-print":{"date-parts":[[2002,2]]},"DOI":"10.1016\/s0893-9659(01)00107-0","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T08:14:51Z","timestamp":1034064891000},"page":"137-140","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":51,"title":["The complexity of multiple wordlength assignment"],"prefix":"10.1016","volume":"15","author":[{"given":"G.A.","family":"Constantinides","sequence":"first","affiliation":[]},{"given":"G.J.","family":"Woeginger","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0893-9659(01)00107-0_BIB1","article-title":"Bitwidth analysis with application to silicon compilation","author":"Stephenson","year":"2000","journal-title":"Proceedings of SIGPLAN Programming Language Design and Implementation"},{"key":"10.1016\/S0893-9659(01)00107-0_BIB2","unstructured":"G.A. Constantinides, P.Y.K. Cheung and W. Luk, The multiple wordlength paradigm, Proc. IEEE Symposium on Field-Programmable Custom Computing Machines, Rohnert Park, CA (to appear)."},{"key":"10.1016\/S0893-9659(01)00107-0_BIB3","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1109\/TCT.1971.1083365","article-title":"Effect of finite word length on the accuracy of digital filters\u2014A review","volume":"18","author":"Liu","year":"1971","journal-title":"IEEE Transactions on Circuit Theory"},{"key":"10.1016\/S0893-9659(01)00107-0_BIB4","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/j.1538-7305.1970.tb01763.x","article-title":"On the interaction of roundoff noise and dynamic range in digital filters","volume":"49","author":"Jackson","year":"1970","journal-title":"Bell System Technical Journal"},{"year":"1994","author":"DeMicheli","key":"10.1016\/S0893-9659(01)00107-0_BIB5"},{"year":"1979","author":"Garey","key":"10.1016\/S0893-9659(01)00107-0_BIB6"}],"container-title":["Applied Mathematics Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893965901001070?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893965901001070?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T02:59:57Z","timestamp":1760237997000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0893965901001070"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["S0893965901001070"],"URL":"https:\/\/doi.org\/10.1016\/s0893-9659(01)00107-0","relation":{},"ISSN":["0893-9659"],"issn-type":[{"type":"print","value":"0893-9659"}],"subject":[],"published":{"date-parts":[[2002,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The complexity of multiple wordlength assignment","name":"articletitle","label":"Article Title"},{"value":"Applied Mathematics Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0893-9659(01)00107-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}]}}