A logarithmic time sort for linear size networks

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: John H. Reif
Leslie G. Valiant
Published in:
· Proceeding
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Pages 10-16
ACM New York, NY, USA ©1983
table of contents ISBN:0-89791-099-0 doi>10.1145/800061.808727
A logarithmic time sort for linear size networks Published by ACM 1983 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 12
· Downloads (cumulative): 196
· Citation Count: 14


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