Before revision:  The complexities of our enumeration algorithms are O(n \log \log (n/r)) time and  O(r ) words of working space for string length n and RLBWT size r .
After revision:  The complexities of our enumeration algorithms are O(n \log \log (n/r)) time and O(r \log n) bits of working space for string length n and RLBWT size r .