A result in order statistics related to probabilistic counting

DOI10.1007/BF02243826zbMath0782.60021OpenAlexW1588338214MaRDI QIDQ1308501

Peter Kirschenhofer, Prodinger, Helmut

Publication date: 4 January 1994

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02243826

zbMATH Keywords

order statisticsasymptotic analysisprobabilistic counting algorithms

Mathematics Subject Classification ID

Order statistics; empirical distribution functions (62G30) Combinatorial probability (60C05) Distribution theory (60E99)

Related Items

A Statistical Analysis of Probabilistic Counting Algorithms, The number of distinct values in a geometrically distributed sample, A note on efficient aggregate queries in sensor networks, Combinatorics of geometrically distributed random variables: Left-to-right maxima, Combinatorics of geometrically distributed random variables: Run statistics, Consecutive records in geometrically distributed words, Empire of colonies: Self-stabilizing and self-organizing distributed algorithm, The average position of the \(d\)th maximum in a sample of geometric random variables, The number of winners in a discrete geometrically distributed sample, Descents following maximal values in samples of geometric random variables

Cites Work

• Probabilistic counting algorithms for data base applications
• Yet another application of a binomial recurrence. Order statistics
• Singularity Analysis of Generating Functions
• Digital Search Trees Revisited
• On some applications of formulae of Ramanujan in the analysis of algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item