A Bibliography of Publications on Hashing Algorithms - Index of files in

REFERENCES 324
perfect hash functions. Communications
<strong>of</strong> the Association
for Computing Machinery, 28
(5):523–532, May 1985. CO-
DEN CACMA2. ISSN 0001-
0782 (print), 1557-7317 (electronic).
Sager:1985:TCS
[Sag85b] Thomas J. Sager. A technique
for creating small fast
compiler frontends. SIGPLAN
Notices, 20(10):87–94, October
1985. CODEN SINODQ. ISSN
0362-1340 (print), 1523-2867
(print), 1558-1160 (electronic).
Salzberg:1988:FS
[Sal88] Betty Salzberg. File Structures.
Prentice-Hall, Englewood
Cliffs, NJ 07632, USA,
1988. ISBN 0-13-314691-X. x +
342 pp. LCCN QA76.9.F5 S25
1988. US$36.95.
Samson:1976:TOA
[Sam76] W. B. Samson. Testing overflow
algorithms for a table <strong>of</strong>
variable size. The Computer
Journal, 19(1):92, February
1976. CODEN CMPJA6. ISSN
0010-4620 (print), 1460-2067
(electronic). URL http://
comjnl.oxfordjournals.org/
content/19/1/92.full.pdf+
html; http://www3.oup.
co.uk/computer_journal/hdb/
Volume_19/Issue_01/tiff/
92.tif.
[Sam81]
Samson:1981:HTC
W. B. Samson. Hash table collision
handling on storage devices
with latency. The Computer
Journal, 24(2):130–131,
May 1981. CODEN CMPJA6.
ISSN 0010-4620 (print), 1460-
2067 (electronic).
Santoro:1976:FTS
[San76] Nicola Santoro. Full table
search by polynomial functions.
Information Processing Letters,
5(3):72–74, August ??, 1976.
CODEN IFPLAT. ISSN 0020-
0190 (print), 1872-6119 (electronic).
Sarwate:1980:NUC
[Sar80] Dilip V. Sarwate. A note on:
“Universal classes <strong>of</strong> hash functions”
[J. Comput. System Sci.
18 (1979), no. 2, 143–154; MR
80f:68110a ] by J. L. Carter and
M. N. Wegman. Information
Processing Letters, 10(1):41–45,
February 1980. CODEN IF-
PLAT. ISSN 0020-0190 (print),
1872-6119 (electronic).
Sarkar:2010:SGC
[Sar10] Palash Sarkar. A simple and
generic construction <strong>of</strong> authenticated
encryption with associated
data. ACM Transactions
on Information and
System Security, 13(4):33:1–
33:??, December 2010. CO-
DEN ATISBQ. ISSN 1094-9224
(print), 1557-7406 (electronic).
[Sar11]
Sarkar:2011:TBC
Palash Sarkar. A trade-<strong>of</strong>f between
collision probability and
key size in universal hashing
using polynomials. Designs,