Parallel algorithms for generating random permutations on a shared memory machine

Full Text: PdfPdf Buy this ArticleBuy this Article
Author: R. Anderson University of Washington
Published in:
· Proceeding
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Pages 95 - 102
ACM New York, NY, USA ©1990
table of contents ISBN:0-89791-370-1 doi>10.1145/97444.97674
Parallel algorithms for generating random permutations on a shared memory machine Published by ACM 1990 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 32
· Downloads (cumulative): 195
· Citation Count: 7


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