{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T12:05:41Z","timestamp":1759147541025,"version":"3.44.0"},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Integration"],"published-print":{"date-parts":[[1996,3]]},"DOI":"10.1016\/0167-9260(95)00021-6","type":"journal-article","created":{"date-parts":[[2004,5,26]],"date-time":"2004-05-26T13:39:26Z","timestamp":1085578766000},"page":"123-137","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":8,"title":["The Retiming Lemma: A simple proof and applications"],"prefix":"10.1016","volume":"20","author":[{"given":"Guy","family":"Even","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-9260(95)00021-6_BIB1","series-title":"Twenty-Second Annual Symp. on Foundations of Computer Science","first-page":"23","article-title":"Optimizing synchronous systems","author":"Leiserson","year":"1981"},{"key":"10.1016\/0167-9260(95)00021-6_BIB2","first-page":"41","volume":"1","author":"Leiserson","year":"1983","journal-title":"J. VLSI and Computer Systems"},{"key":"10.1016\/0167-9260(95)00021-6_BIB3","series-title":"Proc. 3rd Annual ACM Symp. on Parallel Algorithms and Architectures","first-page":"357","article-title":"On the capabilities of systolic systems","author":"Even","year":"1991"},{"key":"10.1016\/0167-9260(95)00021-6_BIB4","unstructured":"A. Litman, Private communication."},{"key":"10.1016\/0167-9260(95)00021-6_BIB5_1","series-title":"Proc. IEEE Internat. Conf. on Computer Design: VLSI in Computers","first-page":"549","article-title":"Formal verification of parameterized hardware designs","author":"German","year":"1985"},{"key":"10.1016\/0167-9260(95)00021-6_BIB5_2","first-page":"85","article-title":"Formal Verification of Hardware Design","author":"Yoeli","year":"1990"},{"key":"10.1016\/0167-9260(95)00021-6_BIB6","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BF01383944","article-title":"Using fixed-point semantics to prove Retiming Lemmas","volume":"2","author":"Brookes","year":"1993","journal-title":"Formal Methods in System Design"},{"year":"1992","series-title":"An Introduction to Systolic Algorithm Design","author":"Megson","key":"10.1016\/0167-9260(95)00021-6_BIB7"},{"key":"10.1016\/0167-9260(95)00021-6_BIB8","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3999.001.0001","article-title":"Iterative Arrays of Logical Circuits","author":"Hennie","year":"1961"},{"issue":"1","key":"10.1016\/0167-9260(95)00021-6_BIB9","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1109\/TC.1986.1676653","article-title":"Testability conditions for bilateral arrays of combinational cells","volume":"C-35","author":"Vergis","year":"1986","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/0167-9260(95)00021-6_BIB10","series-title":"Proc. Sequences","article-title":"A systematic design and explanation of the Atrubin Multiplier","author":"Even","year":"1991"},{"year":"1992","series-title":"A real-time systolic integer multiplier","author":"Even","key":"10.1016\/0167-9260(95)00021-6_BIB11"},{"issue":"3","key":"10.1016\/0167-9260(95)00021-6_BIB12","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1109\/PGEC.1965.264145","article-title":"A one-dimensional real-time iterative multiplier","volume":"EC-14","author":"Atrubin","year":"1965","journal-title":"IEEE Trans. Electronic Computers"},{"year":"1993","series-title":"Retimings for a required clock cycle which facilitate the task of initialization","author":"Even","key":"10.1016\/0167-9260(95)00021-6_BIB13"}],"container-title":["Integration"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167926095000216?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167926095000216?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:36:34Z","timestamp":1757453794000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167926095000216"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["0167926095000216"],"URL":"https:\/\/doi.org\/10.1016\/0167-9260(95)00021-6","relation":{},"ISSN":["0167-9260"],"issn-type":[{"type":"print","value":"0167-9260"}],"subject":[],"published":{"date-parts":[[1996,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The Retiming Lemma: A simple proof and applications","name":"articletitle","label":"Article Title"},{"value":"Integration","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0167-9260(95)00021-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1996 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}