Birthday paradox, coupon collectors, caching algorithms and self-organizing search
- 1 November 1992
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 39 (3) , 207-229
- https://doi.org/10.1016/0166-218x(92)90177-c
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Une approche quantitative de l'exclusion mutuelleRAIRO - Theoretical Informatics and Applications, 1986
- Optimal prepaging and font cachingACM Transactions on Programming Languages and Systems, 1985
- Exegesis of Self-Organizing Linear SearchSIAM Journal on Computing, 1981
- An improved Monte Carlo factorization algorithmBIT Numerical Mathematics, 1980
- Heuristics That Dynamically Organize Data StructuresSIAM Journal on Computing, 1979
- Efficient Calculation of Expected Miss Ratios in the Independent Reference ModelSIAM Journal on Computing, 1978
- Asymptotic miss ratios over independent referencesJournal of Computer and System Sciences, 1977
- Some Results on Distribution-Free Analysis of Paging AlgorithmsIEEE Transactions on Computers, 1976
- A Unified Approach to the Evaluation of a Class of Replacement AlgorithmsIEEE Transactions on Computers, 1973
- Extensions of the birthday surpriseJournal of Combinatorial Theory, 1967