{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T23:27:10Z","timestamp":1672615630881},"reference-count":8,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1993,7,1]],"date-time":"1993-07-01T00:00:00Z","timestamp":741484800000},"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":[[1993,7]]},"DOI":"10.1016\/0020-0190(93)90101-e","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:45:40Z","timestamp":1027655140000},"page":"231-237","source":"Crossref","is-referenced-by-count":5,"title":["Diamond deque: a simple data structure for priority deques"],"prefix":"10.1016","volume":"46","author":[{"given":"S.C.","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.W.","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90101-E_BIB1","doi-asserted-by":"crossref","first-page":"996","DOI":"10.1145\/6617.6621","article-title":"Min-max heaps and generalized priority queues","volume":"29","author":"Atkinson","year":"1986","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(93)90101-E_BIB2","series-title":"Tech. Memo.","article-title":"Incremental sorting and selective sorting - two techniques to reduce response time in information retrieval","author":"Du","year":"1989"},{"key":"10.1016\/0020-0190(93)90101-E_BIB3","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1145\/355588.365103","article-title":"Treesort 3: Algorithm 245","volume":"7","author":"Floyd","year":"1964","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(93)90101-E_BIB4","series-title":"Handbook of Algorithms and Data Structures","author":"Gonnet","year":"1991"},{"key":"10.1016\/0020-0190(93)90101-E_BIB5","series-title":"Fundamentals of Data Structure in Pascal","author":"Horowitz","year":"1990"},{"key":"10.1016\/0020-0190(93)90101-E_BIB6","series-title":"The Art of Computer Programming, Vol.I, Fundamental Algorithms","author":"Knuth","year":"1968"},{"key":"10.1016\/0020-0190(93)90101-E_BIB7","article-title":"The Art of Computer Programming","volume":"Vol. III","author":"Knuth","year":"1973"},{"key":"10.1016\/0020-0190(93)90101-E_BIB8","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:002001909390101E?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390101E?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,14]],"date-time":"2021-05-14T22:28:34Z","timestamp":1621031314000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390101E"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":8,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["002001909390101E"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90101-e","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}