A flexible way of counting large numbers approximately in small registers

Autor:	A. G. Greenberg, J. B. Kruskal
Rok vydání:	1991
Předmět:	General Computer Science Approximate counting algorithm Simple (abstract algebra) Applied Mathematics Prior probability Theory of computation Large numbers Algorithm Computer Science Applications Mathematics Randomized algorithm
Zdroj:	Algorithmica. 6:590-596
ISSN:	1432-0541 0178-4617
DOI:	10.1007/bf01759062
Popis:	Robert Morris invented a novel, simple probabilistic algorithm for keeping approximate counts of large numbers of events, using small registers. One application is counting the number assigned to each of many categories of a very large number of events. We introduce a new, flexible approach to Morris' method of approximate counting, and provide some analysis of the performance to be expected.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::52caede87ffa41725e7515a10f7fff2a https://doi.org/10.1007/bf01759062 Zobrazit plný text záznamu Full text from SpringerLink