-
3
-
-
0025626679
-
Perfect hashing using sparse matrix packing
-
M.D. Brain and A.L. Tharp. Perfect hashing using sparse matrix packing. Information Systems, 15 (1990) 281-290.
-
(1990)
Information Systems
, vol.15
, pp. 281-290
-
-
Brain, M.D.1
Tharp, A.L.2
-
7
-
-
0022149623
-
An interactive system for finding perfect hash functions
-
N. Cercone, J. Boates, and M. Krause. An interactive system for finding perfect hash functions. IEEE Software, 2 (1985) 38-53.
-
(1985)
IEEE Software
, vol.2
, pp. 38-53
-
-
Cercone, N.1
Boates, J.2
Krause, M.3
-
8
-
-
0025997793
-
Letter oriented perfect hashing scheme based upon sparse table compression
-
C-C. Chang and T-C. Wu. Letter oriented perfect hashing scheme based upon sparse table compression. Software — Practice and Experience, 21 (1991) 35-49.
-
(1991)
Software — Practice and Experience
, vol.21
, pp. 35-49
-
-
Chang, C.-C.1
Wu, T.-C.2
-
9
-
-
84976678241
-
The study of an ordered minimal perfect hashing scheme
-
C.C. Chang. The study of an ordered minimal perfect hashing scheme. Communications of the ACM, 27 (1984) 384-387.
-
(1984)
Communications of the ACM
, vol.27
, pp. 384-387
-
-
Chang, C.C.1
-
10
-
-
0023964847
-
An ordered minimal perfect hashing scheme with single parameter
-
C.C. Chang and C.H. Chang. An ordered minimal perfect hashing scheme with single parameter. Information Processing Letters, 27 (1988) 79-83.
-
(1988)
Information Processing Letters
, vol.27
, pp. 79-83
-
-
Chang, C.C.1
Chang, C.H.2
-
11
-
-
0026244388
-
On the design of a machine independent perfect hashing
-
C.C. Chang, C.Y. Chen, and J.K. Jan. On the design of a machine independent perfect hashing. The Computer Journal, 34 (1991) 469-474.
-
(1991)
The Computer Journal
, vol.34
, pp. 469-474
-
-
Chang, C.C.1
Chen, C.Y.2
Jan, J.K.3
-
12
-
-
0022735348
-
A letter-oriented minimal perfect hashing scheme
-
C.C. Chang and R.C.T. Lee. A letter-oriented minimal perfect hashing scheme. The Computer Journal, 29 (1986) 277-281.
-
(1986)
The Computer Journal
, vol.29
, pp. 277-281
-
-
Chang, C.C.1
Lee, R.C.T.2
-
13
-
-
0018918579
-
Minimal perfect hash functions made simple
-
R.J. Cichelli. Minimal perfect hash functions made simple. Communications of the ACM, 23 (1980) 17-19.
-
(1980)
Communications of the ACM
, vol.23
, pp. 17-19
-
-
Cichelli, R.J.1
-
14
-
-
84976683170
-
A letter oriented minimal perfect hashing function
-
C.R. Cook and R.R. Oldehoeft. A letter oriented minimal perfect hashing function. SIGPLAN Notices, 17 (1982) 18-27.
-
(1982)
SIGPLAN Notices
, vol.17
, pp. 18-27
-
-
Cook, C.R.1
Oldehoeft, R.R.2
-
16
-
-
0027112822
-
An optimal algorithm for generating minimal perfect hash functions
-
Z.J. Czech, G. Havas, and B.S. Majewski. An optimal algorithm for generating minimal perfect hash functions. Information Processing Letters, 43 (1992) 257-264.
-
(1992)
Information Processing Letters
, vol.43
, pp. 257-264
-
-
Czech, Z.J.1
Havas, G.2
Majewski, B.S.3
-
17
-
-
0347040425
-
Generating a minimal perfect hashing function in O(M 2) time
-
Z.J. Czech and B.S. Majewski. Generating a minimal perfect hashing function in O(m 2) time. Archiwum Informatyki, 4 (1992) 3-20.
-
(1992)
Archiwum Informatyki
, vol.4
, pp. 3-20
-
-
Czech, Z.J.1
Majewski, B.S.2
-
18
-
-
84860839700
-
Polynomial hash functions are reliable
-
Vienna, Austria, LNCS 623
-
M. Dietzfelbinger, J. Gil, Y. Matias, and N. Pippenger. Polynomial hash functions are reliable. In 19th International Colloquium on Automata, Languages and Programming — ICALP'92, 235-246, Vienna, Austria, 1992. LNCS 623.
-
(1992)
19Th International Colloquium on Automata, Languages and Programming — ICALP'92
, pp. 235-246
-
-
Dietzfelbinger, M.1
Gil, J.2
Matias, Y.3
Pippenger, N.4
-
19
-
-
85031912155
-
A new universal class of hash functions, and dynamic hashing in real time
-
Warwick University, England, LNCS 443
-
M. Dietzfelbinger and F. Meyer auf der Heide. A new universal class of hash functions, and dynamic hashing in real time. In 17th International Colloquium on Automata, Languages and Programming — ICALP'90, 6-19, Warwick University, England, 1990. LNCS 443.
-
(1990)
17Th International Colloquium on Automata, Languages and Programming — ICALP'90
, pp. 6-19
-
-
Dietzfelbinger, M.1
Meyer Auf Der Heide, F.2
-
20
-
-
0020751069
-
The study of a new perfect hash scheme
-
M.W. Du, T.M. Hsieh, K.F. Jea, and D.W Shieh. The study of a new perfect hash scheme. IEEE Transactions on Software Engineering, 9 (1983) 305-313.
-
(1983)
IEEE Transactions on Software Engineering
, vol.9
, pp. 305-313
-
-
Du, M.W.1
Hsieh, T.M.2
Jea, K.F.3
Shieh, D.W.4
-
21
-
-
0039824525
-
Types of cycles in hypergraphs
-
R. Duke. Types of cycles in hypergraphs. Ann. Discrete Math., 27 (1985) 399-418.
-
(1985)
Ann. Discrete Math.
, vol.27
, pp. 399-418
-
-
Duke, R.1
-
22
-
-
0001847481
-
On the evolution of random graphs
-
Reprinted in J.H. Spencer, editor, The Art of Counting: Selected Writings, Mathematicians of Our Time, 574-617. Cambridge, Mass.: MIT Press, 1973
-
P. Erdős and A. Rényi. On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci., 5 (1960) 17-61. Reprinted in J.H. Spencer, editor, The Art of Counting: Selected Writings, Mathematicians of Our Time, 574-617. Cambridge, Mass.: MIT Press, 1973.
-
(1960)
Publ. Math. Inst. Hung. Acad. Sci
, vol.5
, pp. 17-61
-
-
Erdős, P.1
Rényi, A.2
-
23
-
-
84976823410
-
Order preserving minimal perfect hash functions and information retrieval
-
E. Fox, Q.F. Chen, A. Daoud, and L. Heath. Order preserving minimal perfect hash functions and information retrieval. ACM Transactions on Information Systems, 9 (1991) 281-308.
-
(1991)
ACM Transactions on Information Systems
, vol.9
, pp. 281-308
-
-
Fox, E.1
Chen, Q.F.2
Daoud, A.3
Heath, L.4
-
24
-
-
0026971343
-
LEND and faster algorithms for constructing minimal perfect hash functions
-
Copenhagen, Denmark
-
E. Fox, Q.F. Chen, and L. Heath. LEND and faster algorithms for constructing minimal perfect hash functions. In Proc. 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval — SIGIR'92, Copenhagen, Denmark, 266-273, 1992.
-
(1992)
Proc. 15Th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval — SIGIR'92
, pp. 266-273
-
-
Fox, E.1
Chen, Q.F.2
Heath, L.3
-
25
-
-
84976812946
-
Practical minimal perfect hash functions for large databases
-
E.A. Fox, L.S. Heath, Q. Chen, and A.M. Daoud. Practical minimal perfect hash functions for large databases. Communications of the ACM, 35 (1992) 105-121.
-
(1992)
Communications of the ACM
, vol.35
, pp. 105-121
-
-
Fox, E.A.1
Heath, L.S.2
Chen, Q.3
Daoud, A.M.4
-
26
-
-
0021467937
-
Storing a sparse table with O(1) worst case access time
-
M.L. Fredman, J. Komlós, and E. Szemerédi. Storing a sparse table with O(1) worst case access time. Journal of the ACM, 31 (1984) 538-544.
-
(1984)
Journal of the ACM
, vol.31
, pp. 538-544
-
-
Fredman, M.L.1
Komlós, J.2
Szemerédi, E.3
-
28
-
-
0346410239
-
An algebraic approach to Cichelli's perfect hashing
-
M. Gori and G. Soda. An algebraic approach to Cichelli's perfect hashing. BIT, 29 (1989) 209-214.
-
(1989)
BIT
, vol.29
, pp. 209-214
-
-
Gori, M.1
Soda, G.2
-
29
-
-
0022660495
-
Finding minimal perfect hash functions
-
G. Haggard and K. Karplus. Finding minimal perfect hash functions. ACM SIGCSE Bulletin, 18 (1986) 191-193.
-
(1986)
ACM SIGCSE Bulletin
, vol.18
, pp. 191-193
-
-
Haggard, G.1
Karplus, K.2
-
30
-
-
4243167224
-
-
Technical Report 234, The University of Queensland, Key Centre for Software Technology, Queensland
-
G. Havas and B.S. Majewski. Optimal algorithms for minimal perfect hashing. Technical Report 234, The University of Queensland, Key Centre for Software Technology, Queensland, 1992.
-
(1992)
Optimal Algorithms for Minimal Perfect Hashing
-
-
Havas, G.1
Majewski, B.S.2
-
32
-
-
0019675613
-
Reciprocal hashing: A method for generating minimal perfect hashing functions
-
G. Jaeschke. Reciprocal hashing: A method for generating minimal perfect hashing functions. Communications of the ACM, 24 (1981) 829-833.
-
(1981)
Communications of the ACM
, vol.24
, pp. 829-833
-
-
Jaeschke, G.1
-
34
-
-
0024088662
-
Hashing for dynamic and static internal tables
-
T.G. Lewis and C.R. Cook. Hashing for dynamic and static internal tables. Computer, 21(1988) 45-56.
-
(1988)
Computer
, vol.21
, pp. 45-56
-
-
Lewis, T.G.1
Cook, C.R.2
-
35
-
-
84918698743
-
-
Technical Report 16, DIMACS, Rutgers University, New Jersey, USA
-
B.S. Majewski, N.C. Wormald, Z.J. Czech, and G. Havas. A family of generators of minimal perfect hash functions. Technical Report 16, DIMACS, Rutgers University, New Jersey, USA, 1992.
-
(1992)
A Family of Generators of Minimal Perfect Hash Functions
-
-
Majewski, B.S.1
Wormald, N.C.2
Czech, Z.J.3
Havas, G.4
-
36
-
-
0004047313
-
-
Springer-Verlag, Berlin Heidelberg, New York, Tokyo
-
K. Mehlhorn. Data Structures and Algorithms 1: Sorting and Searching, volume 1. Springer-Verlag, Berlin Heidelberg, New York, Tokyo, 1984.
-
(1984)
Data Structures and Algorithms 1: Sorting and Searching
, vol.1
-
-
Mehlhorn, K.1
-
38
-
-
0025436178
-
Fast hashing of variable-length text strings
-
P.K. Pearson. Fast hashing of variable-length text strings. Communications of the ACM, 33 (1990) 677-680.
-
(1990)
Communications of the ACM
, vol.33
, pp. 677-680
-
-
Pearson, P.K.1
-
39
-
-
0022061262
-
A polynomial time generator for minimal perfect hash functions
-
T.J. Sager. A polynomial time generator for minimal perfect hash functions. Communications of the ACM, 28 (1985) 523-532.
-
(1985)
Communications of the ACM
, vol.28
, pp. 523-532
-
-
Sager, T.J.1
-
42
-
-
0025507834
-
The spatial complexity of oblivious k-probe hash functions
-
J.P. Schmidt and A. Siegel. The spatial complexity of oblivious k-probe hash functions. SIAM Journal on Computing, 19 (1990) 775-786.
-
(1990)
SIAM Journal on Computing
, vol.19
, pp. 775-786
-
-
Schmidt, J.P.1
Siegel, A.2
-
43
-
-
0024768554
-
On universal classes of fast high performance hash functions, their timespace trade-off, and their applications
-
A. Siegel. On universal classes of fast high performance hash functions, their timespace trade-off, and their applications. In 30th Annual Symposium on Foundations of Computer Science — FOCS'89, 20-25, 1989.
-
(1989)
30Th Annual Symposium on Foundations of Computer Science — FOCS'89
, pp. 20-25
-
-
Siegel, A.1
-
44
-
-
65749117216
-
On tape versus core: An application of space efficient hash functions to the invariance of space
-
Washington, DC
-
C. Slot and P. van Emde Boas. On tape versus core: An application of space efficient hash functions to the invariance of space. In 16th Annual ACM Symposium on Theory of Computing — STOC'84, 391-400, Washington, DC, 1984.
-
(1984)
16Th Annual ACM Symposium on Theory of Computing — STOC'84
, pp. 391-400
-
-
Slot, C.1
van Emde Boas, P.2
-
46
-
-
0017551771
-
Perfect hashing functions: A single probe retrieving method for static sets
-
R. Sprugnoli. Perfect hashing functions: A single probe retrieving method for static sets. Communications of the ACM, 20 (1977) 841-850.
-
(1977)
Communications of the ACM
, vol.20
, pp. 841-850
-
-
Sprugnoli, R.1
-
49
-
-
0345778997
-
Minimal perfect hashing in polynomial time
-
V.G. Winters. Minimal perfect hashing in polynomial time. BIT, 30 (1990) 235-244.
-
(1990)
BIT
, vol.30
, pp. 235-244
-
-
Winters, V.G.1
-
50
-
-
0021852532
-
A backtracking method for constructing perfect hash functions from a set of mapping functions
-
W.P. Yang and M.W. Du. A backtracking method for constructing perfect hash functions from a set of mapping functions. BIT, 25 (1985) 148-164.
-
(1985)
BIT
, vol.25
, pp. 148-164
-
-
Yang, W.P.1
Du, M.W.2
|