Linear work suffix array construction

doi:10.1145/1217856.1217858

Linear work suffix array construction

Full Text:

PDF

Buy this Article

Authors:	Juha Kärkkäinen	University of Helsinki, Helsinki, Finland
	Peter Sanders	University of Karlsruhe, Karlsruhe, Germany
	Stefan Burkhardt	Google, Inc., Zurich, Switzerland

Published in:

	· Journal
	Journal of the ACM (JACM) JACM Homepage archive
	Volume 53 Issue 6, November 2006 Pages 918-936 ACM New York, NY, USA table of contents doi>10.1145/1217856.1217858

	2006 Article
Bibliometrics
· Downloads (6 Weeks): 29 · Downloads (12 Months): 188 · Downloads (cumulative): 1,834 · Citation Count: 54

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: algorithms difference cover external memory algorithms indexing methods parallelism and concurrency sorting and searching suffix array theory

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder