On the public citation graph

Distributed paging

https://doi.org/10.1007/bfb0029566
0 signed · 35 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-58218-5_3openalex-snapshot
New on-line algorithms for the page replication problem
inferredcites →https://doi.org/10.1007/3-540-60220-8_58openalex-snapshot
Page migration with limited local memory capacity
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/bfb0049409openalex-snapshot
On-line distributed data management
inferredcites →https://doi.org/10.1090/dimacs/007/10openalex-snapshot
Randomized algorithms for multiprocessor page migration
inferredcites →https://doi.org/10.1109/fscs.1990.89571openalex-snapshot
Sparse partitions
inferredcites →https://doi.org/10.1109/sfcs.1992.267756openalex-snapshot
The distributed k-server problem-a competitive distributed translator for k-server algorithms
inferredcites →https://doi.org/10.1109/sfcs.1993.366885openalex-snapshot
Heat and Dump: competitive distributed paging
inferredcites →https://doi.org/10.1109/sfcs.1995.492570openalex-snapshot
Competitive access time via dynamic storage rearrangement
inferredcites →https://doi.org/10.1109/sfcs.1996.548477openalex-snapshot
Probabilistic approximation of metric spaces and its algorithmic applications
inferredcites →https://doi.org/10.1137/0404033openalex-snapshot
Dynamic Steiner Tree Problem
inferredcites →https://doi.org/10.1145/129712.129717openalex-snapshot
Competitive algorithms for distributed data management (extended abstract)
inferredcites →https://doi.org/10.1145/129712.129768openalex-snapshot
Competitive distributed job scheduling (extended abstract)
inferredcites →https://doi.org/10.1145/167088.167142openalex-snapshot
Competitive distributed file allocation
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.1145/356876.356883openalex-snapshot
Comparative Models of the File Assignment Problem
inferredcites →https://doi.org/10.1145/62212.62243openalex-snapshot
Competitive algorithms for on-line problems
inferredcites →https://doi.org/10.1145/75577.75583openalex-snapshot
Dynamic file migration in distributed computer systems
inferredcites →https://doi.org/10.1184/r1/6604253openalex-snapshot
Competitive algorithms for replication and migration problems

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11508380_71openalex-snapshot
The Grid Block Device: Performance in LAN and WAN Environments
inferred← citeshttps://doi.org/10.1007/11549345_1openalex-snapshot
Page Migration in Dynamic Networks
inferred← citeshttps://doi.org/10.1007/s00224-006-1250-xopenalex-snapshot
Online Hierarchical Cooperative Caching
inferred← citeshttps://doi.org/10.1007/s00450-011-0150-8openalex-snapshot
Migrating and replicating data in networks
inferred← citeshttps://doi.org/10.1016/j.jda.2008.07.006openalex-snapshot
Optimal algorithms for page migration in dynamic networks
inferred← citeshttps://doi.org/10.1016/j.sysarc.2003.12.003openalex-snapshot
Replication algorithms for the World-Wide Web
inferred← citeshttps://doi.org/10.1109/wcnm.2005.1544262openalex-snapshot
On the security of a digital signature with message recovery using self-certified public key
inferred← citeshttps://doi.org/10.1145/1007912.1007923openalex-snapshot
Fighting against two adversaries
inferred← citeshttps://doi.org/10.1145/1007912.1007924openalex-snapshot
Online hierarchical cooperative caching
inferred← citeshttps://doi.org/10.1145/1583991.1584072openalex-snapshot
Power-aware online file allocation in mobile ad hoc networks
inferred← citeshttps://doi.org/10.1145/1851399.1851403openalex-snapshot
Competitive analysis for service migration in VNets
inferred← citeshttps://doi.org/10.1145/2124436.2124449openalex-snapshot
Online strategies for intra and inter provider service migration in virtual networks
inferred← citeshttps://doi.org/10.1145/3340296openalex-snapshot
Dynamic Beats Fixed
inferred← citeshttps://doi.org/10.48550/arxiv.1011.6594openalex-snapshot
On the Benefit of Virtualization: Strategies for Flexible Server Allocation
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.