{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:12Z","timestamp":1725663612728},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540565031"},{"type":"electronic","value":"9783540475743"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56503-5_18","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:13:42Z","timestamp":1330254822000},"page":"153-162","source":"Crossref","is-referenced-by-count":1,"title":["Divide-and-conquer algorithms on the hypercube"],"prefix":"10.1007","author":[{"given":"Ernst W.","family":"Mayr","sequence":"first","affiliation":[]},{"given":"Ralph","family":"Werchner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"18_CR1","unstructured":"M.Y. Chan and S.-J. Lee. Subcube recognition, allocation\/deallocation and relocation in hypercubes. Proceedings of the 2nd IEEE Symposium on Parallel and Distributed Processing, 87\u201393, 1990."},{"key":"18_CR2","doi-asserted-by":"crossref","first-page":"1396","DOI":"10.1109\/TC.1987.5009493","volume":"C-36","author":"M.-S. Chen","year":"1987","unstructured":"M.-S. Chen and K.G. Shin. Processor allocation in an N-cube multiprocessor using Gray codes. IEEE Transactions on Computers, C-36:1396\u20131407, 1987.","journal-title":"IEEE Transactions on Computers"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"S. Fortune and J. Wyllie. Parallelism in random access machines. Proceedings of the 10th ACM Symposium on Theory of Computing, 114\u2013118, 1978.","DOI":"10.1145\/800133.804339"},{"key":"18_CR4","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1109\/12.16507","volume":"C-38","author":"A. Gelder van","year":"1989","unstructured":"A. van Gelder. PRAM processor allocation: A hidden bottleneck in sublogarithmic algorithms IEEE Transactions on Computers, C-38:289\u2013292, 1989.","journal-title":"IEEE Transactions on Computers"},{"key":"18_CR5","first-page":"231","volume":"2","author":"J. Kim","year":"1989","unstructured":"J. Kim and C.R. Das and W. Lin. A processor allocation scheme for hypercube computers. Proceedings of the 1989 International Conference on Parallel Processing. Vol. 2 Software, 231\u2013238, 1989.","journal-title":"Proceedings of the 1989 International Conference on Parallel Processing"},{"key":"18_CR6","unstructured":"F.T. Leighton. Introduction to Parallel Algorithms and Architectures. Morgan Kaufmann Publishers, 1992."},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"E.W. Mayr and R. Werchner. Optimal routing of parentheses on the hypercube. Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 109\u2013117, 1992.","DOI":"10.1145\/140901.140913"},{"key":"18_CR8","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1109\/TC.1981.6312172","volume":"C-30","author":"D. Nassimi","year":"1981","unstructured":"D. Nassimi and S. Sahni. Data broadcasting in SIMD computers. IEEE Transactions on Computers, C-30:101\u2013107, 1981.","journal-title":"IEEE Transactions on Computers"},{"key":"18_CR9","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1109\/TC.1982.1675960","volume":"C-31","author":"D. Nassimi","year":"1982","unstructured":"D. Nassimi and S. Sahni. A self-routing Benes network and parallel permutation algorithms. IEEE Transactions on Computers, C-31:148\u2013154, 1982.","journal-title":"IEEE Transactions on Computers"},{"key":"18_CR10","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1145\/322326.322329","volume":"29","author":"D. Nassimi","year":"1982","unstructured":"D. Nassimi and S. Sahni. Parallel permutation and sorting algorithms and a new generalized connection network. JACM, 29:642\u2013667, 1982.","journal-title":"JACM"},{"key":"18_CR11","unstructured":"C.G. Plaxton and E.W. Mayr. Pipelined parallel prefix computations and sorting on a pipelined hypercube. Technical Report STAN-CS-89-1269, Stanford University, 1989. To appear in J. Parallel Distrib. Comput."},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"E.J. Schwabe. On the computational equivalence of hypercube-derived networks. Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, 388\u2013397, 1990.","DOI":"10.1145\/97444.97706"},{"key":"18_CR13","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1145\/357114.357116","volume":"2","author":"J. T. Schwartz","year":"1980","unstructured":"J.T. Schwartz. Ultracomputers. ACM Transactions on Programming Languages and Systems, 2:484\u2013521, 1980.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"18_CR14","unstructured":"X. Zhong, S. Rajopadhye and V.M. Lo. Parallel implementations of divide-and-conquer algorithms on binary de Bruijn networks. Technical Report CIS-TR-91-21 University of Oregon, 1991."}],"container-title":["Lecture Notes in Computer Science","STACS 93"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56503-5_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:53:08Z","timestamp":1619571188000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56503-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540565031","9783540475743"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-56503-5_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}