{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:16Z","timestamp":1725664156807},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540575689"},{"type":"electronic","value":"9783540482338"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57568-5_242","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:09:18Z","timestamp":1330261758000},"page":"128-137","source":"Crossref","is-referenced-by-count":4,"title":["Double-ended binomial queues"],"prefix":"10.1007","author":[{"given":"C. M.","family":"Khoong","sequence":"first","affiliation":[]},{"given":"H. W.","family":"Leong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"996","DOI":"10.1145\/6617.6621","volume":"29","author":"M. D. Atkinson","year":"1986","unstructured":"M. D. Atkinson, J.-R. Sack, N. Santoro, and T. Strothotte, Min-max heaps and generalized priority queues. Comm. ACM\n29 (1986) 996\u20131000.","journal-title":"Comm. ACM"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0020-0190(87)90033-0","volume":"26","author":"S. Carlsson","year":"1987","unstructured":"S. Carlsson, The deap \u2014 A double-ended heap to implement double-ended priority queues. Inform. Proc. Lett.\n26 (1987) 33\u201336.","journal-title":"Inform. Proc. Lett."},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0304-3975(91)90262-Z","volume":"84","author":"G. Gambosi","year":"1991","unstructured":"G. Gambosi, E. Nardelli, and M. Talamo, A pointer-free data structure for merging heaps and min-max heaps. Theoret. Comput. Sci.\n84 (1991) 107\u2013126.","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR4","volume-title":"M.Sc. Thesis","author":"C. M. Khoong","year":"1993","unstructured":"C. M. Khoong, The design and analysis of heap algorithms. M.Sc. Thesis, Department of Information Systems and Computer Science, National University of Singapore, Singapore, 1993."},{"key":"14_CR5","unstructured":"C. M. Khoong and H. W. Leong, Relaxed inorder heaps. Submitted for publication."},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1093\/comjnl\/34.5.423","volume":"34","author":"S. Olariu","year":"1991","unstructured":"S. Olariu, C. M. Overstreet, and Z. Wen (1991), A mergeable doubleended priority queue. Computer J., Vol. 34, pp. 423\u2013427.","journal-title":"Computer J."},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1145\/359460.359478","volume":"21","author":"J. Vuillemin","year":"1978","unstructured":"J. Vuillemin, A data structure for manipulating priority queues. Comm. ACM\n21 (1978)309\u2013315.","journal-title":"Comm. ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57568-5_242.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:06:19Z","timestamp":1619571979000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57568-5_242"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540575689","9783540482338"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-57568-5_242","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}