{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:56:32Z","timestamp":1759146992841,"version":"3.32.0"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1994,1]]},"DOI":"10.1007\/bf01187090","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T17:09:34Z","timestamp":1108746574000},"page":"3-28","source":"Crossref","is-referenced-by-count":7,"title":["On the capabilities of systolic systems"],"prefix":"10.1007","volume":"27","author":[{"given":"Shimon","family":"Even","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ami","family":"Litman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"No. 4","key":"CR1","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1109\/T-C.1969.222663","volume":"18","author":"S. N. Cole","year":"1969","unstructured":"Cole, S. N., Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines,IEEE Transactions on Computers, Vol. 18, No. 4, 1969, pp. 349?365.","journal-title":"IEEE Transactions on Computers"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1016\/S0022-0000(71)80013-2","volume":"5","author":"F. Commoner","year":"1971","unstructured":"Commoner, F., A. W. Holt, S. Even, and A. Pnueli, Marked Directed Graphs,Journal of Computer and System Sciences, Vol. 5, 1971, pp. 511?523.","journal-title":"Journal of Computer and System Sciences"},{"key":"CR3","first-page":"15","volume-title":"Graph Algorithms","author":"S. Even","year":"1979","unstructured":"Even, S.,Graph Algorithms, Computer Science Press, Rockville, MD, 1979, p. 15."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/978-1-4613-9323-8_14","volume-title":"Sequences II;Methods in Communication, Security, and Computer Science","author":"S. Even","year":"1993","unstructured":"Even, S., and A. Litman, A Systematic Design and Explanation of the Atrubin Multiplier, inSequences II;Methods in Communication, Security, and Computer Science, Renato Capocelliet al. (eds), Springer-Verlag, New York, 1993, pp. 189?202."},{"key":"CR5","unstructured":"Ford, L. R., Jr., Network Flow Theory, Report P-923, The Rand Corporation, August 1956."},{"key":"CR6","volume-title":"Flows in Networks","author":"L. R. Ford Jr.","year":"1962","unstructured":"Ford, L. R., Jr., and D. R. Fulkerson,Flows in Networks, Princeton University Press, Princeton, NJ, 1962, Chapter III, Section 5."},{"key":"CR7","first-page":"323","volume":"6","author":"M. J. Foster","year":"1982","unstructured":"Foster, M. J., and H. T. Kung, gnize Regular Languages with Programmable Building Blocks,Journal of Digital Systems, Vol. 6, 1982, pp. 323?332.","journal-title":"Journal of Digital Systems"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0012-365X(78)90011-0","volume":"23","author":"R. M. Karp","year":"1978","unstructured":"Karp, R. M., A Characterization of the Minimum Cycle Mean in a Digraph,Discrete Mathematics, Vol. 23, 1978, pp. 309?311.","journal-title":"Discrete Mathematics"},{"key":"CR9","first-page":"87","volume-title":"Optimizing Synchronous Circuitry by Retiming","author":"C. E. Leiserson","year":"1983","unstructured":"Leiserson, C. E., F. M. Rose, and J. B. Saxe, Optimizing Synchronous Circuitry by Retiming,Proceedings of the Third Caltech Conference on Very Large Scale Integration, ed. R. Bryant, Computer Science Press, Rockville, MD, 1983, pp. 87?116."},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"Leiserson, C. E., and J. B. Saxe, Optimizing Synchronous Systems,Proceedings of the Twenty-Second Annual Symposium on Foundations of Computer Science, IEEE, 1981, pp. 23?36. Also,Journal of VLSI and Computer Systems, Vol. 1, 1983, pp. 41?67.","DOI":"10.1109\/SFCS.1981.34"},{"issue":"No. 1","key":"CR11","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF01759032","volume":"6","author":"C. E. Leiserson","year":"1991","unstructured":"Leiserson, C. E., and J. B. Saxe, Retiming Synchronous Circuitry,Algorithmica, Vol. 6, No. 1, 1991, pp. 5?35.","journal-title":"Algorithmica"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"Papaefthymiou, M. C., Understanding Retiming Through Maximum Average-Weight Cycles,Proceeding of the Third ACM Symposium on Parallel Algorithms and Architectures, 1991, pp. 338?348.","DOI":"10.1145\/113379.113410"},{"issue":"No. 2","key":"CR13","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M. O. Rabin","year":"1959","unstructured":"Rabin, M. O., and D. Scott, Finite Automata and Their Decision Problems,IBM Journal of Research, Vol. 3, No. 2, 1959, pp. 115?125.","journal-title":"IBM Journal of Research"},{"volume-title":"Automata Studies","year":"1956","key":"CR14","unstructured":"Shannon, C. E., and J. McCarthy (eds.),Automata Studies, Princeton University Press, Princeton, NJ, 1956."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF00289248","volume":"8","author":"J. I. Sieferas","year":"1977","unstructured":"Sieferas, J. I., Iterative Arrays with Direct Central Control,Acta Informatica, Vol. 8, 1977, pp. 177?192.","journal-title":"Acta Informatica"},{"key":"CR16","unstructured":"Even, G., A New Proof of the Retiming Lemma and Applications (Preliminary Version), TR-762, Computer Science Department, Technion, January 1993."}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01187090.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01187090\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01187090","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T12:59:43Z","timestamp":1734958783000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01187090"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["BF01187090"],"URL":"https:\/\/doi.org\/10.1007\/bf01187090","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"type":"print","value":"0025-5661"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}