Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time · HackerPapers discussions

Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time — mentioned by kragen

Wed, 08 Jan 2020 20:47:20 GMT

They're pretty new! I think the first linear-time suffix-sorting algorithm was the "skew algorithm" introduced in "Linear work suffix array construction," J. Kärkkäinen, P. Sanders, and S. Burkhardt. Journal of the ACM, 53(6):918–936, 2006, although I think Kärkkäinen and Sanders published it in 2003 ("Simple linear work suffix array construction", J.C.M. Baeten et al. (Eds.): ICALP 2003, LNCS 2719, pp. 943–955, 2003.) SA-IS, from 2009, has a vulgar explanation (by Satan!) at https://zork.net/~st/jottings/sais.html; he cites the paper as “Linear Suffix Array Construction by Almost Pure…

Paper and discussion history. A mention is not an endorsement.

Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time — mentioned by edward_rolf

Sun, 14 May 2017 18:53:15 GMT

This is very interesting to me. What's the other one? Edit: no worries: found it [0]. So much to read today if you wanna stay ajour with indexing and compression. https://arxiv.org/abs/1607.04346

Paper and discussion history. A mention is not an endorsement.

Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time — HN submission

Sun, 14 May 2017 02:06:48 GMT

Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time

197 points; 40 discussion replies on HN. Paper and source history. A submission is not an endorsement.