{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:53Z","timestamp":1725663713662},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540552109"},{"type":"electronic","value":"9783540467755"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55210-3_176","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T09:55:11Z","timestamp":1330250111000},"page":"95-108","source":"Crossref","is-referenced-by-count":2,"title":["On the performance of networks with multiple busses"],"prefix":"10.1007","author":[{"given":"Friedhelm","family":"Meyer auf der Heide","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hieu Thien","family":"Pham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/TC.1986.1676658","volume":"C-35","author":"A. Aggarwal","year":"1986","unstructured":"A. Aggarwal. Optimal bounds for finding maximum on array of processors with k global buses. IEEE Trans. on Comp., C-35:62\u201364, Jan. 1986.","journal-title":"IEEE Trans. on Comp."},{"key":"8_CR2","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1109\/TC.1984.1676405","volume":"C-33","author":"S. H. Bokhari","year":"1984","unstructured":"S. H. Bokhari. Finding maximum on an array processor with a global bus. IEEE Trans. on Comp., C-33:133\u2013139, Feb. 1984.","journal-title":"IEEE Trans. on Comp."},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"A. Bar-Noy and D. Peleg. Square meshes are not always optimal. In ACM Symp. on Parallel Algorithms and Architectures, pages 138\u2013147, 1989.","DOI":"10.1145\/72935.72951"},{"issue":"1","key":"8_CR4","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1137\/0215006","volume":"15","author":"S. Cook","year":"1986","unstructured":"S. Cook, C. Dwork, and R. Reischuk. Upper and lower bounds for parallel random access machines without simultaneous writes. SIAM Journal on Comp., 15(1):87\u201397, 1986.","journal-title":"SIAM Journal on Comp."},{"key":"8_CR5","unstructured":"F. Fich, F. Meyer auf der Heide, and A. Wigderson. Lower bounds for parallel random access machines with unbounded shared memory. In F. P. Preparata, editor, Advances in Computing Research, volume 4 of Parallel and Distributed Computing, 1987."},{"key":"8_CR6","volume-title":"Graph Algorithms and NP-Completeness, volume 2 of Data Structures and Algorithms. EATCS Monographs on Theoretical Computer Science","author":"K. Mehlhorn","year":"1984","unstructured":"K. Mehlhorn. Graph Algorithms and NP-Completeness, volume 2 of Data Structures and Algorithms. EATCS Monographs on Theoretical Computer Science. Springer Berlin, 1984."},{"issue":"1","key":"8_CR7","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1137\/0216008","volume":"16","author":"F. Meyer auf der Heide","year":"1987","unstructured":"F. Meyer auf der Heide and A. Wigderson. The complexity of parallel sorting. SIAM Journal on Comp., 16(1):100\u2013107, 1987.","journal-title":"SIAM Journal on Comp."},{"key":"8_CR8","unstructured":"H. T. Pham. Fundamental algorithms for networks with busses (in German). Diploma Thesis, Universit\u00e4t Dortmund, Dec. 1990."},{"key":"8_CR9","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1109\/12.16500","volume":"38","author":"I. D. Scherson","year":"1989","unstructured":"I. D. Scherson and S. Sen. Parallel sorting in two-dimensional VLSI models of computation. IEEE Trans. on Comp., 38:238\u2013249, Feb. 1989.","journal-title":"IEEE Trans. on Comp."},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Q. F. Stout. Meshes with multiple buses. In 27th IEEE Symp. on Foundations of Comp. Science, pages 264\u2013273, 1986.","DOI":"10.1109\/SFCS.1986.32"},{"key":"8_CR11","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0196-6774(81)90010-9","volume":"2","author":"Y. Shiloach","year":"1981","unstructured":"Y. Shiloach and U. Vishkin. Finding the maximum, merging, and sorting in a parallel computation model. Journal of Algorithms, 2:88\u2013102, 1981.","journal-title":"Journal of Algorithms"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"I. Wegener. The Complexity of Boolean Functions. Series in Computer Sience. Wiley-Teubner, 1987.","DOI":"10.1007\/3-540-18170-9_185"}],"container-title":["Lecture Notes in Computer Science","STACS 92"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55210-3_176.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:58:07Z","timestamp":1605646687000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55210-3_176"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540552109","9783540467755"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-55210-3_176","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}