{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:04Z","timestamp":1725663604157},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540194446"},{"type":"electronic","value":"9783540392705"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-19444-4_15","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:11:22Z","timestamp":1330182682000},"page":"68-81","source":"Crossref","is-referenced-by-count":0,"title":["Systolic algorithms for path-finding problems"],"prefix":"10.1007","author":[{"given":"Yves","family":"Robert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1109\/MC.1982.1653828","volume":"15","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, Computer 15 (1982), 65\u201382","journal-title":"Computer"},{"issue":"6","key":"6_CR2","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1109\/PGEC.1965.264145","volume":"14","author":"A.J. Atrubin","year":"1965","unstructured":"ATRUBIN A.J., A one-dimensional real time iterative multiplier, IEEE Trans. Computers 14, 6 (1965), 394\u2013399","journal-title":"IEEE Trans. Computers"},{"key":"6_CR3","unstructured":"CODD E.F., Cellular Automata, Academic Press, 1968"},{"issue":"4","key":"6_CR4","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 Trans. Computers 18, 4 (1969), 349\u2013365","journal-title":"IEEE Trans. Computers"},{"key":"6_CR5","unstructured":"GUIBAS L.J., KUNG H.T., THOMPSON C.D., Direct VLSI implementation of combinatorial algorithms, Proc. Caltech Conference on VLSI, California Inst. of Technology, Pasadena (1979), 509\u2013525"},{"key":"6_CR6","first-page":"185","volume-title":"VLSI and Modern Signal Processing","author":"D. Heller","year":"1985","unstructured":"HELLER D., Partitioning big matrices for small systolic arrays, in VLSI and Modern Signal Processing, S. Y. Kung et al. eds, Prentice Hall, Englewood Cliffs, NJ (1985), 185\u2013199"},{"key":"6_CR7","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3999.001.0001","volume-title":"Iterative arrays of logical circuits","author":"Hennie","year":"1961","unstructured":"HENNIE, Iterative arrays of logical circuits, MIT Press, Cambridge MA, U.S.A. 1961"},{"key":"6_CR8","doi-asserted-by":"crossref","first-page":"1215","DOI":"10.1109\/TC.1982.1675945","volume":"31","author":"K. Hwang","year":"1982","unstructured":"HWANG K., CHENG Y.H., Partitioned matrix algorithm for VLSI arithmetic systems, IEEE Trans. Computers 31 (1982), 1215\u20131224","journal-title":"IEEE Trans. Computers"},{"key":"6_CR9","unstructured":"KRAMER M.R., VAN LEEUWEN J., Systolic computation and VLSI, Foundations of Computer Science IV, J.W. DeBakker et aJ. Van Leeeuwen eds (1983), 75\u2013103"},{"issue":"1","key":"6_CR10","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1109\/MC.1982.1653825","volume":"15","author":"H.T. Kung","year":"1982","unstructured":"KUNG H.T., Why systolic architectures, Computer 15, 1 (1982), 37\u201346","journal-title":"Computer"},{"key":"6_CR11","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/0743-7315(84)90010-8","volume":"1","author":"H.T Kung","year":"1984","unstructured":"KUNG H.T, LAM M.S. 1984 Fault-tolerance and two-level pipelining in VLSI systolic arrays, Journal of Parallel and Distributed Computing 1, 32\u201363","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"6_CR12","unstructured":"KUNG H.T, LEISERSON C.E., Systolic arrays (for VLSI), Proc. of the Symposium on Sparse Matrices Computations, I.S. Duff and G.W. Stewart eds, Knoxville (1978), 256\u2013282"},{"key":"6_CR13","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1109\/PROC.1984.12944","volume":"72","author":"S.Y. Kung","year":"1984","unstructured":"KUNG S.Y., On supercomputing with systolic\/wavefront array processors, Proceedings of the IEEE 72 (1984), 867\u2013884","journal-title":"Proceedings of the IEEE"},{"issue":"3","key":"6_CR14","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/MASSP.1985.1163741","volume":"2","author":"S.Y. Kung","year":"1985","unstructured":"KUNG S.Y., VLSI array processors, IEEE ASSP Magazine 2, 3 (1985), 4\u201322","journal-title":"IEEE ASSP Magazine"},{"key":"6_CR15","unstructured":"KUNG S.Y., LO S.C., A spirial systolic architecture\/algorithm for transitive closure problems, IEEE Int. Conf. on Computer Design ICCD'85, New-York, USA (1985), 622\u2013626"},{"key":"6_CR16","volume-title":"A survey of systolic systems for solving the Algebraic Path Problem, Report CS-85-22","author":"F. Moller","year":"1985","unstructured":"MOLLER F., A survey of systolic systems for solving the Algebraic Path Problem, Report CS-85-22 (1985), Univ. of Waterloo, Canada"},{"key":"6_CR17","series-title":"Technical Report","volume-title":"Systolic Algorithms","author":"C. Moraga","year":"1984","unstructured":"MORAGA C., Systolic Algorithms, Technical Report, Computer Science department (1984), University of Dortmund, F.R.G."},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"NASH J.G., HANSEN S., Modified Faddeev algorithm for matrix manipulation, Proc. 1984 SPIE Conf., San Diego, CA, USA, August 1984","DOI":"10.1117\/12.944007"},{"key":"6_CR19","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 (1985), 295\u2013315","journal-title":"Int. J. Computer Math"},{"key":"6_CR20","first-page":"315","volume":"19","author":"Y. Robert","year":"1985","unstructured":"ROBERT Y., TCHUENTE M., R\u00e9solution systolique de syst\u00e8mes lin\u00e9aires denses, RAIRO Mod\u00e9lisation et Analyse Num\u00e9rique 19 (1985), 315\u2013326","journal-title":"RAIRO Mod\u00e9lisation et Analyse Num\u00e9rique"},{"issue":"I","key":"6_CR21","first-page":"241","volume":"302","author":"Y. Robert","year":"1986","unstructured":"ROBERT Y., TRYSTRAM D., Un r\u00e9seau systolique orthogonal pour le probl\u00e8me du chemin alg\u00e9brique, C.R.A.S. Paris, 302 I (1986), 241\u2013244","journal-title":"C.R.A.S. Paris"},{"key":"6_CR22","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), Computing 34 (1985), 191\u2013219","journal-title":"Computing"},{"key":"6_CR23","volume-title":"Computational aspects of VLSI, Chapter 5: Systolic algorithms","author":"J.D. Ullman","year":"1984","unstructured":"ULLMAN J.D., Computational aspects of VLSI, Chapter 5: Systolic algorithms, Computer Science Press, Rockville, Maryland, USA, 1984"},{"key":"6_CR24","volume-title":"Theory of self-reproducing automata","author":"Neumann","year":"1966","unstructured":"VON NEUMANN, Theory of self-reproducing automata, University of Illinois Press, Urbana IL, U.S.A, 1966"},{"issue":"1","key":"6_CR25","first-page":"11","volume":"9","author":"S. Warshall","year":"1972","unstructured":"WARSHALL S., A theorem on boolean matrices, J.A.C.M. 9, 1 (1972), 11\u201312","journal-title":"J.A.C.M."},{"key":"6_CR26","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 (1981), 1\u2013380","journal-title":"Ann. Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Automata Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-19444-4_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:17:17Z","timestamp":1605626237000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-19444-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540194446","9783540392705"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-19444-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}