{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:35Z","timestamp":1725663695967},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540557067"},{"type":"electronic","value":"9783540472759"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55706-7_13","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:32:23Z","timestamp":1330252343000},"page":"140-150","source":"Crossref","is-referenced-by-count":6,"title":["Heap construction in the parallel comparison tree model"],"prefix":"10.1007","author":[{"given":"Paul F.","family":"Dietz","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"13_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, New York, 1974."},{"key":"13_CR2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0022-0000(89)90035-4","volume":"38","author":"M. Ajtai","year":"1989","unstructured":"M. Ajtai, J. Koml\u00f3s, W. L. Steiger, and E. Szemer\u00e9di. Optimal parallel selection has complexity O(log log n). Journal of Computer and System Sciences, 38:125\u2013133, 1989.","journal-title":"Journal of Computer and System Sciences"},{"issue":"10","key":"13_CR3","doi-asserted-by":"crossref","first-page":"996","DOI":"10.1145\/6617.6621","volume":"29","author":"M. Atkinson","year":"1986","unstructured":"M. Atkinson, J. Sack, N. Santoro, and T. Strothotte. Min-max heaps and generalized priority queues. Communications of the ACM, 29(10):996\u20131000, October 1986.","journal-title":"Communications of the ACM"},{"key":"13_CR4","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0166-218X(90)90128-Y","volume":"27","author":"Y. Azar","year":"1990","unstructured":"Y. Azar and N. Pippenger. Parallel selection. Discrete Appl. Math., 27:49\u201358, 1990.","journal-title":"Discrete Appl. Math."},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Omer Berkman and Uzi Vishkin. Recursive *-tree parallel data-structure. In Proc. 30th Ann. IEEE Symp. on Foundations of Computer Science, pages 196\u2013202, October 1989.","DOI":"10.1109\/SFCS.1989.63478"},{"key":"13_CR6","volume-title":"Technical Report LU-CS-TR:91-77","author":"S. Carlsson","year":"1991","unstructured":"Svante Carlsson and Jingsen Zhang. Parallel complexity of heaps and min-max heaps. Technical Report LU-CS-TR:91-77, Department of Computer Science, Lund University, Lund, Sweden, August 1991."},{"key":"13_CR7","unstructured":"Y. Matias O. Berkman and U. Vishkin, July 1991. Unpublished manuscript."},{"key":"13_CR8","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/0020-0190(91)90154-A","volume":"37","author":"N. S. V. Rao","year":"1991","unstructured":"N. S. V. Rao and W. Zhang. Building heaps in parallel. Info. Proc. Lett., 37:355\u2013358, 1991.","journal-title":"Info. Proc. Lett."},{"issue":"2","key":"13_CR9","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1137\/0214030","volume":"14","author":"R. Reischuk","year":"1985","unstructured":"R\u00fcdiger Reischuk. Probabilistic parallel algorithms for sorting and selection. SIAM J. On Computing, 14(2):396\u2013409, May 1985.","journal-title":"SIAM J. On Computing"},{"issue":"3","key":"13_CR10","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1137\/0204030","volume":"4","author":"L. G. Valiant","year":"1975","unstructured":"Leslie G. Valiant. Parallelism in comparison problems. SIAM J. On Computing, 4(3):348\u2013355, September 1975.","journal-title":"SIAM J. On Computing"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Uzi Vishkin. Structural parallel algorithmics. In ICALP 91, pages 363\u2013380, July 1991.","DOI":"10.1007\/3-540-54233-7_148"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT '92"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55706-7_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:34:37Z","timestamp":1619573677000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55706-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540557067","9783540472759"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-55706-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}