{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T16:33:00Z","timestamp":1693845180182},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"1-6","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1991,6]]},"DOI":"10.1007\/bf01759062","type":"journal-article","created":{"date-parts":[[2005,6,16]],"date-time":"2005-06-16T10:43:56Z","timestamp":1118918636000},"page":"590-596","source":"Crossref","is-referenced-by-count":3,"title":["A flexible way of counting large numbers approximately in small registers"],"prefix":"10.1007","volume":"6","author":[{"given":"J. B.","family":"Kruskal","sequence":"first","affiliation":[]},{"given":"A. G.","family":"Greenberg","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01759062_CR1","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF01934993","volume":"25","author":"P. Flajolet","year":"1984","unstructured":"Flajolet, P., Approximate counting: a detailed analysis,BIT,25 (1984), 113\u2013134.","journal-title":"BIT"},{"key":"BF01759062_CR2","doi-asserted-by":"crossref","unstructured":"Flajolet, P., and Martin, G. N., Probabilistic counting,Proceedings of the 24th Annual Symposium on Foundations of Computer Science, November 1983, pp. 76\u201382.","DOI":"10.1109\/SFCS.1983.46"},{"key":"BF01759062_CR3","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/0022-0000(85)90041-8","volume":"31","author":"P. Flajolet","year":"1985","unstructured":"Flajolet, P., and Martin, G. N., Probabilistic counting algorithms for data base applications,Journal of Computer and System Sciences,31 (1985), 182\u2013209.","journal-title":"Journal of Computer and System Sciences"},{"key":"BF01759062_CR4","first-page":"356","volume-title":"Lecture Notes in Computer Science, vol. 194","author":"T. Kurtz","year":"1985","unstructured":"Kurtz, T., and Manber, U., A probabilistic distributed algorithm for set intersection and its analysis,Proceedings of the International Colloquium on Automata Languages and Programming (ICALP85), Nafplion, Greece, Lecture Notes in Computer Science, vol. 194, Springer-Verlag, Berlin, July 1985, pp. 356\u2013362."},{"key":"BF01759062_CR5","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1145\/359619.359627","volume":"21","author":"R. Morris","year":"1976","unstructured":"Morris, R., Counting large numbers of events in small registers,Communications of the ACM,21 (1976), 840\u2013842.","journal-title":"Communications of the ACM"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01759062.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01759062\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01759062","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T16:25:43Z","timestamp":1557332743000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01759062"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":5,"journal-issue":{"issue":"1-6","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["BF01759062"],"URL":"https:\/\/doi.org\/10.1007\/bf01759062","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}