{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T05:24:27Z","timestamp":1648617867095},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,11,1]],"date-time":"1993-11-01T00:00:00Z","timestamp":752112000000},"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,11]]},"DOI":"10.1016\/0020-0190(93)90180-h","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T19:38:56Z","timestamp":1034019536000},"page":"73-75","source":"Crossref","is-referenced-by-count":3,"title":["Enumerating k-way trees"],"prefix":"10.1016","volume":"48","author":[{"given":"M.D.","family":"Atkinson","sequence":"first","affiliation":[]},{"given":"Louise","family":"Walker","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90180-H_BIB1","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/2363.2528","article-title":"Proofs as programs","volume":"7","author":"Bates","year":"1985","journal-title":"ACM Trans. Programming Language Systems"},{"key":"10.1016\/0020-0190(93)90180-H_BIB2","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1145\/358234.381162","article-title":"Algorithm design techniques","volume":"27","author":"Bentley","year":"1984","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(93)90180-H_BIB3","series-title":"Formal Development of Programs and Proofs","first-page":"33","article-title":"The maximum segment sum problem","author":"Gries","year":"1990"},{"key":"10.1016\/0020-0190(93)90180-H_BIB4","series-title":"The Art of Computer Programming, Vol. 1: Fundamental Algorithms","author":"Knuth","year":"1973"},{"key":"10.1016\/0020-0190(93)90180-H_BIB5","series-title":"The Art of Computer Programming, Vol. 2: Semi-numerical Algorithms","author":"Knuth","year":"1981"},{"issue":"6","key":"10.1016\/0020-0190(93)90180-H_BIB6","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0020-0190(93)90039-C","article-title":"Counting and randomly generating binary trees","volume":"45","author":"Korsh","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(93)90180-H_BIB7","series-title":"Introduction to Algorithms","author":"Manber","year":"1989"},{"key":"10.1016\/0020-0190(93)90180-H_BIB8","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1090\/S0002-9947-1960-0114765-9","article-title":"Functional composition patterns and power series reversion","volume":"94","author":"Raney","year":"1960","journal-title":"Trans. Amer. Math. Soc."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390180H?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390180H?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T01:52:55Z","timestamp":1554774775000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390180H"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,11]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,11]]}},"alternative-id":["002001909390180H"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90180-h","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,11]]}}}