{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T02:26:45Z","timestamp":1660271205972},"reference-count":4,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,6,1]],"date-time":"1992-06-01T00:00:00Z","timestamp":707356800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7716,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1992,6]]},"DOI":"10.1016\/0304-3975(92)90371-l","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"243-251","source":"Crossref","is-referenced-by-count":6,"title":["Hypothetical analyses: approximate counting in the style of Knuth, path length in the style of Flajolet"],"prefix":"10.1016","volume":"100","author":[{"given":"Helmut","family":"Prodinger","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)90371-L_BIB1","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF01934993","article-title":"Approximate counting: a detailed analysis","volume":"25","author":"Flajolet","year":"1985","journal-title":"BIT"},{"key":"10.1016\/0304-3975(92)90371-L_BIB2","series-title":"Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity","first-page":"431","article-title":"Average-case analysis of algorithms and data structures","author":"Flajolet","year":"1990"},{"key":"10.1016\/0304-3975(92)90371-L_BIB3","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1051\/ita\/1991250100431","article-title":"Approximate counting: an alternative approach","volume":"25","author":"Kirschenhofer","year":"1991","journal-title":"RAIRO Theoretical Informatics"},{"key":"10.1016\/0304-3975(92)90371-L_BIB4","volume":"Vol. 3","author":"Knuth","year":"1973"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290371L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290371L?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:58:36Z","timestamp":1555113516000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759290371L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":4,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["030439759290371L"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90371-l","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}