Practical linear-timeO(1)-workspace suffix sorting for constant alphabets

标题
Practical linear-timeO(1)-workspace suffix sorting for constant alphabets
作者
关键词
-
出版物
ACM TRANSACTIONS ON INFORMATION SYSTEMS
Volume 31, Issue 3, Pages 1-15
出版商
Association for Computing Machinery (ACM)
发表日期
2013-08-01
DOI
10.1145/2493175.2493180

向作者/读者发起求助以获取更多资源

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started