{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T22:38:10Z","timestamp":1776465490036,"version":"3.51.2"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1-6","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1991,6]]},"DOI":"10.1007\/bf01759032","type":"journal-article","created":{"date-parts":[[2005,6,16]],"date-time":"2005-06-16T10:43:56Z","timestamp":1118918636000},"page":"5-35","source":"Crossref","is-referenced-by-count":718,"title":["Retiming synchronous circuitry"],"prefix":"10.1007","volume":"6","author":[{"given":"Charles E.","family":"Leiserson","sequence":"first","affiliation":[]},{"given":"James B.","family":"Saxe","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"No. 2","key":"BF01759032_CR1","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J. Edmonds","year":"1972","unstructured":"J. Edmonds and R. M. Karp, Theoretical improvements in algorithmic efficiency for network flow problems,Journal of the Association for Computing Machinery, Vol. 19, No. 2, 1972, pp. 248\u2013264.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"BF01759032_CR2","doi-asserted-by":"crossref","unstructured":"M. L. Fredman and R. E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms,Proceedings of the 25th Annual Symposium on Foundations of Computer Science, IEEE Computer Society, October 1984, pp. 338\u2013346.","DOI":"10.1109\/SFCS.1984.715934"},{"key":"BF01759032_CR3","doi-asserted-by":"crossref","unstructured":"Z. Galil and \u00c9. Tardos, AnO(n 2(m +n logn) logn) min-cost flow algorithm,Proceedings of the 27th Annual Symposium on Foundations of Computer Science, IEEE Computer Society, October 1986, pp. 1\u20139.","DOI":"10.1109\/SFCS.1986.7"},{"key":"BF01759032_CR4","volume-title":"Computers and Intractability","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson,Computers and Intractability, Freeman, San Francisco, 1979."},{"key":"BF01759032_CR5","unstructured":"A. V. Goldberg, Efficient Parallel Algorithms for Sequential and Parallel Computers, Ph.D. dissertion, Department of Electrical Engineering and Computer Science, MIT, February 1987."},{"key":"BF01759032_CR6","unstructured":"A. V. Goldberg and R. E. Tarjan, Finding Minimum-Cost Circulations by Successive Approximation, Technical Memorandum MIT\/LCS\/TM-33, MIT Laboratory for Computer Science, July 1987."},{"issue":"No. 1","key":"BF01759032_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/321992.321993","volume":"24","author":"D. B. Johnson","year":"1977","unstructured":"D. B. Johnson, Efficient algorithms for shortest paths in sparse networks,Journal of the Association for Computing Machinery, Vol. 24, No. 1, January 1977, pp. 1\u201313.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"BF01759032_CR8","first-page":"55","volume-title":"Let's design algorithms for VLSI systems","author":"H. T. Kung","year":"1979","unstructured":"H. T. Kung, Let's design algorithms for VLSI systems,Proceedings of the Caltech Conference on Very Large Scale Integration, C. L. Seitz, ed., Pasadena, California, January 1979, pp. 55\u201390."},{"key":"BF01759032_CR9","unstructured":"H. T. Kung and C. E. Leiserson, Systolic arrays (for VLSI),Sparse Matrix Proceedings 1978, I. S. Duff and G. W. Stewart, ed., Society for Industrial and Applied Mathematics, 1979, pp. 256\u2013282. (An earlier version appears in Chapter 8 of [16] under the title, \u201cAlgorithms for VLSI processor arrays.\u201d)"},{"key":"BF01759032_CR10","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E. L. Lawler","year":"1976","unstructured":"E. L. Lawler,Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York, 1976."},{"key":"BF01759032_CR11","volume-title":"Ph.D. dissertation","author":"C. E. Leiserson","year":"1983","unstructured":"C. E. Leiserson, Area-Efficient VLSI Computation, Ph.D. dissertation, Department of Computer Science, Carnegie-Mellon University, October 1981. Published in book form by the MIT Press, Cambridge, Massachcusetts, 1983."},{"key":"BF01759032_CR12","first-page":"627","volume-title":"Systolic and semisystolic design","author":"C. E. Leiserson","year":"1983","unstructured":"C. E. Leiserson, Systolic and semisystolic design,Proceedings of the IEEE International Conference on Computer Design\/VLSI in Computers (ICCD '83), Rye, New York, October 1983, pp. 627\u2013632."},{"key":"BF01759032_CR13","first-page":"87","volume-title":"California Institute of Technology","author":"C. E. Leiserson","year":"1983","unstructured":"C. E. Leiserson, Flavio M. Rose, and James B. Saxe, Optimizing synchronous circuitry by retiming,\u201dProceedings of the 3rd Caltech Conference on Very Large Scale Integration, Randal Bryant, ed., California Institute of Technology, 1983, pp. 87\u2013116. Computer Science Press, Rockville, Maryland."},{"issue":"No. 1","key":"BF01759032_CR14","first-page":"41","volume":"1","author":"C. E. Leiserson","year":"1983","unstructured":"C. E. Leiserson and J. B. Saxe, Optimizing synchronous systems,Journal of VLSI and Computer Systems, Vol. 1, No. 1, Spring 1983, pp. 41\u201367.","journal-title":"Journal of VLSI and Computer Systems"},{"key":"BF01759032_CR15","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/0196-6774(88)90008-9","volume":"9","author":"C. E. Leiserson","year":"1988","unstructured":"C. E. Leiserson and James B. Saxe, A mixed-integer programming problem which is efficiently solvable,Journal of Algorithms, Vol. 9, 1988, pp. 114\u2013128. (An earlier version appears inProceedings of the 21st Annual Allerton Conference on Communication, Control, and Computing, October 1983, pp. 204\u2013213).","journal-title":"Journal of Algorithms"},{"key":"BF01759032_CR16","volume-title":"Introduction to VLSI Systems","author":"C. A. Mead","year":"1980","unstructured":"C. A. Mead and L. A. Conway,Introduction to VLSI Systems, Addison-Wesley, Reading, Massachusetts, 1980."},{"key":"BF01759032_CR17","doi-asserted-by":"crossref","unstructured":"P. Ng, W. Glauert, and R. Kirk, A timing verification system based on extracted MOS\/VLSI circuit parameters,18th Design Automation Conference Proceedings, IEEE, 1981, pp. 288\u2013292.","DOI":"10.1109\/DAC.1981.1585365"},{"key":"BF01759032_CR18","doi-asserted-by":"crossref","unstructured":"J. B. Orlin, A faster strongly polynomial minimum cost flow algorithm,Proceedings of the 20th Annual ACM Symposium on Theory of Computing, ACM, May 1988, pp. 377\u2013387.","DOI":"10.21236\/ADA457044"},{"key":"BF01759032_CR19","unstructured":"F. M. Rose, Models for VLSI Circuits, Masters thesis, Department of Electrical Engineering and Computer Science, MIT, March 1982. Also available as MIT VLSI Memo No. 82\u2013114."},{"key":"BF01759032_CR20","unstructured":"J. B. Saxe, Decomposable Searching Problems and Circuit Optimization by Retiming: Two Studies in General Transformations of Computational Structures, Ph.D. dissertation, Department of Computer Science, Carnegie-Mellon University, August 1985."},{"key":"BF01759032_CR21","unstructured":"Texas Instruments Incorporated,The TTL Data Book for Design Engineers, Dallas, Texas, 1976."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01759032.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01759032\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01759032","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T19:27:20Z","timestamp":1586287640000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01759032"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":21,"journal-issue":{"issue":"1-6","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["BF01759032"],"URL":"https:\/\/doi.org\/10.1007\/bf01759032","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}