{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:11Z","timestamp":1725663371462},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540515425"},{"type":"electronic","value":"9783540482376"}],"license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51542-9_42","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:07:40Z","timestamp":1330186060000},"page":"510-516","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The distribution of keys in a binary heap"],"prefix":"10.1007","author":[{"given":"Mark Allen","family":"Weiss","sequence":"first","affiliation":[]},{"given":"Jainendra K.","family":"Navlakha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"issue":"2","key":"42_CR1","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0020-0190(81)90031-4","volume":"13","author":"M. J. Atallah","year":"1981","unstructured":"Atallah M.J, and Kosaraju S.R, \"An Adversary Lower Bound For Sorting\", Information Processing Letters\", 13, 2 (1981), 55\u201357.","journal-title":"Information Processing Letters"},{"key":"42_CR2","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1145\/360680.360691","volume":"18","author":"R. Floyd","year":"1975","unstructured":"Floyd, R. and Rivest, R., \"Expected Time Bounds for Selection\", Communications of the ACM, 18, (1975), 165\u2013172.","journal-title":"Communications of the ACM"},{"issue":"3","key":"42_CR3","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M. L. Fredman","year":"1987","unstructured":"Fredman, M.L. and Tarjan, R.E., \"Fibonacci heaps and their uses in improved network optimization algorithms, Journal of the ACM, 34, 3 (1987), 596\u2013615.","journal-title":"Journal of the ACM"},{"key":"42_CR4","volume-title":"The Art of Computer Programming, Vol. 3: Sorting and Searching","author":"D. E. Knuth","year":"1973","unstructured":"Knuth, D.E., The Art of Computer Programming, Vol. 3: Sorting and Searching (Addison-Wesley, Reading, MA, 1973)."},{"key":"42_CR5","unstructured":"Navlakha, J.K., \"Finding the k-th largest element in a large heap in O (k log log n) time\", Proceedings of the 1982 Conference of Information Science and Systems, Princeton, (1982) 66\u201369."},{"key":"42_CR6","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1145\/359460.359478","volume":"21","author":"J. Vuillemin","year":"1978","unstructured":"Vuillemin, J., \"A data structure for manipulating priority queues\", Communications of the ACM, 21, (1978), 309\u2013314.","journal-title":"Communications of the ACM"},{"issue":"6","key":"42_CR7","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","volume":"7","author":"J. W. J. J. Williams","year":"1964","unstructured":"Williams, J. W. J., Algorithm 232, Communications of the ACM, 7, 6 (1964), 347\u2013348.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51542-9_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,30]],"date-time":"2021-12-30T21:57:00Z","timestamp":1640901420000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51542-9_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540515425","9783540482376"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-51542-9_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]},"assertion":[{"value":"26 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}