How many random questions are necessary to identify n distinct objects?

Authors:
B. Pittel;H. Rubin
Affiliations:
-;-
Venue:
Journal of Combinatorial Theory Series A
Year:
1990

Citing 0
Cited 3

Laws of large numbers and tail inequalities for random tries and PATRICIA trees

Journal of Computational and Applied Mathematics - Special issue: Probabilistic methods in combinatorics and combinatorial optimization
Limit laws for the height in PATRICIA tries

Journal of Algorithms - Analysis of algorithms
Informed content delivery across adaptive overlay networks

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract