{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:23:10Z","timestamp":1759332190469},"reference-count":8,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1991,3,1]],"date-time":"1991-03-01T00:00:00Z","timestamp":667785600000},"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":[[1991,3]]},"DOI":"10.1016\/0020-0190(91)90218-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"265-271","source":"Crossref","is-referenced-by-count":8,"title":["The derivation of a tighter bound for top-down skew heaps"],"prefix":"10.1016","volume":"37","author":[{"given":"Anne","family":"Kaldewaij","sequence":"first","affiliation":[]},{"given":"Berry","family":"Schoenmakers","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(91)90218-7_BIB1","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(91)90218-7_BIB2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0020-0190(89)90101-4","article-title":"A tight amortized bound for path reversal","volume":"31","author":"Ginat","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(91)90218-7_BIB3","series-title":"The Science of Computer Programming","author":"Gries","year":"1981"},{"key":"10.1016\/0020-0190(91)90218-7_BIB4","series-title":"Computing Science Notes","article-title":"Algebra refinement and amortized complexity in a functional setting","author":"Schoenmakers","year":"1990"},{"key":"10.1016\/0020-0190(91)90218-7_BIB5","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1145\/3828.3835","article-title":"Self-adjusting binary search trees","volume":"32","author":"Sleator","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(91)90218-7_BIB6","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\/0020-0190(91)90218-7_BIB7","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"},{"key":"10.1016\/0020-0190(91)90218-7_BIB8","first-page":"546","article-title":"Linear types can change the world!","author":"Wadler","year":"1990","journal-title":"Proc. IFIP-TC 2 Working Conference on Programming Concepts and Methods"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019091902187?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019091902187?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:23:49Z","timestamp":1555143829000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019091902187"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,3]]},"references-count":8,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1991,3]]}},"alternative-id":["0020019091902187"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(91)90218-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1991,3]]}}}