Before revision:  The most space-efficient algorithms that can be derived from prior work store either O(\log(\varepsilon^2 n)/\varepsilon^2) or O(\log^3(\varepsilon n)/\varepsilon) universe items.
After revision:  The most space-efficient algorithms due to prior work store either O(\log(\varepsilon^2 n)/\varepsilon^2) or O(\log^3(\varepsilon n)/\varepsilon) universe items.