{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T11:13:48Z","timestamp":1648725228459},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1-6","license":[{"start":{"date-parts":[[1992,6,1]],"date-time":"1992-06-01T00:00:00Z","timestamp":707356800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1992,6]]},"DOI":"10.1007\/bf01758752","type":"journal-article","created":{"date-parts":[[2005,6,15]],"date-time":"2005-06-15T06:49:08Z","timestamp":1118818148000},"page":"77-89","source":"Crossref","is-referenced-by-count":3,"title":["Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers"],"prefix":"10.1007","volume":"7","author":[{"given":"Jorge L. C.","family":"Sanz","sequence":"first","affiliation":[]},{"given":"Robert","family":"Cypher","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"BF01758752_CR1","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1016\/0743-7315(86)90011-0","volume":"3","author":"M. J. Atallah","year":"1986","unstructured":"M. J. Atallah and M. T. Goodrich. Efficient parallel solutions to some geometric problems.Journal of Parallel and Distributed Computing, 3(4):492\u2013507, December 1986.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"BF01758752_CR2","doi-asserted-by":"crossref","unstructured":"K. E. Batcher. Sorting networks and their applications. InProc. AFIPS Spring Joint Computer Conf., pages 307\u2013314, 1968.","DOI":"10.1145\/1468075.1468121"},{"key":"BF01758752_CR3","doi-asserted-by":"crossref","first-page":"1641","DOI":"10.1002\/j.1538-7305.1964.tb04103.x","volume":"43","author":"V. E. Benes","year":"1964","unstructured":"V. E. Benes. Optimal rearrangeable multistage connection networks.Bell System Technical Journal, 43:1641\u20131656, 1964.","journal-title":"Bell System Technical Journal"},{"issue":"4","key":"BF01758752_CR4","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1145\/358841.358850","volume":"23","author":"J. L. Bentley","year":"1980","unstructured":"J. L. Bentley. Multidimensional divide-and-conquer.Communications of the ACM, 23(4):214\u2013229, April 1980.","journal-title":"Communications of the ACM"},{"key":"BF01758752_CR5","unstructured":"G. Blelloch. Scans as primitive parallel operations. InProc. Internat. Conf. on Parallel Processing, pages 355\u2013362, 1987."},{"key":"BF01758752_CR6","unstructured":"E. R. Cohn. Implementing the multi-prefix operation efficiently. Unpublished manuscript, 1989."},{"key":"BF01758752_CR7","unstructured":"E. R. Cohn and R. W. Haddad. Beta Operations: Efficient Implementation of a Primitive Parallel Operation. Technical Report, Dept. of Computer Science, Stanford University August 1986."},{"key":"BF01758752_CR8","doi-asserted-by":"crossref","unstructured":"R. Cole and U. Vishkin. Approximate and exact parallel scheduling with applications to list, tree, and graph problems. InProc. 27th Annual Symposium on Foundations of Computer Science, pages 478\u2013491, 1986.","DOI":"10.1109\/SFCS.1986.10"},{"key":"BF01758752_CR9","doi-asserted-by":"crossref","unstructured":"R. Cole and U. Vishkin. Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms. InProc. 18th Annual Symposium on Theory of Computing, pages 206\u2013219, 1986.","DOI":"10.1145\/12130.12151"},{"key":"BF01758752_CR10","unstructured":"R. Cypher and J. L. C. Sanz.Algorithms for Reduced Hypercubes and Related Computers. Technical Report TR 89-04-05, Dept. of Computer Science, University of Washington, April 1989."},{"key":"BF01758752_CR11","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/0196-6774(89)90028-X","volume":"10","author":"R. Cypher","year":"1989","unstructured":"R. Cypher and J. L. C. Sanz. Hypercube and shuffle-exchange algorithms for image component labeling.Journal of Algorithms, 10:140\u2013150, 1989.","journal-title":"Journal of Algorithms"},{"key":"BF01758752_CR12","unstructured":"Y. Han. Designing Fast and Efficient Parallel Algorithms. Ph.D. thesis, Dept. of Computer Science, Duke University, 1987."},{"key":"BF01758752_CR13","volume-title":"The Connection Machine","author":"W. D. Hillis","year":"1985","unstructured":"W. D. Hillis.The Connection Machine. MIT Press, Cambridge, MA, 1985."},{"key":"BF01758752_CR14","unstructured":"J. Ja'Ja' and Kwan Woo Ryu. Efficient Techniques for Routing and for Solving Graph Problems on the Hypercube. Technical Report CS-TR-2216, Dept. of Computer Science, University of Maryland, March 1989."},{"key":"BF01758752_CR15","unstructured":"R. Miller and Q. F. Stout. Mesh Computer Algorithms for Computational Geometry. Technical Report 86-18, State University of New York at Buffalo, 1986."},{"issue":"2","key":"BF01758752_CR16","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1109\/TC.1981.6312172","volume":"30","author":"D. Nassimi","year":"1981","unstructured":"D. Nassimi and S. Sahni. Data broadcasting in SIMD computers.IEEE Transactions on Computers, 30(2): 101\u2013107, February 1981.","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"BF01758752_CR17","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1109\/TC.1982.1675960","volume":"31","author":"D. Nassimi","year":"1982","unstructured":"D. Nassimi and S. Sahni. Parallel algorithms to set up the Benes permutation network.IEEE Transactions on Computers, 31(2): 148\u2013154, February 1982.","journal-title":"IEEE Transactions on Computers"},{"key":"BF01758752_CR18","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.Journal of the ACM, 29:642\u2013667, July 1982.","journal-title":"Journal of the ACM"},{"key":"BF01758752_CR19","unstructured":"A. G. Ranade. Fluent Parallel Computation. Ph.D. thesis, Yale University, May 1989."},{"key":"BF01758752_CR20","volume-title":"Digital Picture Processing","author":"A. Rosenfeld","year":"1982","unstructured":"A. Rosenfeld and A. C. Kak.Digital Picture Processing. Academic Press, New York, 1982."},{"key":"BF01758752_CR21","unstructured":"J. L. C. Sanz and R. Cypher. Data Reduction and Fast Routing: A Strategy for Efficient Algorithms for Parallel Message-Passing Computers. Technical Report, IBM Almaden Research Center, November 1987."},{"issue":"4","key":"BF01758752_CR22","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(4):484\u2013521, October 1980.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"BF01758752_CR23","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0196-6774(82)90008-6","volume":"3","author":"Y. Shiloach","year":"1982","unstructured":"Y. Shiloach and U. Vishkin. AnO(logn) parallel connectivity algorithm.Journal of Algorithms, 3:57\u201367, 1982.","journal-title":"Journal of Algorithms"},{"issue":"2","key":"BF01758752_CR24","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1109\/T-C.1971.223205","volume":"20","author":"H. S. Stone","year":"1971","unstructured":"H. S. Stone. Parallel processing with the perfect shuffle.IEEE Transactions on Computers, 20(2): 153\u2013161, February 1971.","journal-title":"IEEE Transactions on Computers"},{"key":"BF01758752_CR25","first-page":"3","volume-title":"Intermediate-Level Image Processing","author":"S. L. Tanimoto","year":"1986","unstructured":"S. L. Tanimoto.Intermediate-Level Image Processing, pages 3\u201316. Academic Press, New York, 1986."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01758752.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01758752\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01758752","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T12:25:40Z","timestamp":1557318340000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01758752"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":25,"journal-issue":{"issue":"1-6","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["BF01758752"],"URL":"https:\/\/doi.org\/10.1007\/bf01758752","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}