{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:31:14Z","timestamp":1759332674823},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"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,1]]},"DOI":"10.1016\/0020-0190(93)90249-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"41-50","source":"Crossref","is-referenced-by-count":7,"title":["A systematic analysis of splaying"],"prefix":"10.1016","volume":"45","author":[{"given":"Berry","family":"Schoenmakers","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90249-9_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(93)90249-9_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."},{"issue":"5","key":"10.1016\/0020-0190(93)90249-9_BIB3","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\/0020-0190(93)90249-9_BIB4","series-title":"Ph.D. Thesis","article-title":"Data structures and amortized complexity in a functional setting","author":"Schoenmakers","year":"1992"},{"key":"10.1016\/0020-0190(93)90249-9_BIB5","doi-asserted-by":"crossref","first-page":"653","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(93)90249-9_BIB6","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:0020019093902499?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019093902499?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:25:58Z","timestamp":1555143958000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019093902499"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,1]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,1]]}},"alternative-id":["0020019093902499"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90249-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,1]]}}}