{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:38:32Z","timestamp":1757543912361},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1987,9,1]],"date-time":"1987-09-01T00:00:00Z","timestamp":557452800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1987,9]]},"DOI":"10.1007\/bf02309554","type":"journal-article","created":{"date-parts":[[2006,2,14]],"date-time":"2006-02-14T22:45:04Z","timestamp":1139957104000},"page":"187-199","source":"Crossref","is-referenced-by-count":19,"title":["An orthogonal systolic array for the algebraic path problem"],"prefix":"10.1007","volume":"39","author":[{"given":"Y.","family":"Robert","sequence":"first","affiliation":[]},{"given":"D.","family":"Trystram","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02309554_CR1","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1109\/MC.1982.1653828","volume":"15\/1","author":"H. M. Ahmed","year":"1982","unstructured":"Ahmed, H. M., Delosme, J. M., Morf, M.: Highly concurrent computing structures for matrix arithmetic and signal processing. Computer15\/1, 65\u201382 (1982).","journal-title":"Computer"},{"key":"BF02309554_CR2","unstructured":"Delosme, J. M.: Algorithms for finite shift-rank processes. Ph.D. Thesis, Technical Report M735-22, Sept. 1982, Stanford Electronics Laboratories."},{"key":"BF02309554_CR3","series-title":"Proc. Caltech Conf. on VLSI: Architecture, design, fabrication","first-page":"509","volume-title":"Direct VLSI implementation of combinatorial algorithms","author":"L. J. Guibas","year":"1979","unstructured":"Guibas, L. J., Kung, H. T., Thompson, C. D.: Direct VLSI implementation of combinatorial algorithms, pp. 509\u2013525. Proc. Caltech Conf. on VLSI: Architecture, design, fabrication, Calfornia Institute of technology, Pasadena (1979)."},{"key":"BF02309554_CR4","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1109\/MC.1982.1653825","volume":"15\/1","author":"H. T. Kung","year":"1982","unstructured":"Kung, H. T.: Why systolic architectures. Computer15\/1, 37\u201346 (1982).","journal-title":"Computer"},{"key":"BF02309554_CR5","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/0743-7315(84)90010-8","volume":"1\/1","author":"H. T. Kung","year":"1984","unstructured":"Kung, H. T., Lam, M. S.: Fault-tolerance and two-level pipelining in VLSI systolic arrays. Journal of Parallel and Distributed Computing1\/1, 32\u201363 (1984).","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"BF02309554_CR6","unstructured":"Kung, H. T., Leiserson, C. E.: Systolic Arrays (for VLSI). In: Proc. of the Symposium on Sparse Matrices Computations, pp. 256\u2013282 (Duff, I. S., Stewart, G. W., eds.). Knoxville, Tenn. (1978)."},{"key":"BF02309554_CR7","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1080\/00207168508803470","volume":"17","author":"Y. Robert","year":"1985","unstructured":"Robert, Y.: Block LU decomposition of a band matrix on a systolic array. Int. J. Computer Math.17, 295\u2013315 (1985).","journal-title":"Int. J. Computer Math."},{"key":"BF02309554_CR8","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF02253318","volume":"34","author":"G. Rote","year":"1985","unstructured":"Rote, G.: A systolic array algorithm for the algebraic path problem (shortest paths; matrix inversion). Computing34, 191\u2013219 (1985).","journal-title":"Computing"},{"key":"BF02309554_CR9","unstructured":"Rote, G.: A systolic array for the algebraic path problem (which includes the inverse of a matrix and the shortest distances in a graph). Rechenzentrum Graz, Austria, Bericht RZG-101 (1984)."},{"key":"BF02309554_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-5060(08)70423-0","volume":"10","author":"U. Zimmermann","year":"1981","unstructured":"Zimmermann, U.: Linear and combinatorial optimization in ordered algebraic structures. Ann. Discrete Math.10, 1\u2013380 (1981).","journal-title":"Ann. Discrete Math."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02309554.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02309554\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02309554","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T13:11:50Z","timestamp":1558012310000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02309554"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,9]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987,9]]}},"alternative-id":["BF02309554"],"URL":"https:\/\/doi.org\/10.1007\/bf02309554","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,9]]}}}