ACM Home Page
Please provide us with feedback. Feedback
External Hashing Schemes for Collections of Data Structures
Full text PdfPdf (828 KB)
Source Journal of the ACM (JACM) archive
Volume 27 ,  Issue 1  (January 1980) table of contents
Pages: 81 - 95  
Year of Publication: 1980
ISSN:0004-5411
Authors
Richard J. Lipton  Computer Science Division, University of California at Berkeley, Berkeley, CA and Yale University, New Haven, Connecticut
Arnold L. Rosenberg  Computer Science Department, University of Toronto, Toronto, Ontario, Canada M5S 1A4 and IBM Thomas J. Watson Research Center, Yorktown Heights, New York
Andrew C. Yao  Computer Science Department, Stanford University, Stanford, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 31,   Citation Count: 1
Additional Information:

references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/322169.322177
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
KLARNER, D A, AND RIVEST, R L A procedure for lmprovmg the upper bound for the number of n-ommoes Canad. J. Math 25 (1973), 585-602
 
3
 
4
 
5
ROSENBERG, A L Managmg storage for extendible arrays SIAM J Comptng 4 (1975), 287-306
 
6
ROS~NaERG, A L On storing ragged arrays by hashing Math Syst Theory 10 (1976/77), 193-210
 
7
ROSENBERG, A L Direct-access storage of data structures Rlvtsta dt lnformattca VII (1977), 127-151
8
 
9
SNYDER, L On umquely representable data structures Proc 18th Annual IEEE Symp on Foundations of Computer Science, 1977, pp 142-146
 
10
VAN EMDE BOAS, P, KAAS, R, AND ZIJLSTRA, E Design and tmplementat,on of an efficient priority queue Math. Syst Theory 10 (1976/77), 99-127.
 
11
WHITTAKER, E T., AND WATSON, G N Modern Analysts. Cambndge U Press, London, 4th ed, 1958
 
12
YAO, A C, AND YAO, F.F. The complexity of searching an ordered random table Proc 17th Annual IEEE Symp on Foundauons of Computer Science, Houston, Texas, 1976, pp 173-177


Collaborative Colleagues:
Richard J. Lipton: colleagues
Arnold L. Rosenberg: colleagues
Andrew C. Yao: colleagues

Peer to Peer - Readers of this Article have also read: