On the public citation graph
Configuration of fully replicated distributed database system over wide area networks
0 signed · 39 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.1002/j.1538-7305.1985.tb00360.xopenalex-snapshot
Models for Configuring Large-Scale Distributed Computing Systems
inferredcites →https://doi.org/10.1002/net.3230120402openalex-snapshot
Topological design of centralized computer networks—formulations and algorithms
inferredcites →https://doi.org/10.1007/bf01580223openalex-snapshot
Validation of subgradient optimization
inferredcites →https://doi.org/10.1007/bf02591740openalex-snapshot
A generalization of Polyak's convergence result for subgradient optimization
inferredcites →https://doi.org/10.1007/bf02591863openalex-snapshot
Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
inferredcites →https://doi.org/10.1080/05695557808975181openalex-snapshot
Lagrangean Relaxation Applied to Capacitated Facility Location Problems
inferredcites →https://doi.org/10.1109/mc.1984.1658928openalex-snapshot
File Placement on Distributed Computer Systems
inferredcites →https://doi.org/10.1109/t-c.1969.222542openalex-snapshot
Optimal File Allocation in a Multiple Computer System
inferredcites →https://doi.org/10.1109/tc.1982.1676019openalex-snapshot
A Methodology for the Design of Communication Networks and the Distribution of Data in Distributed Supercomputer Systems
inferredcites →https://doi.org/10.1109/tc.1983.1676215openalex-snapshot
File Allocation in a Distributed Computer Communication Network
inferredcites →https://doi.org/10.1109/tc.1986.1676799openalex-snapshot
Computer and Database Location in Distributed Computer Systems
inferredcites →https://doi.org/10.1109/tc.1987.1676975openalex-snapshot
Optimization Models for Configuring Distributed Computer Systems
inferredcites →https://doi.org/10.1109/tcom.1983.1095752openalex-snapshot
An Algorithm for Optimal Route Selection in SNA Networks
inferredcites →https://doi.org/10.1109/tse.1978.231494openalex-snapshot
The Concurrency Control Mechanism of SDD-1: A System for Distributed Databases (The Fully Redundant Case)
inferredcites →https://doi.org/10.1145/1478873.1478955openalex-snapshot
Allocation of copies of a file in an information network
inferredcites →https://doi.org/10.1145/3148.3161openalex-snapshot
Database partitioning in a cluster of processors
inferredcites →https://doi.org/10.1145/320434.320449openalex-snapshot
Optimal allocation of resources in distributed information networks
inferredcites →https://doi.org/10.1145/322358.322367openalex-snapshot
Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
inferredcites →https://doi.org/10.1145/356876.356883openalex-snapshot
Comparative Models of the File Assignment Problem
inferredcites →https://doi.org/10.1145/359581.359591openalex-snapshot
Optimal program and data locations in computer networks
inferredcites →https://doi.org/10.1287/mnsc.27.1.1openalex-snapshot
The Lagrangian Relaxation Method for Solving Integer Programming Problems
inferredcites →https://doi.org/10.1287/opre.18.5.924openalex-snapshot
Surrogate Mathematical Programming
inferredcites →https://doi.org/10.1287/opre.18.6.1138openalex-snapshot
The Traveling-Salesman Problem and Minimum Spanning Trees
inferredcites →https://doi.org/10.1287/opre.26.6.992openalex-snapshot
A Dual-Based Procedure for Uncapacitated Facility Location
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s10479-013-1330-7openalex-snapshot
Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding
inferred← citeshttps://doi.org/10.1007/s10479-015-1840-6openalex-snapshot
Facility location models to locate data in information networks: a literature review
inferred← citeshttps://doi.org/10.1016/0305-0548(96)00017-2openalex-snapshot
Resource allocation and capacity assignment in distributed systems
inferred← citeshttps://doi.org/10.1016/j.cor.2005.09.013openalex-snapshot
Designing cost-effective content distribution networks
inferred← citeshttps://doi.org/10.1016/j.cor.2007.02.005openalex-snapshot
Exact algorithms for the joint object placement and request routing problem in content distribution networks
inferred← citeshttps://doi.org/10.1016/j.cor.2014.05.023openalex-snapshot
Exact approaches for static data segment allocation problem in an information network
inferred← citeshttps://doi.org/10.1016/s0966-8349(98)00042-4openalex-snapshot
Hub location in backbone/tributary network design: a review
inferred← citeshttps://doi.org/10.1023/a:1019105319597openalex-snapshot
LEO/MEO systems – Global mobile communication systems
inferred← citeshttps://doi.org/10.1057/palgrave.jors.2602490openalex-snapshot
A two-level simulated annealing algorithm for efficient dissemination of electronic content
inferred← citeshttps://doi.org/10.1109/5326.971658openalex-snapshot
A design framework for e-business infrastructure integration and resource management
inferred← citeshttps://doi.org/10.1504/ijads.2014.063237openalex-snapshot
Multi-objective multiple allocation hub location problem with multiple capacity levels considering sustainable development paradigm
inferred← citeshttps://doi.org/10.18178/ijmlc.2018.8.5.731openalex-snapshot
Distributed Database Problems, Approaches and Solutions — A Study
inferred← citeshttps://doi.org/10.22034/2017.3.05openalex-snapshot
A New Robust Mathematical Model for the Multi-product Capacitated Single Allocation Hub Location Problem with Maximum Covering Radius
inferred← citeshttps://doi.org/10.3138/infor.45.3.005openalex-snapshot
Une heuristique de recherche avec tabous pour la conception de réseaux de distribution de contenu électronique
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.