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

Published 2013 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Practical linear-timeO(1)-workspace suffix sorting for constant alphabets
Authors
Keywords
-
Journal
ACM TRANSACTIONS ON INFORMATION SYSTEMS
Volume 31, Issue 3, Pages 1-15
Publisher
Association for Computing Machinery (ACM)
Online
2013-08-01
DOI
10.1145/2493175.2493180

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

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
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.