Ideas & society2021 · shared on Hacker News

Breaking the O(n)-Barrier in the Construction of Compressed Suffix Arrays

Explore Breaking the O(n)-Barrier in the Construction of Compressed Suffix Arrays, its original source and Hacker News discussions. Discover community perspectives and save it to your reading list.

Read original

The conversation around the idea.

Original Hacker News threads. Different perspectives, questions, and things worth thinking about.

Showing up to 100 related threads. A paper may appear in a comment rather than the original submission.

Ybelter ·

Breaking the O(n)-Barrier in the Construction of Compressed Suffix Arrays

3 points1 comments

One idea leads to another.

Explore more papers