Parallel hashing—an efficient implementation of shared memory

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: A R Karlin Computer Science Department, Stanford University
E Upfal IBM Almaden Research Center, Almaden, California
Published in:
· Proceeding
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Pages 160-168
ACM New York, NY, USA ©1986
table of contents ISBN:0-89791-193-8 doi>10.1145/12130.12146
Parallel hashing—an efficient implementation of shared memory Published by ACM 1986 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 8
· Downloads (cumulative): 297
· Citation Count: 20


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