On the public citation graph

On-line distributed data management

0 signed · 53 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.1006/jagm.1996.0853openalex-snapshot

Page Migration Algorithms Using Work Functions

inferredcites →https://doi.org/10.1006/jcss.1995.1073openalex-snapshot

Competitive Algorithms for Distributed Data Management

inferredcites →https://doi.org/10.1007/3-540-57155-8_285openalex-snapshot

Greedy algorithms for the on-line steiner tree and generalized steiner problems

inferredcites →https://doi.org/10.1007/3-540-57568-5_272openalex-snapshot

Page migration algorithms using work functions

inferredcites →https://doi.org/10.1007/3-540-57568-5_275openalex-snapshot

Randomized on-line algorithms for the page replication problem

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/978-1-4684-2001-2openalex-snapshot

Complexity of Computer Computations

inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot

Reducibility among Combinatorial Problems

inferredcites →https://doi.org/10.1007/978-3-540-68279-0_8openalex-snapshot

Reducibility Among Combinatorial Problems

inferredcites →https://doi.org/10.1090/dimacs/007/02openalex-snapshot

The server problem and on-line games

inferredcites →https://doi.org/10.1090/dimacs/007/10openalex-snapshot

Randomized algorithms for multiprocessor page migration

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

The Rectilinear Steiner Tree Problem is $NP$-Complete

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

Dynamic Steiner Tree Problem

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

Data Structures and Network Algorithms

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

On the power of randomization in online algorithms

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

Competitive algorithms for distributed data management (extended abstract)

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

Competitive distributed file allocation

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

Comparative Models of the File Assignment Problem

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

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

Linear programs for randomized on-line algorithms

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

Competitive randomized algorithms for non-uniform problems

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jagm.1997.0906openalex-snapshot

New On-Line Algorithms for the Page Replication Problem

inferred← citeshttps://doi.org/10.1006/jagm.1998.0924openalex-snapshot

Distributed Paging for General Networks

inferred← citeshttps://doi.org/10.1006/jagm.2000.1129openalex-snapshot

Placement Algorithms for Hierarchical Cooperative Caching

inferred← citeshttps://doi.org/10.1007/3-540-40064-8_25openalex-snapshot

Budget Constrained Minimum Cost Connected Medians

inferred← citeshttps://doi.org/10.1007/3-540-44436-x_15openalex-snapshot

New Results for Online Page Replication

inferred← citeshttps://doi.org/10.1007/3-540-48340-3_25openalex-snapshot

Lower and Upper Bounds for the Problem of Page Replication in Ring Networks

inferred← citeshttps://doi.org/10.1007/3-540-48481-7_9openalex-snapshot

Provably Good and Practical Strategies for Non-uniform Data Management in Networks

inferred← citeshttps://doi.org/10.1007/3-540-58218-5_3openalex-snapshot

New on-line algorithms for the page replication problem

inferred← citeshttps://doi.org/10.1007/3-540-60220-8_58openalex-snapshot

Page migration with limited local memory capacity

inferred← citeshttps://doi.org/10.1007/3-540-61680-2_72openalex-snapshot

Competitive analysis of randomized paging algorithms

inferred← citeshttps://doi.org/10.1007/3-540-68535-9_10openalex-snapshot

On the Bahncard Problem

inferred← citeshttps://doi.org/10.1007/978-3-642-60831-5_22openalex-snapshot

Parallel Computing in Paderborn: The SFB 376 “Massive Parallelism — Algorithms, Design Methods, Applications”

inferred← citeshttps://doi.org/10.1007/978-3-662-01069-3_42openalex-snapshot

Caching in Networks

inferred← citeshttps://doi.org/10.1007/bfb0002716openalex-snapshot

Static and dynamic data management in networks

inferred← citeshttps://doi.org/10.1007/bfb0029566openalex-snapshot

Distributed paging

inferred← citeshttps://doi.org/10.1007/s00224-003-1085-7openalex-snapshot

Approximation Algorithms for Data Management in Networks

inferred← citeshttps://doi.org/10.1016/j.jda.2004.04.006openalex-snapshot

Budget constrained minimum cost connected medians

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

New results for online page replication

inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00259-0openalex-snapshot

On page migration and other relaxed task systems

inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00262-0openalex-snapshot

Online algorithms for page replication in rings

inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00116-9openalex-snapshot

Competitive analysis of randomized paging algorithms

inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00055-5openalex-snapshot

Competitive distributed file allocation

inferred← citeshttps://doi.org/10.1109/kamw.2008.4810629openalex-snapshot

Approximation Algorithms for Data management in Geometric Network

inferred← citeshttps://doi.org/10.1109/sfcs.1997.646117openalex-snapshot

Exploiting locality for data management in systems of limited bandwidth

inferred← citeshttps://doi.org/10.1137/s0097539795287824openalex-snapshot

Competitive On-Line Algorithms for Distributed Data Management

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

On-line algorithms for Steiner tree problems (extended abstract)

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

Approximation algorithms for data management in networks

inferred← citeshttps://doi.org/10.5555/313852.313888openalex-snapshot

On-line generalized Steiner problem

inferred← citeshttps://doi.org/10.5555/313852.314122openalex-snapshot

Distributed paging for general networks

inferred← citeshttps://doi.org/10.5555/314161.314178openalex-snapshot

On page migration and other relaxed task systems

inferred← citeshttps://doi.org/10.5555/365411.365560openalex-snapshot

Approximation algorithms for data placement in arbitrary networks

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.