{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T06:25:59Z","timestamp":1648794359187},"reference-count":12,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"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":[[1997,3]]},"DOI":"10.1016\/s0020-0190(97)00028-8","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:36:00Z","timestamp":1051115760000},"page":"279-284","source":"Crossref","is-referenced-by-count":1,"title":["A tight lower bound for top-down skew heaps"],"prefix":"10.1016","volume":"61","author":[{"given":"Berry","family":"Schoenmakers","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(97)00028-8_BIB1","series-title":"Complexity of Computer Computations","first-page":"153","article-title":"Efficiency of equivalence algorithms","author":"Fischer","year":"1972"},{"key":"10.1016\/S0020-0190(97)00028-8_BIB2","series-title":"G\u00f6del, Escher, Bach: an Eternal Golden Braid","author":"Hofstadter","year":"1979"},{"key":"10.1016\/S0020-0190(97)00028-8_BIB3","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1145\/63238.63249","article-title":"Concurrent operations on priority queues","volume":"32","author":"Jones","year":"1989","journal-title":"Comm. ACM"},{"key":"10.1016\/S0020-0190(97)00028-8_BIB4","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0020-0190(91)90218-7","article-title":"The derivation of a tighter bound for top-down skew heaps","volume":"37","author":"Kaldewaij","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(97)00028-8_BIB5","article-title":"Sorting and Searching","volume":"Vol. 3","author":"Knuth","year":"1975"},{"key":"10.1016\/S0020-0190(97)00028-8_BIB6","series-title":"Proc. ACM SIGPLAN International Conference on Functional Programming","first-page":"646","article-title":"The role of lazy evaluation in amortized data structures","author":"Okasaki","year":"1995"},{"key":"10.1016\/S0020-0190(97)00028-8_BIB7","series-title":"Proc. IEEE Symposium on Foundations of Computer Science","first-page":"62","article-title":"Amortization, lazy evaluation, and persistence: Lists with catenation via lazy linking","author":"Okasaki","year":"1996"},{"key":"10.1016\/S0020-0190(97)00028-8_BIB8","article-title":"Data Structures and Amortized Complexity in a Functional Setting","author":"Schoenmakers","year":"1992"},{"key":"10.1016\/S0020-0190(97)00028-8_BIB9","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1137\/0215004","article-title":"Self-adjusting heaps","volume":"15","author":"Sleator","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(97)00028-8_BIB10","series-title":"The Encyclopedia of Integer Sequences","author":"Sloane","year":"1995"},{"key":"10.1016\/S0020-0190(97)00028-8_BIB11","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","article-title":"Efficiency of a good but not linear set union algorithm","volume":"22","author":"Tarjan","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(97)00028-8_BIB12","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1145\/62.2160","article-title":"Worst-case analysis of set union algorithms","volume":"31","author":"Tarjan","year":"1984","journal-title":"J. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097000288?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097000288?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T18:25:26Z","timestamp":1556043926000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097000288"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":12,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["S0020019097000288"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00028-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}