30 citations · 82 across the 38 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DS2016
Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time
J. Ian Munro, Gonzalo Navarro, Yakov Nekrich
We show that the compressed suffix array and the compressed suffix tree of a string can be built in deterministic time using bits of space, where is the…
cs.DS2016
Range Majorities and Minorities in Arrays
Djamal Belazzougui, Travis Gagie, J. Ian Munro +2
Karpinski and Nekrich (2008) introduced the problem of parameterized range majority, which asks us to preprocess a string of length such that, given the endpoints of a range, o…