@article{dmtcs:3360,
    title      = {Near optimality of the discrete persistent access caching algorithm},
    author     = {Predrag R. Jelenković and Xiaozhu Kang and Ana Radovanović},
    url        = {https://dmtcs.episciences.org/3360},
    doi        = {10.46298/dmtcs.3360},
    journal    = {Discrete Mathematics \& Theoretical Computer Science},
    issn       = {1365-8050},
    volume     = {DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms},
    issuetitle = {Proceedings},
    eid        = 9,
    year       = {2005},
    month      = {Jan},
    keywords   = {average-case analysis, cache fault probability, Web caching, heavy-tailed distributions, generalized Zipf's law distributions, move-to-front searching, persistent-access-caching, least-recently-used caching, least-frequently-used caching, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC]},
    language   = {English},
}