Before revision:  This marks the first improvements to the O(\log\log\epsilon^{-1}\cdot \epsilon^{-2})pass, O(n \log\log\epsilon}   ^{-1} \cdot \epsilon^{-2 ) -space algorithms of AG13 when \epsilon is moderately small .
After revision:  This marks the first improvements to the O(\log\log\epsilon^{-1}\cdot \epsilon^{-2})pass, O(n \log\log\epsilon} ), space, improving upon the space complexity of the previous state-of-the-art ^{-1} \cdot \epsilon^{-2 ) -space algorithms of AG13 when \epsilon is moderately small .