On the public citation graph

Correlation-Aware Object Placement for Multi-Object Operations

0 signed · 22 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.1016/j.jpdc.2005.06.014openalex-snapshot
Task assignment in heterogeneous computing systems
inferredcites →https://doi.org/10.1109/12.8704openalex-snapshot
Heuristic algorithms for task assignment in distributed systems
inferredcites →https://doi.org/10.1109/71.577254openalex-snapshot
Optimal task assignment in homogeneous networks
inferredcites →https://doi.org/10.1109/sffcs.1999.814572openalex-snapshot
Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields
inferredcites →https://doi.org/10.1145/1060590.1060676openalex-snapshot
Balanced metric labeling
inferredcites →https://doi.org/10.1145/1352592.1352599openalex-snapshot
Replication degree customization for high availability
inferredcites →https://doi.org/10.1145/1400751.1400798openalex-snapshot
Optimizing data popularity conscious bloom filters
inferredcites →https://doi.org/10.1145/276698.276711openalex-snapshot
An improved approximation algorithm for multiway cut
inferredcites →https://doi.org/10.1145/321958.321975openalex-snapshot
P-Complete Approximation Problems
inferredcites →https://doi.org/10.1145/585265.585268openalex-snapshot
Approximation algorithms for classification problems with pairwise relationships
inferredcites →https://doi.org/10.2307/1907742openalex-snapshot
Assignment Problems and the Location of Economic Activities

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-642-02011-7_10openalex-snapshot
A Heuristic for Fair Correlation-Aware Resource Placement
inferred← citeshttps://doi.org/10.1007/978-3-642-03784-9_20openalex-snapshot
Two-Dimensional Distributed Inverted Files
inferred← citeshttps://doi.org/10.1007/978-3-642-16949-6_5openalex-snapshot
On the Expressiveness and Trade-Offs of Large Scale Tuple Stores
inferred← citeshttps://doi.org/10.1007/978-3-642-21387-8_17openalex-snapshot
A Correlation-Aware Data Placement Strategy for Key-Value Stores
inferred← citeshttps://doi.org/10.1007/978-3-642-40285-2_20openalex-snapshot
Exploring Data Locality for Clustered Enterprise Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-45065-5_22openalex-snapshot
DynaSoRe: Efficient In-Memory Store for Social Applications
inferred← citeshttps://doi.org/10.1007/s11432-010-4153-zopenalex-snapshot
Optimizing write operation on replica in data grid
inferred← citeshttps://doi.org/10.1109/cbd.2015.41openalex-snapshot
SSDP: A Slot-Sensitive Data Placement Strategy in Cloud Computing
inferred← citeshttps://doi.org/10.1109/hpcc.2009.86openalex-snapshot
RADPA Reliability-Aware Data Placement Algorithm for Large-Scale Network Storage Systems
inferred← citeshttps://doi.org/10.1109/iccsnt.2012.6526092openalex-snapshot
Multi-file queries performance improvement through data placement in Hadoop
inferred← citeshttps://doi.org/10.1145/1400751.1400798openalex-snapshot
Optimizing data popularity conscious bloom filters
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.