{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:24:58Z","timestamp":1725488698243},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540442967"},{"type":"electronic","value":"9783540458258"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45825-5_37","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T15:05:39Z","timestamp":1186844739000},"page":"217-225","source":"Crossref","is-referenced-by-count":2,"title":["Observations on Parallel Computation of Transitive and Max-Closure Problems"],"prefix":"10.1007","author":[{"given":"Aris","family":"Pagourtzis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Potapov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Rytter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,18]]},"reference":[{"key":"37_CR1","unstructured":"A. Aho, J. Hopcroft, J. Ullman, The design and analysis of computer algorithms, Addison-Wesley (1974)."},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"K. Chan, A. Gibbons, M. Pias, W. Rytter, On the PVM Computations of Transitive Closure and Algebraic Path Problems, in Proc. EuroPVM\/MPI\u201998, 1998.","DOI":"10.1007\/BFb0056593"},{"key":"37_CR3","unstructured":"E. Fink, A Survey of Sequential and Systolic Algorithms for the Algebraic Path Problem, Technical Report CS-92-37, Dept. of CS, University of Waterloo, 1992."},{"key":"37_CR4","unstructured":"L.Guibas, H.-T.Kung, C. Thompson, Direct VLSI implementation of combinatorial algorithms, Caltech Conf. on VLSI (1979)."},{"key":"37_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, 1992.","DOI":"10.1145\/125826.125898"},{"issue":"5","key":"37_CR6","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1109\/TC.1987.1676945","volume":"C-36","author":"S.-Y. 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":"37_CR7","unstructured":"Hans-Werner Lang, Transitive Closure on the Instrucion Systolic Array, 295\u2013304, Proc. Int. Conf. on Systolic Arrays, San Diego, 1991."},{"key":"37_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":"37_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":"37_CR10","doi-asserted-by":"publisher","first-page":"552","DOI":"10.2307\/2311149","volume":"68","author":"M. Yoeli","year":"1961","unstructured":"M. Yoeli, A note on a generalization of Boolean matrix theory, American Mathematical Monthly, 68 (1961), 552\u2013557.","journal-title":"American Mathematical Monthly"}],"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\/3-540-45825-5_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T23:31:08Z","timestamp":1556753468000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45825-5_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540442967","9783540458258"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-45825-5_37","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}