### Table 1: Bounds on the Size of Perfect Hash Families

2004

"... In PAGE 5: ...heorems 2.2 and 2.3 is stronger, however. Therefore, we present some numerical results in Table1 to compare the bounds for specific parameters. The expurgation method seems to yield the best bounds in practice, at least for the parameters we considered.... ..."

Cited by 3

### Table 1: Bounds on the Size of Perfect Hash Families

2004

"... In PAGE 5: ...heorems 2.2 and 2.3 is stronger, however. Therefore, we present some numerical results in Table1 to compare the bounds for specific parameters. The expurgation method seems to yield the best bounds in practice, at least for the parameters we considered.... ..."

Cited by 3

### Table 1. Examples of quot;m-almost-universal hash families

"... In PAGE 12: ...i.e, number elds or function elds), we have unique factorizations in prime ideals [20]. For the more general case of the noetherian rings (like multivariate polynomial algebras), we have a similar result for primary decomposition in maximal ideals [19]. Let Fq be a nite eld and log2 q = n, we give examples of such a construction in Table1 and, for each of them, an approximation ~ quot;m of the corresponding collision bound quot;m. Table 1.... ..."

### Table 1: Constructions for Hash Families hash family N n m source

1996

Cited by 10

### Table 4: Small values of q for which optimal linear (q2, q, 5)-perfect hash families S = {[1, s], [1, u], [1, v], [1, w], [1, x], [1, y], [1, z], [1, i]} exist. q s, u, v, w, x, y, z i

2006

"... In PAGE 26: ... It seems likely that using a different starting suitable sequence may lead to examples of optimal linear (q2, q, 5)-perfect hash families for q lt; 311. For the interested reader, Table4 lists constructions for the smallest values of q for which we found examples. Table 4: Small values of q for which optimal linear (q2, q, 5)-perfect hash families S = {[1, s], [1, u], [1, v], [1, w], [1, x], [1, y], [1, z], [1, i]} exist.... ..."

### Table II. Summary of the 4 n-gram hash families implemented. Recall that we chose p(x) = x19 +x18 +x17 + x16 +x12 +x7 +x6 +x5 +x3 +x2 +1 (GENERAL). hash family definition (h(a1;a2;:::;an)) recursive independence

705

### Table 1. Synthesis Results and Comparison of SHA2 Family Hashes

2007

"... In PAGE 11: ... We synthesized SHA2 for an ASIC by Synopsys Design Vision using a 0.13 m standard cell library whose results and a comparison with other works are shown in Table1... ..."

Cited by 1

### Table 2: Bounds for Hash Families hash family bound source

1996

Cited by 10

### Table 5 NLSY Half-Sibling Sample Estimates of the Effect of Family Structure on Educational Outcomes

"... In PAGE 23: ...For all schooling outcomes, children living in intact families have substantially and significantly higher mean outcomes than any other family structure. In Table5 , we estimate two models of family structure using the stable blended- family sample.11 Model (A) is a parsimonious model where family structure is measured as years outside of an intact family (nonintact); the specification is appealing in part because we only have 135 observations.... In PAGE 23: ... For each outcome, the first two columns are OLS specifications and the next two columns are fixed effects specifications. In the first OLS specification, Model (A), the normalized 11 Only three of the four schooling outcomes are presented in Table5 because only 4 individuals in the... ..."

### Table 1: Comparison of the proposed construction and the traditional approach. One unit is one hashing operation. # ops # ops to hash security security

2005

"... In PAGE 2: ... Assuming that the m-bit value Y above is randomly chosen, then if the best approach for finding preimages for the hash function H is a brute-force attack, then so is the best approach for find- ing preimages for the proposed construction based on H. Table1 lists the properties of the proposed construction. 3 Example A popular hash function is Secure Hash Algorithm (SHA) [2].... ..."