{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:51:37Z","timestamp":1725468697714},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540650416"},{"type":"electronic","value":"9783540497059"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0056593","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T18:00:48Z","timestamp":1155837648000},"page":"338-345","source":"Crossref","is-referenced-by-count":3,"title":["On the PVM computations of transitive closure and algebraic path problems"],"prefix":"10.1007","author":[{"given":"Ken","family":"Chan","sequence":"first","affiliation":[]},{"given":"Alan","family":"Gibbons","sequence":"additional","affiliation":[]},{"given":"Marcelo","family":"Pias","sequence":"additional","affiliation":[]},{"given":"Wojciech","family":"Rytter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,6,2]]},"reference":[{"key":"41_CR1","unstructured":"A.Aho, J.Hopcroft, J.Ullman, The design and analysis of computer algorithms, Addison-Wesley (1974)"},{"key":"41_CR2","doi-asserted-by":"crossref","unstructured":"V. Alexandrov, K. Chan, A. Gibbons, W. Rytter, On the PVM\/MPI computations of dynamic programming recurrences, EuroPVM-MPI'97, Lecture Notes in Comp. Science, Springer Verlag, 1997","DOI":"10.1007\/3-540-63697-8_98"},{"key":"41_CR3","unstructured":"A.Gibbons, W.Rytter, Efficient parallel algorithms, Cambridge University Press (1988)"},{"key":"41_CR4","unstructured":"L.Guibas, H.Thompson, C.Thompson, Direct VLSI implementation of combinatorial algorithms, Caltech Conf. on VLSI (1979)"},{"key":"41_CR5","doi-asserted-by":"crossref","unstructured":"H.T.Kung and Jaspal Subhlok, A new approach for automatic parallelization of blocked linear algebra computations, 122\u2013129, Supercomputing '91. Proceedings of the 1991 Conference on Supercomputing, 1992","DOI":"10.1145\/125826.125898"},{"issue":"5","key":"41_CR6","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1109\/TC.1987.1676945","volume":"C-36","author":"S. Kung","year":"1987","unstructured":"Sun-Yuan Kung, Sheng-Chun Lo, Paul.S.Lewis, Optimal Systolic Design for the Transitive Closure and the Shortest Path Problems, IEEE Transactions on Computers, C-36, 5, 603\u2013614, 1987","journal-title":"IEEE Transactions on Computers"},{"key":"41_CR7","unstructured":"Hans-Werner Lang, Transitive Closure on the Instruction Systolic Array, 295\u2013304, Proc. Int. Conf. on Systolic Arrays, San Diego"},{"key":"41_CR8","first-page":"191","volume":"26","author":"B. Maggs","year":"1987","unstructured":"B. Maggs, S. Plotkin, Minimum cost spanning trees as a path finding problem, IPL 26 (1987) 191\u2013293","journal-title":"IPL"},{"issue":"3","key":"41_CR9","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF02253318","volume":"34","author":"G. Rote","year":"1985","unstructured":"Gunter Rote, A systolic array algorithm for the algebraic path problem, Computing, 34, 3, 191\u2013219, 1985","journal-title":"Computing"},{"key":"41_CR10","doi-asserted-by":"crossref","unstructured":"S. Warshall, A Theorem on Boolean Matrices, J. Assoc. Comput. Mach. Vol 9 (1962)","DOI":"10.1145\/321105.321107"},{"issue":"7","key":"41_CR11","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1109\/TC.1980.1675627","volume":"C-29","author":"F.L. Van-Scoy","year":"1980","unstructured":"F.L. Van-Scoy, The parallel recognition of a class of graphs, IEEE trans. Comp. C-29, (7) (1980) 563\u2013570","journal-title":"IEEE trans. Comp."}],"container-title":["Lecture Notes in Computer Science","Recent Advances in Parallel Virtual Machine and Message Passing Interface"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0056593","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T18:45:01Z","timestamp":1555785901000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0056593"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540650416","9783540497059"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0056593","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}