2016/07/05 by Christian Berthet, Berthet, Christian
Computer Science · #Advanced Data Storage Technologies #Algorithms and Data Compression #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Parallel Computing and Optimization Techniques
paper · pdf · doi:10.48550/arxiv.1607.01283
openalex publication_date 2016/07/05 · openalex created_date 2024/04/11 · openalex updated_date 2026/07/28
This short paper gives a detailed proof of identity between two classic formulas for the computation of the exact Miss Rate of LRU caches. An extension to the identity of two formulas of the expected time of a partial collection in the coupon collector problem is also presented.