https://hackerpaper.kaipfister.de/p/1610.08305/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=32961856urn:hackerpapers:mention:1610.08305:32961856Sat, 24 Sep 2022 12:25:00 GMT<p>Not only that, the suffix array [1] is using counting sort O(n) instead of a comparison based O(n log n) sort. That is because they assume integer alphabets. For general alphabets they can only achieve O(n log n). [1] https://arxiv.org/abs/1610.08305</p><p><a href="https://hackerpaper.kaipfister.de/p/1610.08305/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.DShttps://news.ycombinator.com/item?id=20807315urn:hackerpapers:submission:1610.08305:20807315Tue, 27 Aug 2019 08:15:29 GMT<p>Optimal In-Place Suffix Sorting (2016)</p><p></p><p>1 point; 0 discussion replies on HN. <a href="https://hackerpaper.kaipfister.de/p/1610.08305/">Paper and source history</a>. A submission is not an endorsement.</p>cs.DS