On the performance of balanced hashing functions when the keys are not equiprobable

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Christos H. Papadimitriou Laboratory for Computer Science, Massachusetts Institute of Technology, 545 Technology Square, Cambridge, MA
Philip A. Bernstein Center for Research in Computing Technology, Aiken Computation Laboratory, Harvard University, Cambridge, MA
Published in:
· Journal
ACM Transactions on Programming Languages and Systems (TOPLAS) TOPLAS Homepage archive
Volume 2 Issue 1, Jan. 1980
Pages 77-89
ACM New York, NY, USA
table of contents doi>10.1145/357084.357089
On the performance of balanced hashing functions when the keys are not equiprobable Published by ACM 1980 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 3
· Downloads (cumulative): 181
· Citation Count: 1


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