I bumped into this 2016 paper on HN: https://arxiv.org/abs/1607.04346

(emphasis mine)We show that the compressed suffix array and the compressed suffix tree of a string T can be built in O(n) deterministic time using O(nlogσ) bits of space, where n is the string length and σ is the alphabet size. Previously described deterministic algorithms either run in time that depends on the alphabet size or need ω(nlogσ) bits of working space. Our result has immediate applications to other problems, such as yieldingthe first linear-time LZ77 and LZ78 parsing algorithms that useO(nlogσ).bits

HN comments: https://news.ycombinator.com/item?id=14333882