Algoritmos de espaço quase ótimo para hashing perfeito
=== A perfect hash function (PHF) h : S [0, m 1] for a key set S U of size n, where m n and U is a key universe, is an injective function that maps the keys of S to unique values. A minimal perfect hash function (MPHF) is a PHF with m = n, the smallest possible range. Minimal perfect hash funct...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | Portuguese |
| Published: |
Universidade Federal de Minas Gerais
2008
|
| Online Access: | http://hdl.handle.net/1843/RVMR-7LAMRS |