{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:50Z","timestamp":1725663290469},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540102915"},{"type":"electronic","value":"9783540384359"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/3-540-10291-4_7","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T12:10:33Z","timestamp":1330171833000},"page":"80-89","source":"Crossref","is-referenced-by-count":2,"title":["The power of a one-dimensional vector of processors"],"prefix":"10.1007","author":[{"given":"Jon Louis","family":"Bentley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Ottmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"key":"7_CR1","unstructured":"Bentley, J. L. [1980]. \"A parallel algorithm for constructing minimum spanning trees,\" to appear in the Journal of Algorithms."},{"issue":"4","key":"7_CR2","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1137\/0205051","volume":"5","author":"D. Cheriton","year":"1976","unstructured":"Cheriton, D. and R. E. Tarjan [1976]. \"Finding minimum spanning trees,\" SIAM J. Computing 5, 4, December 1976, pp. 724\u2013742.","journal-title":"SIAM J. Computing"},{"key":"7_CR3","unstructured":"Goodman, S. E. and S. T. Hedetniemi [1977]. Introduction to the Design and Analysis of Algorithms, McGraw-Hill."},{"key":"7_CR4","unstructured":"Horowitz, E. [1979]. \"VLSI architecture for matrix computations,\" Proceedings of the 1979 International Conference on Parallel Processing, pp. 124\u2013127, August 1979, IEEE."},{"key":"7_CR5","unstructured":"Kung, H. T. [1979a]. \"The structure of parallel algorithms,\" to appear in Advances in Computers."},{"key":"7_CR6","unstructured":"Kung, H. T. [1979b]. \"Let's design algorithms for VLSI systems\", Caltech Conference on VLSI: Architecture, Design and Fabrication, January 1979."},{"key":"7_CR7","unstructured":"Kung, H. T. and C. E. Leiserson [1980], \"Systolic arrays (for VLSI),\" in Mead and Conway [1980], Section 8.3."},{"key":"7_CR8","volume-title":"Introduction to VLSI Systems","author":"C. A. Mead","year":"1980","unstructured":"Mead, C. A. and L. A. Conway [1980]. Introduction to VLSI Systems, Addison-Wesley, Reading Mass."},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Preparata, F. P. and J. Vuillemin [1979]. \"Cube-connected-cycles: A versatile network for parallel computation,\" Twentieth Symposium on the Foundations of Computer Science, IEEE, October 1979, pp. 140\u2013147.","DOI":"10.1109\/SFCS.1979.43"},{"key":"7_CR10","unstructured":"Savage, C. D. [1977]. \"Parallel algorithms for graph theoretic problems,\" University of Illinois Coordinated Science Laboratory Report UILU-ENG-77-2231."},{"key":"7_CR11","unstructured":"Sollin [1977]. An algorithm attributed to Sollin in Goodman and Hedetniemi [1977], Section 5.5. (Also referred to in Yao [1977].)"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Thompson, C. D. [1979]. \"Area-time complexity for VLSI,\" Eleventh ACM Symposium on the Theory of Computing, ACM, May 1979.","DOI":"10.1145\/800135.804401"},{"key":"7_CR13","unstructured":"Yao, A. C. [1977]. \"On constructing minimum spanning trees in k-dimensional space and related problems,\" Stanford Computer Science Department Report STAN-CS-77-642 (December 1977)."}],"container-title":["Lecture Notes in Computer Science","Graphtheoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10291-4_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T16:36:58Z","timestamp":1619541418000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10291-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540102915","9783540384359"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-10291-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]}}}