Before revision: 5}} dependence of Hassidim et}  al. (NeurIPS 2020, oral presentation) .
After revision: 5}} dependence of Hassidim et} show how to convert a non-robust algorithm into a robust one with a roughly 1/\varepsilon factor overhead. This was subsequently improved to a 1/\sqrt{\varepsilon al. (NeurIPS 2020, oral presentation) .