{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T14:33:11Z","timestamp":1794407591718,"version":"4.9.0"},"publisher-location":"Boston, MA","reference-count":12,"publisher":"Springer US","isbn-type":[{"value":"9780387097657","type":"print"},{"value":"9780387097664","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-0-387-09766-4_120","type":"book-chapter","created":{"date-parts":[[2012,1,5]],"date-time":"2012-01-05T01:10:46Z","timestamp":1325725846000},"page":"1728-1736","source":"Crossref","is-referenced-by-count":1,"title":["Reduce and Scan"],"prefix":"10.1007","author":[{"given":"Marc","family":"Snir","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"120_CR1_120","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1145\/62044.62052","volume":"36","author":"G Bilardi","year":"1989","unstructured":"Bilardi G, Preparata FP (1989) Size-time complexity of Boolean networks for prefix computations. J ACM 36:362\u2013382","journal-title":"J ACM"},{"key":"120_CR2_120","doi-asserted-by":"publisher","first-page":"1526","DOI":"10.1109\/12.42122","volume":"38","author":"GE Blelloch","year":"1989","unstructured":"Blelloch GE (1989) Scans as primitive parallel operations. IEEE Tram Comp 38:1526\u20131538","journal-title":"IEEE Tram Comp"},{"key":"120_CR3_120","volume-title":"Scan primitives for vector computers","author":"B Chatterjee","year":"1990","unstructured":"Chatterjee B, Blelloch GE, Zagha M (1990) Scan primitives for vector computers. In: Proceedings of supercomputing conference. IEEE Computer Society Press, New York"},{"key":"120_CR4_120","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/S0019-9958(86)80023-7","volume":"70","author":"R Cole","year":"1986","unstructured":"Cole R, Vishkin U (1986) Deterministic coin tossing with applications to optimal parallel list ranking. Inform Control 70:32\u201353","journal-title":"Inform Control"},{"key":"120_CR5_120","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/232807.232818","volume":"6","author":"AG Greenberg","year":"1996","unstructured":"Greenberg AG, Lubachevsky BD, Mitrani I (1996) Superfast parallel discrete event simulations. ACM Trans Model Comput Simul 6:107\u2013136","journal-title":"ACM Trans Model Comput Simul"},{"key":"120_CR6_120","volume-title":"A Programming language","author":"KE Iverson","year":"1962","unstructured":"Iverson KE (1962) A Programming language. Wiley, New York"},{"key":"120_CR7_120","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1145\/48022.48024","volume":"10","author":"CP Kruskal","year":"1986","unstructured":"Kruskal CP, Rudolph L, Snir M (1986) Efficient synchronization on multiprocessors with shared memory. ACM TOPLAS 10:579\u2013601","journal-title":"ACM TOPLAS"},{"key":"120_CR8_120","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF01840376","volume":"5","author":"CP Kruskal","year":"1990","unstructured":"Kruskal CP, Rudolph L, Snir M (1990) Efficient parallel algorithms for graph problems. Algorithmica 5:43\u201364","journal-title":"Algorithmica"},{"key":"120_CR9_120","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1145\/322217.322232","volume":"27","author":"RE Ladner","year":"1980","unstructured":"Ladner RE, Fischer MJ (1980) Parallel prefix computation. J Assoc Comput Mach 27:832\u2013838","journal-title":"J Assoc Comput Mach"},{"key":"120_CR10_120","first-page":"165","volume":"8","author":"Message Passing Interface Forum","year":"1994","unstructured":"Message Passing Interface Forum (1994) MPI: a message-passing interface standard. Int J Supercomput Appl High Perform Comput 8:165\u2013416","journal-title":"Int J Supercomput Appl High Perform Comput"},{"key":"120_CR11_120","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0196-6774(86)90003-9","volume":"7","author":"M Snir","year":"1986","unstructured":"Snir M (1986) Depth-size trade-offs for parallel prefix computation. J Algorithms 7:185\u2013201","journal-title":"J Algorithms"},{"key":"120_CR12_120","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1137\/0214061","volume":"14","author":"RE Tarjan","year":"1985","unstructured":"Tarjan RE, Vishkin U (1985) An efficient parallel biconnectivity algorithm. Siam J Comput 14:862\u2013874","journal-title":"Siam J Comput"}],"container-title":["Encyclopedia of Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-09766-4_120","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T13:40:25Z","timestamp":1794318025000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/chapter\/10.1007\/978-0-387-09766-4_120"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9780387097657","9780387097664"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-09766-4_120","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-0-387-09766-4","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2011]]}}}