{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T22:02:11Z","timestamp":1648677731744},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1981,6,1]],"date-time":"1981-06-01T00:00:00Z","timestamp":360201600000},"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":["Journal of Algorithms"],"published-print":{"date-parts":[[1981,6]]},"DOI":"10.1016\/0196-6774(81)90018-3","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"178-185","source":"Crossref","is-referenced-by-count":1,"title":["Stacks in a two-level store"],"prefix":"10.1016","volume":"2","author":[{"given":"William H","family":"Burge","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(81)90018-3_BIB1","series-title":"Graph Theory and Computing","first-page":"15","article-title":"The average height of planted plane trees","author":"de Bruijn","year":"1972"},{"key":"10.1016\/0196-6774(81)90018-3_BIB2","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1215\/S0012-7094-64-03136-9","article-title":"Two element lattice permutation numbers and their q-generalization","volume":"31","author":"Carlitz","year":"1964","journal-title":"Duke Math. J."},{"key":"10.1016\/0196-6774(81)90018-3_BIB3","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0012-365X(80)90050-3","article-title":"Combinatorial aspects of continued fractions","volume":"32","author":"Flajolet","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/0196-6774(81)90018-3_BIB4","series-title":"Proceedings; 11th ACM Symposium on Theory of Computing","first-page":"49","article-title":"Computing integrated costs of sequences of operations with application to dictionaries","author":"Flajolet","year":"1979"},{"key":"10.1016\/0196-6774(81)90018-3_BIB5","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0196-6774(80)90020-6","article-title":"Sequences of operations analysis for dynamic data structures","volume":"1","author":"Flajolet","year":"1980","journal-title":"J. Algorithms"},{"key":"10.1016\/0196-6774(81)90018-3_BIB6","unstructured":"P. A. MacMahon, \u201cCombinatory Analysis,\u201d Cambridge Univ. Press, London\/New York, 1915\u20131916."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677481900183?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677481900183?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:52:37Z","timestamp":1548744757000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677481900183"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,6]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1981,6]]}},"alternative-id":["0196677481900183"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(81)90018-3","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1981,6]]}}}