A minimum area VLSI network for O(logn) time sorting

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: G. Bilardi
F. P. Preparata
Published in:
· Proceeding
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Pages 64-70
ACM New York, NY, USA ©1984
table of contents ISBN:0-89791-133-4 doi>10.1145/800057.808666
A minimum area VLSI network for O(logn) time sorting Published by ACM 1984 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 7
· Downloads (cumulative): 277
· Citation Count: 3


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