42 citations · 46 across the 4 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
math.CO2017
Probabilistic Existence of Large Sets of Designs
Shachar Lovett, Sankeerth Rao, Alexander Vardy
A new probabilistic technique for establishing the existence of certain regular combinatorial structures has been recentlyintroduced by Kuperberg, Lovett, and Peled (STOC 2012). Us…
math.CO2017
The independence number of the Birkhoff polytope graph, and applications to maximally recoverable codes
Daniel Kane, Shachar Lovett, Sankeerth Rao
Maximally recoverable codes are codes designed for distributed storage which combine quick recovery from single node failure and optimal recovery from catastrophic failure. Gopalan…