Optimal parallel string algorithms: sorting, merging and computing the minimum

Full Text: PdfPdf Buy this ArticleBuy this Article
Author: Torben Hagerup Max-Planck-Institut für Informatik, Im Stadtwald, D-66123, Saarbrücken, Germany
Published in:
· Proceeding
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Pages 382 - 391
ACM New York, NY, USA ©1994
table of contents ISBN:0-89791-663-8 doi>10.1145/195058.195202
Optimal parallel string algorithms: sorting, merging and computing the minimum Published by ACM 1994 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 17
· Downloads (cumulative): 586
· Citation Count: 4


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


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