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

REFERENCES 336
[SKM01]
[SL88]
[SLC + 07]
ISSN 0302-9743 (print), 1611-
3349 (electronic). URL
http://link.springer.com/
content/pdf/10.1007/978-3-
540-75444-2_73.
Suzuki:2001:ESB
Koutarou Suzuki, Kunio Kobayashi,
and Hikaru Morita. Efficient
sealed-bid auction using
hash chain. Lecture Notes
in CS, 2015:183–??, 2001.
CODEN LNCSD9. ISSN
0302-9743 (print), 1611-3349
(electronic). URL http://
link.springer-ny.com/link/
service/series/0558/bibs/
2015/20150183.htm; http:
//link.springer-ny.com/link/
service/series/0558/papers/
2015/20150183.pdf.
Shang:1988:DCP
C. C. Shang and C. H. Lin.
On the difficulty <strong>of</strong> constructing
perfect hashing functions. In
IEEE 1988 International Symposium
on Information Theory
— Abstracts <strong>of</strong> papers, volume
25 n 13, pages 241–?? IEEE
Computer Society Press, 1109
Spring Street, Suite 300, Silver
Spring, MD 20910, USA,
1988. Available from IEEE
Service Cent (catalog number
88CH2621-1). Piscataway, NJ,
USA.
Schweller:2007:RSE
Robert Schweller, Zhichun Li,
Yan Chen, Yan Gao, Ashish
Gupta, Yin Zhang, Peter A.
Dinda, Ming-Yang Kao, and
Gokhan Memik. Reversible
sketches: enabling monitoring
and analysis over high-speed
data streams. IEEE/ACM
Transactions on Networking, 15
(5):1059–1072, October 2007.
CODEN IEANEP. ISSN 1063-
6692 (print), 1558-2566 (electronic).
Shultz:1987:TSM
[SM87] R. Shultz and I. Miller. Tree
structured multiple processor
join methods. In Proceedings <strong>of</strong>
the International Conference on
Data Engineering, pages 190–
199. IEEE Computer Society,
IEEE Computer Society Press,
[SM94]
[SM02]
1109 Spring Street, Suite 300,
Silver Spring, MD 20910, USA,
February 1987.
Shin:1994:NJA
Dong Keun Shin and Arnold Charles
Meltzer. A new join algorithm.
SIGMOD Record (ACM Special
Interest Group on Management
<strong>of</strong> Data), 23(4):13–18, December
1994. CODEN SRECD8.
ISSN 0163-5808 (print), 1943-
5835 (electronic).
Sit:2002:SCP
Emil Sit and Robert Morris. Security
considerations for peerto-peer
distributed hash tables.
Lecture Notes in CS, 2429:261–
??, 2002. CODEN LNCSD9.
ISSN 0302-9743 (print), 1611-
3349 (electronic). URL
http://link.springer.de/
link/service/series/0558/
bibs/2429/24290261.htm;
http://link.springer.de/