Optimal time-space trade-offs for non-comparison-based sorting

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Rasmus Pagh University of Aarhus, DK-8000 Aarhus C, Denmark
Jakob Pagter CRYPTOMAThIC, Kannikegade 14, 3., DK-8000 Aarhus C, Denmark
Published in:
· Proceeding
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Pages 9-18
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©2002
table of contents ISBN:0-89871-513-X
Optimal time-space trade-offs for non-comparison-based sorting 2002 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 20
· Downloads (cumulative): 348
· 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