{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T16:55:37Z","timestamp":1768582537313,"version":"3.49.0"},"reference-count":11,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1986,4,1]],"date-time":"1986-04-01T00:00:00Z","timestamp":512697600000},"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":[[1986,4]]},"DOI":"10.1016\/0020-0190(86)90028-1","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T19:37:33Z","timestamp":1047670653000},"page":"197-200","source":"Crossref","is-referenced-by-count":30,"title":["Deques with heap order"],"prefix":"10.1016","volume":"22","author":[{"given":"Hania","family":"Gajewska","sequence":"first","affiliation":[]},{"given":"Robert E.","family":"Tarjan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(86)90028-1_BIB1","series-title":"Proc. 25th Ann. IEEE Symp. on Foundations of Computer Science","first-page":"65","article-title":"River routing every which way, but loose","author":"Cole","year":"1984"},{"key":"10.1016\/0020-0190(86)90028-1_BIB2","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1145\/357994.358025","article-title":"Optimal pagination of B-trees with variable-length items","volume":"27","author":"Diehr","year":"1984","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(86)90028-1_BIB3","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1145\/321724.321726","article-title":"Real-time simulation of multihead tape units","volume":"19","author":"Fischer","year":"1972","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0020-0190(86)90028-1_BIB4","author":"Hirschberg","year":"1984","journal-title":"New applications of failure functions"},{"key":"10.1016\/0020-0190(86)90028-1_BIB5","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/0020-0190(81)90030-2","article-title":"Real-time queue operations in pure LISP","volume":"13","author":"Hood","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(86)90028-1_BIB6","series-title":"Proc. 11th Ann. ACM Symp. on Theory of Computing","first-page":"346","article-title":"Real-time simulation of concatenatable double-ended queues by double-ended queues","author":"Kosaraju","year":"1979"},{"key":"10.1016\/0020-0190(86)90028-1_BIB7","article-title":"Efficient optimal pagination of scrolls","author":"Larmore","year":"1984"},{"key":"10.1016\/0020-0190(86)90028-1_BIB8","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1145\/322234.322246","article-title":"New real-time simulations of multihead tape units","volume":"28","author":"Leong","year":"1981","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0020-0190(86)90028-1_BIB9","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1145\/359810.359839","article-title":"Pagination of B\u2217-trees with variable-length records","volume":"20","author":"McCreight","year":"1977","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(86)90028-1_BIB10","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970265","article-title":"Data Structures and Network Algorithms","author":"Tarjan","year":"1983"},{"key":"10.1016\/0020-0190(86)90028-1_BIB11","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1137\/0606031","article-title":"Amortized computational complexity","volume":"6","author":"Tarjan","year":"1985","journal-title":"SIAM J. Algebraic Discrete Methods"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086900281?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086900281?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T09:29:16Z","timestamp":1553592556000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019086900281"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,4]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1986,4]]}},"alternative-id":["0020019086900281"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(86)90028-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1986,4]]}}}