On the public citation graph
Efficient Calculation of Expected Miss Ratios in the Independent Reference Model
0 signed · 56 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/s0022-0000(77)80014-7openalex-snapshot
Asymptotic miss ratios over independent references
inferredcites →https://doi.org/10.1037/h0052803openalex-snapshot
Human behavior and the principle of least effort.
inferredcites →https://doi.org/10.1109/c-m.1976.218434openalex-snapshot
Empirical Data Reference Behavior in Data Base Systems
inferredcites →https://doi.org/10.1109/tc.1973.5009115openalex-snapshot
A Unified Approach to the Evaluation of a Class of Replacement Algorithms
inferredcites →https://doi.org/10.1109/tc.1976.1674682openalex-snapshot
Some Results on Distribution-Free Analysis of Paging Algorithms
inferredcites →https://doi.org/10.1145/1479992.1480078openalex-snapshot
Experiments with program locality
inferredcites →https://doi.org/10.1145/321623.321632openalex-snapshot
Principles of Optimal Page Replacement
inferredcites →https://doi.org/10.1145/321784.321790openalex-snapshot
On the Optimality of the Probability Ranking Scheme in Storage Applications
inferredcites →https://doi.org/10.1145/321796.321800openalex-snapshot
Some Distribution-Free Aspects of Paging Algorithm Performance
inferredcites →https://doi.org/10.1145/321921.321935openalex-snapshot
The independence of miss ratio on page size
inferredcites →https://doi.org/10.1145/359997.360012openalex-snapshot
A counterintuitive example of computer paging
inferredcites →https://doi.org/10.1145/360051.360227openalex-snapshot
Characteristics of program localities
inferredcites →https://doi.org/10.1145/360051.360231openalex-snapshot
MIN—an optimal variable-space page replacement algorithm
inferredcites →https://doi.org/10.1145/361268.361281openalex-snapshot
Properties of the working-set model
inferredcites →https://doi.org/10.1145/361532.361554openalex-snapshot
A model of memory contention in a paging machine
inferredcites →https://doi.org/10.1147/rd.172.0086openalex-snapshot
Empirically Derived Micromodels for Sequences of Page Exceptions
inferredcites →https://doi.org/10.1147/rd.196.0550openalex-snapshot
Model for Interactive Data Base Reference String
inferredcites →https://doi.org/10.1147/sj.52.0078openalex-snapshot
A study of replacement algorithms for a virtual-storage computer
inferredcites →https://doi.org/10.1147/sj.92.0078openalex-snapshot
Evaluation techniques for storage hierarchies
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_120openalex-snapshot
Random allocations and probabilistic languages
inferred← citeshttps://doi.org/10.1007/s00778-020-00605-wopenalex-snapshot
Architecture of a distributed storage that combines file system, memory and computation in a single layer
inferred← citeshttps://doi.org/10.1007/s11134-016-9487-9openalex-snapshot
Transient and steady-state regime of a family of list-based cache replacement algorithms
inferred← citeshttps://doi.org/10.1007/s11390-014-1460-7openalex-snapshot
Performance Metrics and Models for Shared Cache
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90177-copenalex-snapshot
Birthday paradox, coupon collectors, caching algorithms and self-organizing search
inferred← citeshttps://doi.org/10.1016/0196-6774(90)90002-vopenalex-snapshot
Generating random combinatorial objects
inferred← citeshttps://doi.org/10.1016/j.comnet.2023.109583openalex-snapshot
An overview of analysis methods and evaluation results for caching strategies
inferred← citeshttps://doi.org/10.1016/j.peva.2014.07.001openalex-snapshot
Exact analysis of TTL cache networks
inferred← citeshttps://doi.org/10.1017/9781316771655.013openalex-snapshot
Physical Layer Caching with Limited Backhaul in 5G Systems
inferred← citeshttps://doi.org/10.1017/s0269964800005192openalex-snapshot
The Move-to-Front Rule: A Case Study for two Perfect Sampling Algorithms
inferred← citeshttps://doi.org/10.1049/el:20000015openalex-snapshot
Analytical prediction of buffer hit ratios
inferred← citeshttps://doi.org/10.1109/icc.2016.7511521openalex-snapshot
Tradeoff between PHY caching and core network caching in cellular networks
inferred← citeshttps://doi.org/10.1109/indo-taiwanican48429.2020.9181363openalex-snapshot
Handover-Supporting Streamlined Networking
inferred← citeshttps://doi.org/10.1109/infcom.1989.101468openalex-snapshot
Analysis of a class of distributed directory algorithms
inferred← citeshttps://doi.org/10.1109/infocom.2018.8485894openalex-snapshot
Analyzing Replacement Policies in List-Based Caches with Non-Uniform Access Costs
inferred← citeshttps://doi.org/10.1109/istc.2016.7593134openalex-snapshot
Performance of spatial Multi-LRU caching under traffic with temporal locality
inferred← citeshttps://doi.org/10.1109/tmc.2006.160openalex-snapshot
Cost-Effective Caching for Mobility Support in IEEE 802.1X Frameworks
inferred← citeshttps://doi.org/10.1109/tnet.2020.3042869openalex-snapshot
Performance Analysis Methods for List-Based Caches With Non-Uniform Access
inferred← citeshttps://doi.org/10.1109/tnet.2024.3420758openalex-snapshot
Minimizing Edge Caching Service Costs Through Regret-Optimal Online Learning
inferred← citeshttps://doi.org/10.1137/0209009openalex-snapshot
An Efficient Method for Weighted Sampling without Replacement
inferred← citeshttps://doi.org/10.1145/2645710.2645752openalex-snapshot
On over-specialization and concentration bias of recommendations
inferred← citeshttps://doi.org/10.1145/2745844.2745850openalex-snapshot
Transient and Steady-state Regime of a Family of List-based Cache Replacement Algorithms
inferred← citeshttps://doi.org/10.1145/2796314.2745850openalex-snapshot
Transient and Steady-state Regime of a Family of List-based Cache Replacement Algorithms
inferred← citeshttps://doi.org/10.1145/3155335openalex-snapshot
A Product-Form Model for the Performance Evaluation of a Bandwidth Allocation Strategy in WSNs
inferred← citeshttps://doi.org/10.1145/3488423.3519332openalex-snapshot
Online Working Set Change Detection with Constant Complexity
inferred← citeshttps://doi.org/10.1145/775406.775409openalex-snapshot
Bibliography on paging and related topics
inferred← citeshttps://doi.org/10.3390/fi15030091openalex-snapshot
Scope and Accuracy of Analytic and Approximate Results for FIFO, Clock-Based and LRU Caching Performance
inferred← citeshttps://doi.org/10.4108/eai.14-12-2015.2262651openalex-snapshot
Priority-based bandwidth allocation in wireless sensor networks
inferred← citeshttps://doi.org/10.4108/icst.valuetools.2013.254387openalex-snapshot
Performance of a cache with Random Replacement and Zipf document popularity
inferred← citeshttps://doi.org/10.48550/arxiv.1612.04363openalex-snapshot
Spatial multi-LRU: Distributed Caching for Wireless Networks with Coverage Overlaps
inferred← citeshttps://doi.org/10.48550/arxiv.1704.04146openalex-snapshot
Traffic Minimizing Caching and Latent Variable Distributions of Order Statistics
inferred← citeshttps://doi.org/10.48550/arxiv.1705.10738openalex-snapshot
Approximation of LRU Caches Miss Rate: Application to Power-law Popularities
inferred← citeshttps://doi.org/10.48550/arxiv.1808.06094openalex-snapshot
Pangea: Monolithic Distributed Storage for Data Analytics
inferred← citeshttps://doi.org/10.70675/071ed8e5z0e64z441fzae76z3eecedbd478eopenalex-snapshot
Design and Evaluation of Enhanced Network Caching Systems to Improve Content Delivery in the Internet
inferred← citeshttps://doi.org/10.70675/22df45fez9e22z46d7za2bezcd089d116a61openalex-snapshot
On models for performance analysis of a core cache network and power save of a wireless access network
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.