{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:43:29Z","timestamp":1757544209271},"publisher-location":"Berlin\/Heidelberg","reference-count":11,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"0387968180"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0040399","type":"book-chapter","created":{"date-parts":[[2006,8,3]],"date-time":"2006-08-03T00:03:50Z","timestamp":1154563430000},"page":"319-328","source":"Crossref","is-referenced-by-count":20,"title":["Converting affine recurrence equations to quasi-uniform recurrence equations"],"prefix":"10.1007","author":[{"given":"Yoav","family":"Yaacoby","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter R.","family":"Cappello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"P. R. Cappello and K. Steiglitz. Unifying VLSI array design with linear transformations of space-time. In F. P. Preparate, editor, Advances in Computing Research, vol. 2, VLSI Theory, pages 23\u201365, JAI Press, Inc., 1984.","DOI":"10.1117\/12.944011"},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0020-0190(83)90055-8","volume":"17","author":"C. Choffrut","year":"1983","unstructured":"C. Choffrut and K. Culik II. Folding of the plane and the design of systolic arrays. Information Processing Letters, 17:149\u2013153, 1983.","journal-title":"Information Processing Letters"},{"key":"32_CR3","unstructured":"J.-M. Delosme and I. C. F. Ipsen. An illustration of a methodology for the construction of efficient systolic architectures in VLSI. In Proc. 2nd Int. Symp. on VLSI Technology, Systems and Applications, pages 268\u2013273, Taipei, 1985."},{"key":"32_CR4","unstructured":"J-M Delosme and I. C. F. Ipsen. Systolic Array Synthesis: Computability and Time Cones. Technical Report Yale\/DCS\/RR-474, Yale, May 1986."},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0743-7315(85)90029-2","volume":"2","author":"J. A. B. Fortes","year":"1985","unstructured":"J. A. B. Fortes and D. I. Moldovan. Parallelism detection and algorithm transformation techniques useful for VLSI architecture design. J. Parallel Distrib. Comput, 2:277\u2013301, Aug. 1985.","journal-title":"J. Parallel Distrib. Comput"},{"key":"32_CR6","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1145\/321406.321418","volume":"14","author":"R. M. Karp","year":"1967","unstructured":"R. M. Karp, R. E. Miller, and S. Winograd. The organization of computations for uniform recurrence equations. J. ACM, 14:563\u2013590, 1967.","journal-title":"J. ACM"},{"issue":"1","key":"32_CR7","doi-asserted-by":"publisher","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, 71(1):113\u2013120, Jan. 1983.","journal-title":"Proc. IEEE"},{"key":"32_CR8","volume-title":"Applied Mathematics Series-60","author":"M. Newman","year":"1968","unstructured":"M. Newman. Matrix representation of groups. In Applied Mathematics Series-60, Institute for Basic Standards, National Bureau of Standards, Washington D.C. 20234, July 1968."},{"key":"32_CR9","unstructured":"S. K. Rao. Regular Iterative Algorithms and Their Implementation on Processor Arrays. PhD thesis, Stanford University, October 1985."},{"key":"32_CR10","series-title":"Technical Report","volume-title":"Converting Affine Recurrence Equations to Quasi-Uniform Recurrence Equations","author":"Y. Yaacoby","year":"1988","unstructured":"Y. Yaacoby and P. R. Cappello. Converting Affine Recurrence Equations to Quasi-Uniform Recurrence Equations. Technical Report 18, Dept. Computer Science, UCSB, Santa Barbara, CA 93106, Feb. 1988."},{"key":"32_CR11","series-title":"Technical Report","volume-title":"Computing a Fundamental Region for a Finite Matrix Group Acting on a Euclidean Space","author":"Y. Yaacoby","year":"1988","unstructured":"Y. Yaacoby, P. R. Cappello, D. Witt, and K. C. Millett. Computing a Fundamental Region for a Finite Matrix Group Acting on a Euclidean Space. Technical Report 4, Dept. Computer Science, UCSB, Santa Barbara, CA 93106, Feb. 1988."}],"container-title":["Lecture Notes in Computer Science","VLSI Algorithms and Architectures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0040399","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,5]],"date-time":"2019-11-05T05:37:57Z","timestamp":1572932277000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0040399"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["0387968180"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0040399","relation":{},"subject":[]}}