How many random questions are necessary to identify n distinct objects?
- 30 November 1990
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 55 (2) , 292-312
- https://doi.org/10.1016/0097-3165(90)90072-5
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A diffusion limit for a class of randomly-growing binary treesProbability Theory and Related Fields, 1988
- Paths in a random digital tree: limiting distributionsAdvances in Applied Probability, 1986
- Asymptotical Growth of a Class of Random TreesThe Annals of Probability, 1985
- A probabilistic analysis of the height of tries and of the complexity of triesortActa Informatica, 1984
- Analysis of Extendible HashingIEEE Transactions on Software Engineering, 1982
- The Art of Computer Programming, Vol. 3: Sorting and SearchingMathematics of Computation, 1974