most citedKirkman Systems that Attain the Upper Bound on the Minimum Block Sum, for Access Balancing in Distributed Storage

5 citations · 5 across the 1 of their papers we have counts for

collaborators

1 paper

math.CO2019★ 5 cited

Kirkman Systems that Attain the Upper Bound on the Minimum Block Sum, for Access Balancing in Distributed Storage

William M. Brummond

We study a class of combinatorial designs called Kirkman systems, and we show that infinitely many Kirkman systems are well-distributed in a precise sense. Steiner triple systems o…