{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T23:00:29Z","timestamp":1648594829063},"reference-count":8,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1993,8,1]],"date-time":"1993-08-01T00:00:00Z","timestamp":744163200000},"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 Sciences"],"published-print":{"date-parts":[[1993,8]]},"DOI":"10.1016\/0020-0255(93)90091-y","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T13:28:37Z","timestamp":1056979717000},"page":"207-224","source":"Crossref","is-referenced-by-count":0,"title":["Manipulating multiple stacks with ordered-heap"],"prefix":"10.1016","volume":"72","author":[{"given":"Chien","family":"Been-Chian","sequence":"first","affiliation":[]},{"given":"Yang","family":"Wei-Pang","sequence":"additional","affiliation":[]},{"given":"Chen","family":"Rong-Jaye","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0255(93)90091-Y_BIB1","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1145\/3341.3349","article-title":"Amortized analyses of self-organizing sequential search heuristics","volume":"28","author":"Bentley","year":"1985","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0255(93)90091-Y_BIB2","series-title":"Fundamentals of data structures","author":"Horowitz","year":"1982"},{"key":"10.1016\/0020-0255(93)90091-Y_BIB3","article-title":"The art of computer programming","volume":"Vol. 1","author":"Knuth","year":"1973"},{"key":"10.1016\/0020-0255(93)90091-Y_BIB4","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","article-title":"Amortized efficiency of list update and paging rules","volume":"28","author":"Sleator","year":"1985","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0255(93)90091-Y_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-0255(93)90091-Y_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-0255(93)90091-Y_BIB7","series-title":"Data structures and network algorithms","author":"Tarjan","year":"1983"},{"key":"10.1016\/0020-0255(93)90091-Y_BIB8","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. Alg. Disc. Meth."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002002559390091Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002002559390091Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T09:29:12Z","timestamp":1552901352000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002002559390091Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,8]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,8]]}},"alternative-id":["002002559390091Y"],"URL":"https:\/\/doi.org\/10.1016\/0020-0255(93)90091-y","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1993,8]]}}}