𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Universal classes of hash functions

✍ Scribed by J.Lawrence Carter; Mark N. Wegman

Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
851 KB
Volume
18
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A combinatorial characterization of cert
A combinatorial characterization of certain universal classes of hash functions
✍ Tran van Trung πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 303 KB

## Abstract A new lower bound on the size of ϡ‐almost strongly universal~2~ classes of hash functions has recently been obtained by Stinson [8]. In this article we present a characterization of Ο΅ βˆ’ ASU~2~ classes of hash functions meeting the Stinson bound in terms of combinatorial designs. Β© 1994

Symmetry Classes of Functions
Symmetry Classes of Functions
✍ N. Metropolis; G.C. Rota; J.A. Stein πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 848 KB
Density of universal classes of series-p
Density of universal classes of series-parallel graphs
✍ Jaroslav NeΕ‘etΕ™il; Yared Nigussie πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 169 KB πŸ‘ 1 views

## Abstract A class of graphs ${\cal C}$ ordered by the homomorphism relation is __universal__ if every countable partial order can be embedded in ${\cal C}$. It is known (see [1,3]) that the class $\cal C\_{k}$ of __k__‐colorable graphs, for any fixed ${k}\geq 3 $, induces a universal partial orde

A Small Approximately Min-Wise Independe
A Small Approximately Min-Wise Independent Family of Hash Functions
✍ Piotr Indyk πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 73 KB

In this paper we give a construction of a small approximately min-wise independent family of hash functions, i.e., a family of hash functions such that for any set of arguments X and x ∈ X, the probability that the value of a random function from that family on x will be the smallest among all value