On the public citation graph

Competitive analysis of paging

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.

Claim with ORCID

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.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-57273-2_39openalex-snapshot

The influence of lookahead in competitive paging algorithms

inferredcites →https://doi.org/10.1007/3-540-60922-9_48openalex-snapshot

On competitive on-line paging with lookahead

inferredcites →https://doi.org/10.1007/3-540-61680-2_72openalex-snapshot

Competitive analysis of randomized paging algorithms

inferredcites →https://doi.org/10.1007/bf01759073openalex-snapshot

A strongly competitive randomized paging algorithm

inferredcites →https://doi.org/10.1007/bf01762111openalex-snapshot

Competitive snoopy caching

inferredcites →https://doi.org/10.1007/bfb0035792openalex-snapshot

Memory versus randomization in on-line algorithms

inferredcites →https://doi.org/10.1007/pl00009158openalex-snapshot

On the Influence of Lookahead in Competitive Paging Algorithms

inferredcites →https://doi.org/10.1016/0016-0032(58)90688-4openalex-snapshot

An introduction to probability theory and its applications

inferredcites →https://doi.org/10.1016/0196-6774(91)90041-vopenalex-snapshot

Competitive paging algorithms

inferredcites →https://doi.org/10.1109/sfcs.1992.267771openalex-snapshot

Markov paging

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.1994.365677openalex-snapshot

Beyond competitive analysis [on-line algorithms]

inferredcites →https://doi.org/10.1109/sfcs.1995.492476openalex-snapshot

A unified analysis of paging and caching

inferredcites →https://doi.org/10.1109/sfcs.1995.492477openalex-snapshot

Application-controlled paging for a shared cache

inferredcites →https://doi.org/10.1109/sfcs.1997.646121openalex-snapshot

Truly online paging with locality of reference

inferredcites →https://doi.org/10.1137/0404017openalex-snapshot

New Ressults on Server Problems

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.1137/s0097539797324278openalex-snapshot

Application-Controlled Paging for a Shared Cache

inferredcites →https://doi.org/10.1145/100216.100268openalex-snapshot

On the power of randomization in online algorithms

inferredcites →https://doi.org/10.1145/103418.103422openalex-snapshot

Competitive paging with locality of reference

inferredcites →https://doi.org/10.1145/258533.258666openalex-snapshot

Page replacement with multi-size pages and applications to Web caching

inferredcites →https://doi.org/10.1145/2786.2793openalex-snapshot

Amortized efficiency of list update and paging rules

inferredcites →https://doi.org/10.1145/28395.28435openalex-snapshot

An optimal online algorithm for metrical task systems

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.48550/arxiv.cs/0205044openalex-snapshot

The K-Server Dual and Loose Competitiveness for Paging

inferredcites →https://doi.org/10.5555/314161.314182openalex-snapshot

Experimental studies of access graph based heuristics: beating the LRU standard?

inferredcites →https://doi.org/10.5555/314161.314185openalex-snapshot

The k-client problem

inferredcites →https://doi.org/10.5555/314613.314655openalex-snapshot

LRU is better than FIFO

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11527954_19openalex-snapshot

Algorithmic Foundations of the Internet: Roundup

inferred← citeshttps://doi.org/10.1007/11785293_14openalex-snapshot

Paging with Request Sets

inferred← citeshttps://doi.org/10.1007/3-540-36574-5openalex-snapshot

Algorithms for Memory Hierarchies

inferred← citeshttps://doi.org/10.1007/3-540-44676-1_8openalex-snapshot

Buying a Constant Competitive Ratio for Paging

inferred← citeshttps://doi.org/10.1007/978-3-540-24618-3_8openalex-snapshot

Algorithms for Scalable Storage Servers

inferred← citeshttps://doi.org/10.1007/978-3-540-30501-9_106openalex-snapshot

Dynamically Selecting Distribution Strategies for Web Documents According to Access Pattern

inferred← citeshttps://doi.org/10.1007/978-3-540-72914-3_13openalex-snapshot

The Worst Page-Replacement Policy

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/s00224-007-9029-2openalex-snapshot

Paging with Request Sets

inferred← citeshttps://doi.org/10.1007/s00224-008-9114-1openalex-snapshot

The Worst Page-Replacement Policy

inferred← citeshttps://doi.org/10.1007/s00607-007-0230-6openalex-snapshot

Calculating lower bounds for caching problems

inferred← citeshttps://doi.org/10.1016/j.tcs.2004.05.018openalex-snapshot

Competitive caching of query results in search engines

inferred← citeshttps://doi.org/10.1109/ispan.2002.1004257openalex-snapshot

An overview of data replication on the Internet

inferred← citeshttps://doi.org/10.1109/tc.2012.33openalex-snapshot

mRT-PLRU: A General Framework for Real-Time Multitask Executions on NAND Flash Memory

inferred← citeshttps://doi.org/10.1145/1007912.1007948openalex-snapshot

Effectively sharing a cache among threads

inferred← citeshttps://doi.org/10.1145/1027914.1027930openalex-snapshot

SIGACT news online algorithms column 4

inferred← citeshttps://doi.org/10.1145/1067309.1067322openalex-snapshot

Algorithmic foundations of the internet

inferred← citeshttps://doi.org/10.1145/1086649.1086670openalex-snapshot

SIGACT news online algorithms column 8

inferred← citeshttps://doi.org/10.1145/1620491.1620508openalex-snapshot

SIGACT news online algorithms column 14

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/1753171.1753194openalex-snapshot

SIGACT news online algorithms column 16

inferred← citeshttps://doi.org/10.1145/1907450.1907547openalex-snapshot

SIGACT news online algorithms column 17

inferred← citeshttps://doi.org/10.1145/1998037.1998057openalex-snapshot

SIGACT news online algorithms column 19

inferred← citeshttps://doi.org/10.1145/954092.954104openalex-snapshot

SIGACT news online algorithms column 1

inferred← citeshttps://doi.org/10.1287/trsc.1030.0066openalex-snapshot

Dispatching of an Electric Monorail System: Applying Metaheuristics to an Online Pickup and Delivery Problem

inferred← citeshttps://doi.org/10.70675/9976a622z13e6z4feaz8d69zbb5172afa95aopenalex-snapshot

Performance guaranteeing algorithms for solving online decision problems in financial systems

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.