Well-balanced designs for data placement
From MaRDI portal
Publication:2808799
DOI10.1002/JCD.21506zbMATH Open1336.05018OpenAlexW2140709916MaRDI QIDQ2808799FDOQ2808799
Jean-Claude Bermond, Alain Jean-Marie, Dorian Mazauric, Joseph Yu
Publication date: 24 May 2016
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.21506
Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Combinatorial aspects of block designs (05B05) Triple systems (05B07)
Cites Work
- A new existence proof for large sets of disjoint Steiner triple systems
- On Quadruple Systems
- Title not available (Why is that?)
- A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems
- On large sets of disjoint Steiner triple systems. IV
- Quadratic leaves of maximal partial triple systems
- Group divisible designs with two associate classes, and quadratic leaves of triple systems
- On large sets of disjoint Steiner triple systems. III
- New results on large sets of Kirkman triple systems
- Towards a Large Set of Steiner Quadruple Systems
- Title not available (Why is that?)
- Well-balanced designs for data placement
- The existence of well-balanced triple systems
- Neighborhoods in Maximum Packings of 2Knand Quadratic Leaves of Triple Systems
Cited In (7)
- Further study on optimal data placements for triple replication
- The existence of well-balanced triple systems
- Well-balanced designs for data placement
- Egalitarian Steiner triple systems for data popularity
- The existence of 2-balanced Mendelsohn triple systems
- Well-balanced quadruple systems
- Optimal data placements for triple replication in distributed storage systems
This page was built for publication: Well-balanced designs for data placement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808799)
