{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T07:46:34Z","timestamp":1759131994179},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1988,11,1]],"date-time":"1988-11-01T00:00:00Z","timestamp":594345600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[1988,11]]},"DOI":"10.1007\/bf00129780","type":"journal-article","created":{"date-parts":[[2004,10,31]],"date-time":"2004-10-31T15:15:24Z","timestamp":1099235724000},"page":"257-278","source":"Crossref","is-referenced-by-count":38,"title":["An algebraic model for divide-and-conquer and its parallelism"],"prefix":"10.1007","volume":"2","author":[{"given":"Zhijing G.","family":"Mou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Hudak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"Aho, A. V., Hopcroft, J. E., and Ullman, J. D. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass."},{"issue":"5","key":"CR2","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1109\/TC.1987.1676942","volume":"C-36","author":"M. J. Berger","year":"1987","unstructured":"Berger, M. J., and Bokhari, S. H. 1987. A partitioning strategy for nonuniform problems on multiprocessors. IEEE Transactions on Computers, C-36(5):570?580.","journal-title":"IEEE Transactions on Computers"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","volume":"64","author":"S. A. Cook","year":"1985","unstructured":"Cook, S. A. 1985. A taxonomy of problems with fast parallel algorithms. Information and Control, 64:2?22.","journal-title":"Information and Control"},{"key":"CR4","volume-title":"Applied Mordern Algebra","author":"L. L. Dornhoff","year":"1978","unstructured":"Dornhoff, L. L., and Hohn, F. E. 1978. Applied Mordern Algebra. Macmillan, New York."},{"key":"CR5","unstructured":"Huang, M. -D. 1985. Solving graph problems with optimal speedup on mesh-of-tree networks. In Proc. Twenty-sixth Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, pp. 232?240."},{"key":"CR6","volume-title":"The Characteristics of Parallel Algorithms","author":"L. H. Jamieson","year":"1987","unstructured":"Jamieson, L. H., Gannon, D. B., and Douglass, R. J. 1987. The Characteristics of Parallel Algorithms. The MIT Press, Cambridge, Mass."},{"issue":"4","key":"CR7","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","volume":"27","author":"R. E. Ladner","year":"1980","unstructured":"Ladner, R. E., and Fischer, M. J. 1980. Parallel prefix computation. Journal of the ACM, 27(4):831?838.","journal-title":"Journal of the ACM"},{"issue":"5","key":"CR8","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/358645.358660","volume":"8","author":"F. P. Preparata","year":"1981","unstructured":"Preparata, F. P., and Vuillemin, J. 1981. The cube-connected cycles: A versatile network for parallel computation. Communications of ACM, 8(5):300?309.","journal-title":"Communications of ACM"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"Smith, D. R. 1987. Applications of a strategy for designing divide-and-conquer algorithms. Science of Computer Programming, (8):213?229.","DOI":"10.1016\/0167-6423(87)90034-7"},{"issue":"2","key":"CR10","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1109\/T-C.1971.223205","volume":"C-20","author":"H. S. Stone","year":"1971","unstructured":"Stone, H. S. 1971. Parallel processing with the perfect shuffle. IEEE Transactions on Computers, C-20(2):153?160.","journal-title":"IEEE Transactions on Computers"},{"key":"CR11","unstructured":"Ullman, J. D. 1984. Computational Aspect of VLSI. Computer Science Press."},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"Valiant, L. G. 1981. Universal schemes for parallel communication. In Proc. Thirteenth Annual ACM Symposium on the Theory of Computing, pp. 263?277.","DOI":"10.1145\/800076.802479"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00129780.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00129780\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00129780","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T04:51:39Z","timestamp":1554267099000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00129780"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,11]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1988,11]]}},"alternative-id":["BF00129780"],"URL":"https:\/\/doi.org\/10.1007\/bf00129780","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,11]]}}}