SIGN IN
SIGN UP
Hashing Schemes for Extendible Arrays
Full Text:
PDF
Buy this Article
Authors:
Arnold L. Rosenberg
Mathematical Sciences Department, IBM Thomas J Watson Research Center, Box 218, Yorktown Heights, NY
Larry J. Stockmeyer
Mathematical Sciences Department, IBM Thomas J Watson Research Center, Box 218, Yorktown Heights, NY
Published in:
· Journal
Journal of the ACM (JACM)
JACM Homepage
archive
Volume 24 Issue 2, April 1977
Pages 199-221
ACM
New York, NY
, USA
table of contents
doi>
10.1145/322003.322006
1977 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 11
· Downloads (cumulative): 353
· Citation Count: 10
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
arrays
design
hash-table representations
measurement
performance
theory
verification
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder