Optimal File Sharing in Distributed Networks
- 1 February 1995
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 24 (1) , 158-183
- https://doi.org/10.1137/s0097539792237462
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- A parallel algorithmic version of the local lemmaRandom Structures & Algorithms, 1991
- An algorithmic approach to the Lovász local lemma. IRandom Structures & Algorithms, 1991
- The file distribution problem for processor networksPublished by Springer Nature ,1990
- Efficient dispersal of information for security, load balancing, and fault toleranceJournal of the ACM, 1989
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- On the Fractional Solution to the Set Covering ProblemSIAM Journal on Algebraic Discrete Methods, 1983
- On secret sharing systemsIEEE Transactions on Information Theory, 1983
- Comparative Models of the File Assignment ProblemACM Computing Surveys, 1982
- Optimal allocation of resources in distributed information networksACM Transactions on Database Systems, 1976
- On the ratio of optimal integral and fractional coversDiscrete Mathematics, 1975