{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:51:32Z","timestamp":1725663092755},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540167662"},{"type":"electronic","value":"9783540387466"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16766-8_27","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T13:54:08Z","timestamp":1330178048000},"page":"296-304","source":"Crossref","is-referenced-by-count":2,"title":["On the time required to sum n semigroup elements on a parallel machine with simultaneous writes"],"prefix":"10.1007","author":[{"given":"Ian","family":"Parberry","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"A. K. Chandra, L. J. Stockmeyer, and U. Vishkin, \u201cA complexity theory for unbounded fan-in parallelism,\u201d Proc. 23rd Ann. IEEE Symp. on Foundations of Computer Science, pp. 1\u201313, 1982.","DOI":"10.1109\/SFCS.1982.3"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"S. A. Cook and C. Dwork, \u201cBounds on the time for parallel RAMs to compute simple functions,\u201d Proc. 14th Ann. ACM Symp. on Theory of Computing, pp. 231\u2013233, May 1982.","DOI":"10.1145\/800070.802196"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"S. Fortune and J. Wyllie, \u201cParallelism in random access machines,\u201d Proc. 10th Ann. ACM Symp. on Theory of Computing, pp. 114\u2013118, 1978.","DOI":"10.1145\/800133.804339"},{"key":"27_CR4","unstructured":"M. R. Garey and D. S. Johnson, Computers and intractability: a guide to the theory of NP-completeness, W. H. Freeman, 1979."},{"issue":"4","key":"27_CR5","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1145\/322344.322353","volume":"29","author":"L. M. Goldschlager","year":"1982","unstructured":"L. M. Goldschlager, \u201cA universal interconnection pattern for parallel computers,\u201d J. ACM, vol. 29, no. 4, pp. 1073\u20131086, Oct. 1982.","journal-title":"J. ACM"},{"key":"27_CR6","first-page":"56","volume-title":"On the limits to speed up parallel machines by large hardware and unbounded communication","author":"F. Meyer auf der Heide","year":"1984","unstructured":"F. Meyer auf der Heide and R. Reischuk, \u201cOn the limits to speed up parallel machines by large hardware and unbounded communication,\u201d Proc. 25th Ann. IEEE Symp. on Foundations of Computer Science, pp. 56\u201364, Singer Island, Florida, Oct. 1984."},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"F. Meyer auf der Heide and A. Wigderson, \u201cThe complexity of parallel sorting,\u201d Proc. 26th Ann. IEEE Symp. on Foundations of Computer Science, Portland, Oregon, Oct. 1985.","DOI":"10.1109\/SFCS.1985.58"},{"key":"27_CR8","unstructured":"C. P. Kruskal, Personal Communication, May 1985."},{"key":"27_CR9","unstructured":"I. Parberry, \u201cParallel speedup of sequential machines: a defense of the parallel computation thesis,\u201d Technical Report CS-84-17, Dept. of Computer Science, Penn. State Univ., Oct. 1984."},{"key":"27_CR10","unstructured":"I. Parberry, \u201cA complexity theory of parallel computation,\u201d Ph. D. Thesis, Dept. of Computer Science, Univ. of Warwick, May 1984."},{"key":"27_CR11","unstructured":"I. Parberry, \u201cSome practical simulations of impractical parallel computers,\u201d in VLSI: Algorithms and Architectures, ed. P. Bertollazzi and F. Lucio, Proc. International Workshop on Parallel Computing and VLSI, pp. 27\u201337, North-Holland, 1985."},{"key":"27_CR12","unstructured":"I. Parberry and G. Schnitger, \u201cParallel computation with threshold functions (Preliminary Version),\u201d Technical Report CS-85-32, Dept. of Computer Science, Penn. State Univ., Dec. 1985."},{"key":"27_CR13","unstructured":"R. Reischuk, \u201cA lower time-bound for parallel random-access machines without simultaneous writes,\u201d Research Report RJ3431, IBM Research, San Jose, Mar. 1982."},{"key":"27_CR14","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, \u201cFinding the maximum, sorting and merging in a parallel computation model,\u201d J. Algorithms, vol. 2, pp. 88\u2013102, 1981.","journal-title":"J. Algorithms"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"U. Vishkin and A. Wigderson, \u201cTrade-offs between depth and width in parallel computation,\u201d Proc. 24th Ann. IEEE Symp. on Foundations of Computer Science, Tucson, Arizona, Nov. 1983.","DOI":"10.1109\/SFCS.1983.77"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"A. C. Yao, \u201cSeparating the polynomial-time hierarchy by oracles,\u201d Proc. 26th Ann. IEEE Symp. on Foundations of Computer Science, Portland, Oregon, Oct. 1985.","DOI":"10.1109\/SFCS.1985.49"}],"container-title":["Lecture Notes in Computer Science","VLSI Algorithms and Architectures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16766-8_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:11:10Z","timestamp":1605625870000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16766-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540167662","9783540387466"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-16766-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]}}}