{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T21:51:51Z","timestamp":1693864311473},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1996,1]]},"DOI":"10.1016\/0020-0190(95)00194-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:27:49Z","timestamp":1027600069000},"page":"109-114","source":"Crossref","is-referenced-by-count":5,"title":["A generalization of binomial queues"],"prefix":"10.1016","volume":"57","author":[{"given":"Rolf","family":"Fagerberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(95)00194-8_BIB1","series-title":"Algorithms and Data Structures","first-page":"282","article-title":"Fast meldable priority queues","volume":"955","author":"Brodal","year":"1995"},{"key":"10.1016\/0020-0190(95)00194-8_BIB2","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0207026","article-title":"Implementation and analysis of binomial queue algorithms","volume":"7","author":"Brown","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(95)00194-8_BIB3","series-title":"SWAT 88","first-page":"1","article-title":"An implicit binomial queue with constant insertion time","volume":"318","author":"Carlsson","year":"1988"},{"key":"10.1016\/0020-0190(95)00194-8_BIB4","series-title":"Proc. 5th ACM-SIAM SODA'94","first-page":"516","article-title":"Shortest paths algorithms: Theory and experimental evaluation","author":"Cherkassky","year":"1994"},{"key":"10.1016\/0020-0190(95)00194-8_BIB5","doi-asserted-by":"crossref","first-page":"1343","DOI":"10.1145\/50087.50096","article-title":"Relaxed heaps: An alternative to Fibonacci heaps with applications to parallel computation","volume":"31","author":"Driscoll","year":"1988","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(95)00194-8_BIB6","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01840439","article-title":"The pairing heap: A new form of self-adjusting heap","volume":"1","author":"Fredman","year":"1986","journal-title":"Algorithmica"},{"key":"10.1016\/0020-0190(95)00194-8_BIB7","series-title":"Proc. 25th Ann. IEEE Symp. on Foundations of Computer Science","first-page":"338","article-title":"Fibonacci heaps and their uses in improved network optimization algorithms","author":"Fredman","year":"1984"},{"key":"10.1016\/0020-0190(95)00194-8_BIB8","series-title":"Proc. 3rd Israel Symp. on Theory of Computing and Systems","first-page":"57","article-title":"A general technique for implementation of efficient priority queues","author":"H\u00f8yer","year":"1995"},{"key":"10.1016\/0020-0190(95)00194-8_BIB9","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/5684.5686","article-title":"An empirical comparison of priority-queue and event-set implementations","volume":"29","author":"Jones","year":"1986","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(95)00194-8_BIB10","series-title":"Algorithms and Computation","first-page":"128","article-title":"Double-ended binomial queues","volume":"762","author":"Khoong","year":"1993"},{"key":"10.1016\/0020-0190(95)00194-8_BIB11","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/BF01758771","article-title":"Three priority queue applications revisited","volume":"7","author":"Liao","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/0020-0190(95)00194-8_BIB12","series-title":"Algorithms and Data Structures","first-page":"400","article-title":"An empirical analysis of algorithms for constructing a minimum spanning tree","volume":"519","author":"Moret","year":"1991"},{"key":"10.1016\/0020-0190(95)00194-8_BIB13","article-title":"A balanced tree scheme for meldable heaps with updates","author":"Peterson","year":"1987"},{"key":"10.1016\/0020-0190(95)00194-8_BIB14","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1145\/359460.359478","article-title":"A data structure for manipulating priority queues","volume":"21","author":"Vuillemin","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(95)00194-8_BIB15","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","article-title":"Algorithm 232: Heapsort","volume":"7","author":"Williams","year":"1964","journal-title":"Comm. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019095001948?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019095001948?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,5]],"date-time":"2021-05-05T18:57:50Z","timestamp":1620241070000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019095001948"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,1]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,1]]}},"alternative-id":["0020019095001948"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(95)00194-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,1]]}}}