Internal Sorting Using a Minimal Tree Merge Strategy

Full Text: PDFPDF Buy this ArticleBuy this Article
Author: Leigh R. Power IBM Thomas J. Watson Research Center, Yorktown Heights, NY
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS) TOMS Homepage archive
Volume 6 Issue 1, March 1980
Pages 68-79
ACM New York, NY, USA
table of contents doi>10.1145/355873.355879
Internal Sorting Using a Minimal Tree Merge Strategy Published by ACM 1980 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 10
· Downloads (cumulative): 365
· Citation Count: 0


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