{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:37Z","timestamp":1725664057966},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540582014"},{"type":"electronic","value":"9783540485667"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58201-0_101","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:35:20Z","timestamp":1330270520000},"page":"593-604","source":"Crossref","is-referenced-by-count":6,"title":["The average case complexity of the parallel prefix problem"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Jakoby","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Schindelhauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R\u00fcdiger","family":"Reischuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephan","family":"Weis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"49_CR1","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1145\/62044.62052","volume":"36","author":"G. Bilardi","year":"1989","unstructured":"G. Bilardi, F. Preparata, Size-Time Complexity of Boolean Networks for Prefix Computations, J. ACM 36, 1989, 362\u2013382.","journal-title":"J. ACM"},{"key":"49_CR2","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1137\/0219016","volume":"19","author":"G. Bilardi","year":"1990","unstructured":"G. Bilardi, F. Preparata, Characterization of Associative Operations with Prefix Circuits of Constant Depth and Linear Size, SIAM J. Comput. 19, 1990, 246\u2013255.","journal-title":"SIAM J. Comput."},{"key":"49_CR3","doi-asserted-by":"crossref","unstructured":"A. Jakoby, R. Reischuk, C. Schindelhauer, Circuit Complexity: from the Worst Case to the Average Case, Technical Report, TH Darmstadt, 1993, to be presented at STOC'94.","DOI":"10.1145\/195058.195106"},{"key":"49_CR4","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","volume":"27","author":"R. Ladner","year":"1980","unstructured":"R. Ladner, M. Fischer, Parallel Prefix Computation, J. ACM 27, 1980, 831\u2013838.","journal-title":"J. ACM"},{"key":"49_CR5","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0898-1221(93)90089-E","volume":"26","author":"J. Reif","year":"1993","unstructured":"J. Reif, Probabilistic Parallel Prefix Computation, Comp. Math. Applic. 26, 1993, 101\u2013110.","journal-title":"Comp. Math. Applic."},{"key":"49_CR6","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0196-6774(86)90003-9","volume":"7","author":"M. Snir","year":"1986","unstructured":"M. Snir, Depth-Size Trade-offs for Parallel Prefix Computation, J. Alg. 7, 1986, 185\u2013201.","journal-title":"J. Alg."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58201-0_101.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:18:24Z","timestamp":1605647904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58201-0_101"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540582014","9783540485667"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-58201-0_101","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}