98 citations · 133 across the 9 of their papers we have counts for
4 papers · 1 filter
On the Triangle Clique Cover and Clique Cover Problems
Hoang Dau, Olgica Milenkovic, Gregory J. Puleo
An edge clique cover of a graph is a set of cliques that covers all edges of the graph. We generalize this concept to " clique cover", i.e. a set of cliques that covers all co…
MaxMinSum Steiner Systems for Access-Balancing in Distributed Storage
Hoang Dau, Olgica Milenkovic
Many code families such as low-density parity-check codes, fractional repetition codes, batch codes and private information retrieval codes with low storage overhead rely on the us…
Repairing Reed-Solomon Codes With Two Erasures
Hoang Dau, Iwan Duursma, Han Mao Kiah +1
Despite their exceptional error-correcting properties, Reed-Solomon (RS) codes have been overlooked in distributed storage applications due to the common belief that they have poor…
Optimal Repair Schemes for Some Families of Full-Length Reed-Solomon Codes
Hoang Dau, Olgica Milenkovic
Reed-Solomon codes have found many applications in practical storage systems, but were until recently considered unsuitable for distributed storage applications due to the widely-h…