On the public citation graph
A Unified Analysis of Paging and Caching
0 signed · 79 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.1007/bf01759073openalex-snapshot
A strongly competitive randomized paging algorithm
inferredcites →https://doi.org/10.1007/pl00009158openalex-snapshot
On the Influence of Lookahead in Competitive Paging Algorithms
inferredcites →https://doi.org/10.1016/0196-6774(90)90003-wopenalex-snapshot
Competitive algorithms for server problems
inferredcites →https://doi.org/10.1016/0196-6774(91)90041-vopenalex-snapshot
Competitive paging algorithms
inferredcites →https://doi.org/10.1109/sfcs.1987.31openalex-snapshot
Hierarchical memory with block transfer
inferredcites →https://doi.org/10.1109/sfcs.1994.365674openalex-snapshot
IP over connection-oriented networks and distributional paging
inferredcites →https://doi.org/10.1109/sfcs.1995.492476openalex-snapshot
A unified analysis of paging and caching
inferredcites →https://doi.org/10.1109/tse.1980.230464openalex-snapshot
Working Sets Past and Present
inferredcites →https://doi.org/10.1137/s0097539792236353openalex-snapshot
Strongly Competitive Algorithms for Paging with Locality of Reference
inferredcites →https://doi.org/10.1137/s0097539796299540openalex-snapshot
Beyond Competitive Analysis
inferredcites →https://doi.org/10.1145/103418.103422openalex-snapshot
Competitive paging with locality of reference
inferredcites →https://doi.org/10.1145/225058.225280openalex-snapshot
Randomized and multipointer paging with locality of reference
inferredcites →https://doi.org/10.1145/2786.2793openalex-snapshot
Amortized efficiency of list update and paging rules
inferredcites →https://doi.org/10.1145/357980.357997openalex-snapshot
The working set model for program behavior
inferredcites →https://doi.org/10.1147/rd.386.0683openalex-snapshot
Memory versus randomization in on-line algorithms
inferredcites →https://doi.org/10.1147/sj.52.0078openalex-snapshot
A study of replacement algorithms for a virtual-storage computer
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781118136607.ch3openalex-snapshot
Real‐Time Operating Systems
inferred← citeshttps://doi.org/10.1007/3-540-48447-7_9openalex-snapshot
The Accomodating Function — A Generalization of the Competitive Ratio
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_9openalex-snapshot
On List Update with Locality of Reference
inferred← citeshttps://doi.org/10.1007/978-3-540-77566-9_21openalex-snapshot
How Much Information about the Future Is Needed?
inferred← citeshttps://doi.org/10.1007/978-3-540-77891-2_19openalex-snapshot
On Certain New Models for Paging with Locality of Reference
inferred← citeshttps://doi.org/10.1007/978-3-540-77891-2_2openalex-snapshot
Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_35openalex-snapshot
List Update with Locality of Reference
inferred← citeshttps://doi.org/10.1007/978-3-642-12450-1_10openalex-snapshot
Parameterized Analysis of Paging and List Update Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-20009-0_102openalex-snapshot
Online Optimization: Probabilistic Analysis and Algorithm Engineering
inferred← citeshttps://doi.org/10.1007/978-3-642-38016-7_13openalex-snapshot
Minimizing Cache Usage in Paging
inferred← citeshttps://doi.org/10.1007/978-3-642-40273-9_17openalex-snapshot
A Survey of Algorithms and Models for List Update
inferred← citeshttps://doi.org/10.1007/s00450-011-0149-1openalex-snapshot
Probabilistic alternatives for competitive analysis
inferred← citeshttps://doi.org/10.1007/s00450-011-0152-6openalex-snapshot
Adversarial models in paging
inferred← citeshttps://doi.org/10.1007/s00453-013-9800-5openalex-snapshot
Parameterized Analysis of Paging and List Update Algorithms
inferred← citeshttps://doi.org/10.1007/s00453-018-0461-2openalex-snapshot
On the Separation and Equivalence of Paging Strategies and Other Online Algorithms
inferred← citeshttps://doi.org/10.1007/s10107-003-0436-0openalex-snapshot
Online algorithms: a survey
inferred← citeshttps://doi.org/10.1016/j.ejor.2006.01.049openalex-snapshot
Fixed interval scheduling: Models, applications, computational complexity and algorithms
inferred← citeshttps://doi.org/10.1016/j.jcss.2004.08.002openalex-snapshot
On paging with locality of reference
inferred← citeshttps://doi.org/10.1016/j.jcss.2007.03.001openalex-snapshot
The relative worst-order ratio applied to paging
inferred← citeshttps://doi.org/10.1016/j.jcss.2015.11.005openalex-snapshot
On list update with locality of reference
inferred← citeshttps://doi.org/10.1016/j.omega.2015.10.009openalex-snapshot
A general modeling approach to online optimization with lookahead
inferred← citeshttps://doi.org/10.1016/j.peva.2005.01.007openalex-snapshot
A page fault equation for modeling the effect of memory size
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.04.023openalex-snapshot
On the relative dominance of paging algorithms
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.11.035openalex-snapshot
Relative interval analysis of paging algorithms on access graphs
inferred← citeshttps://doi.org/10.1016/s0166-5316(02)00226-2openalex-snapshot
The EELRU adaptive replacement algorithm
inferred← citeshttps://doi.org/10.1016/s0196-6774(02)00291-2openalex-snapshot
Interval selection: Applications, algorithms, and lower bounds
inferred← citeshttps://doi.org/10.1051/ita/2009012openalex-snapshot
Measuring the problem-relevant information in input
inferred← citeshttps://doi.org/10.1109/focs.2008.46openalex-snapshot
The Power of Reordering for Online Minimum Makespan Scheduling
inferred← citeshttps://doi.org/10.1109/icetas.2018.8629111openalex-snapshot
Disparity between Theory & Practice: Beyond the Worst-Case Competitive Analysis
inferred← citeshttps://doi.org/10.1109/icons.2010.34openalex-snapshot
Observation Mechanism and Cost Model for Tightly Coupled Asymmetric Concurrency
inferred← citeshttps://doi.org/10.1137/1.9781611973068.123openalex-snapshot
Paging and List Update under Bijective Analysis
inferred← citeshttps://doi.org/10.1137/130919738openalex-snapshot
The Power of Reordering for Online Minimum Makespan Scheduling
inferred← citeshttps://doi.org/10.1137/s0097539799361786openalex-snapshot
The Accommodating Function: A Generalization of the Competitive Ratio
inferred← citeshttps://doi.org/10.1145/1551609.1551642openalex-snapshot
The quest for scalable support of data-intensive workloads in distributed systems
inferred← citeshttps://doi.org/10.1145/1711475.1711499openalex-snapshot
Introduction to the SIGACT news online algorithms column
inferred← citeshttps://doi.org/10.1145/1711475.1714372openalex-snapshot
On Developing New Models, with Paging as a Case Study
inferred← citeshttps://doi.org/10.1145/2090236.2090246openalex-snapshot
Paging for multi-core shared caches
inferred← citeshttps://doi.org/10.1145/2450142.2450143openalex-snapshot
Paging and list update under bijective analysis
inferred← citeshttps://doi.org/10.1145/3350755.3400231openalex-snapshot
Green Paging and Parallel Paging
inferred← citeshttps://doi.org/10.1145/509907.509949openalex-snapshot
On paging with locality of reference
inferred← citeshttps://doi.org/10.1145/564870.564876openalex-snapshot
Distributed caching independent of the network size
inferred← citeshttps://doi.org/10.17877/de290r-23openalex-snapshot
Zur Analyse von randomisierten Suchheuristiken und Online-Heuristiken
inferred← citeshttps://doi.org/10.26634/jse.11.3.13633openalex-snapshot
A Fast Algorithm For The Weighted Interval Scheduling Problem
inferred← citeshttps://doi.org/10.4018/978-1-61520-971-2.ch002openalex-snapshot
Towards Data Intensive Many-Task Computing
inferred← citeshttps://doi.org/10.4230/dagsemproc.06421.4openalex-snapshot
Adaptive Analysis of On-line Algorithms
inferred← citeshttps://doi.org/10.5555/1070432.1070534openalex-snapshot
The relative worst order ratio applied to paging
inferred← citeshttps://doi.org/10.5555/1283383.1283408openalex-snapshot
On the separation and equivalence of paging strategies
inferred← citeshttps://doi.org/10.5555/1496770.1496893openalex-snapshot
Paging and list update under bijective analysis
inferred← citeshttps://doi.org/10.5555/644108.644202openalex-snapshot
Online paging with arbitrary associativity
inferred← citeshttps://doi.org/10.7146/brics.v2i50.19951openalex-snapshot
On Competitive On-Line Paging with Lookahead
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.