{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:41:40Z","timestamp":1759333300847},"publisher-location":"London","reference-count":13,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9783540199144"},{"type":"electronic","value":"9781447135739"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/978-1-4471-3573-9_10","type":"book-chapter","created":{"date-parts":[[2013,1,5]],"date-time":"2013-01-05T01:22:28Z","timestamp":1357348948000},"page":"141-150","source":"Crossref","is-referenced-by-count":3,"title":["Functional Binomial Queues"],"prefix":"10.1007","author":[{"given":"David J.","family":"King","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","volume-title":"Addison-Wesley","author":"AV Aho","year":"1983","unstructured":"Alfred V. Aho, John E. Hoperoft, and Jeffrey D. Ullman. Data Structures and Algorithms. Addison-Wesley, 1983."},{"issue":"3","key":"10_CR2","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF00264249","volume":"21","author":"S Richard","year":"1984","unstructured":"Richard S. Bird. Using circular programs to eliminate multiple traversals of data. Acta Informatica, 21 (3): 239\u2013250, 1984.","journal-title":"Acta Informatica"},{"issue":"3","key":"10_CR3","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0207026","volume":"7","author":"R Mark","year":"1978","unstructured":"Mark R. Brown. Implementation and analysis of binomial queue algorithms. SIAM Journal of Computing, 7 (3): 298\u2013319, 1978.","journal-title":"SIAM Journal of Computing"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"W Edsger","year":"1959","unstructured":"Edsger W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1: 269\u2013271, 1959.","journal-title":"Numerische Mathematik"},{"issue":"3","key":"10_CR5","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"ML Fredman","year":"1987","unstructured":"Michael L. Fredman and Robert E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM, 34 (3): 596\u2013615, July 1987.","journal-title":"Journal of the ACM"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Paul Hudak, Simon L. Peyton Jones, Philip Wadler, Arvind, Brian Boutel, Jon Fairbairn, Joseph Fasel, Maria M. Guzman, Kevin Hammond, John Hughes, Thomas Johnsson, Richard Kieburtz, Rishiyur S. Nikhil, Will Par-tain, and John Peterson. Report on the functional programming language Haskell, Version 1.2. ACM SIGPLAN Notices, 27 (5), May 1992.","DOI":"10.1145\/130697.130699"},{"issue":"4","key":"10_CR7","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1145\/5684.5686","volume":"29","author":"W Douglas","year":"1986","unstructured":"Douglas W. Jones. An empirical comparison of priority-queue and event-set implementations. Communications of the ACM, 29 (4): 300\u2013311, April 1986.","journal-title":"Communications of the ACM"},{"key":"10_CR8","volume-title":"The Art of Computer Programming: Sorting and Searching","author":"E Donald","year":"1973","unstructured":"Donald E. Knuth. The Art of Computer Programming: Sorting and Searching, volume 3. Addison-Wesley, Reading, Massachusetts, 1973."},{"key":"10_CR9","volume-title":"ML for the working programmer","author":"LC Paulson","year":"1991","unstructured":"L. C. Paulson. ML for the working programmer. Cambridge University Press, Cambridge, 1991."},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0167-6423(92)90009-Z","volume":"18","author":"MP Chris","year":"1992","unstructured":"Chris M. P. Reade. Balanced trees with removals: an exercise in rewriting and proof. Science of Computer Programming, 18: 181\u2013204, 1992.","journal-title":"Science of Computer Programming"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Daniel D. Sleator and Robert E. Tarjan. Self-adjusting binary trees. In Proceedings of the 15th Annual ACM Symposium on Theory of Computing,pages 235\u2013245, Boston, Massachusetts, April 1983. ACM.","DOI":"10.1145\/800061.808752"},{"key":"10_CR12","volume-title":"SIAM","author":"E Robert","year":"1983","unstructured":"Robert E. Tarjan. Data Structures and Network Algorithms. SIAM, 1983."},{"issue":"4","key":"10_CR13","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1145\/359460.359478","volume":"21","author":"J Vuillemin","year":"1978","unstructured":"Jean Vuillemin. A data structure for manipulating priority queues. Communications of the ACM, 21 (4): 309\u2013315, April 1978.","journal-title":"Communications of the ACM"}],"container-title":["Workshops in Computing","Functional Programming, Glasgow 1994"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-3573-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T02:39:04Z","timestamp":1557455944000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4471-3573-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540199144","9781447135739"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-3573-9_10","relation":{},"ISSN":["1431-1682"],"issn-type":[{"type":"print","value":"1431-1682"}],"subject":[],"published":{"date-parts":[[1995]]}}}