Minimal replication cost for availability

From MaRDI portal

Revision as of 15:39, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5170871

Jump to:navigation, search

DOI10.1145/571825.571839zbMath1292.68020OpenAlexW2019957811MaRDI QIDQ5170871

Haifeng Yu, Amin Vahdat

Publication date: 25 July 2014

Published in: Proceedings of the twenty-first annual symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/571825.571839

Mathematics Subject Classification ID

Linear programming (90C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Internet topics (68M11)

Related Items (1)

Optimal inter-object correlation when replicating for availability

This page was built for publication: Minimal replication cost for availability

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5170871&oldid=19732830"