Sorting in linear time?

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Arne Andersson Department of Computer Science, Lund University, Box 118, S-22100 Lund, Sweden
Torben Hagerup Max-Planck-Institut für Infomatik, D-66123 Saarbrücken, Germany
Stefan Nilsson Department of Computer Science, Lund University, Box 118, S-22100 Lund, Sweden
Rajeev Raman Department of Computer Science, King's college London, Strand, London WC2R 2LS, U.K.
Sorting in linear time? Published by ACM 1995 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 48
· Downloads (cumulative): 1,037
· Citation Count: 31

Published in:
Cover Image
 
· Proceeding
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Pages 427-436
ACM New York, NY, USA ©1995
table of contents ISBN:0-89791-718-9 doi>10.1145/225058.225173

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