A result in order statistics related to probabilistic counting
- 1 March 1993
- journal article
- Published by Springer Nature in Computing
- Vol. 51 (1) , 15-27
- https://doi.org/10.1007/bf02243826
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Probabilistic counting algorithms for data base applicationsPublished by Elsevier ,2003
- How to count quickly and accurately: A unified analysis of probabilistic counting and other related problemsPublished by Springer Nature ,1992
- On some applications of formulae of Ramanujan in the analysis of algorithmsMathematika, 1991
- Yet another application of a binomial recurrence order statisticsComputing, 1990
- Singularity Analysis of Generating FunctionsSIAM Journal on Discrete Mathematics, 1990
- On the analysis of probabilistic countingPublished by Springer Nature ,1990
- Über Längste 1-Teilfolgen In 0-1-FolgenPublished by Springer Nature ,1987
- Digital Search Trees RevisitedSIAM Journal on Computing, 1986
- Some Uses of the Mellin Integral Transform in the Analysis of AlgorithmsPublished by Springer Nature ,1985