Results 11 to 20 of about 118,403 (212)
A polynomial time generator for minimal perfect hash functions [PDF]
Communications of the ACM, 1985 A perfect hash function PHF is an injection F from a set W of M objects into the set consisting of the first N nonnegative integers where N ⩾ M. If N = M, then F is a minimal perfect hash function, MPHF. PHFs are useful for the compact storage and fast retrieval of frequently used objects such as reserved words in a programming language or commonly ...
Thomas J. Sager
semanticscholar +3 more sources
Efficient Cancelable Template Generation Based on Signcryption and Bio Hash Function
Axioms, 2022 Cancelable biometrics is a demanding area of research in which a cancelable template conforming to a biometric is produced without degrading the efficiency.
Vani Rajasekar +5 more
doaj +2 more sources
Partially perfect hash functions for intersecting families [PDF]
, 2018 Consider a large network with unknown number of nodes. Some of these nodes coordinate to perform tasks. The number of such coordination groups is also unknown. The only information about the network available is that any two coordinating groups share at least $t$ nodes.
Tapas Kumar Mishra
openalex +3 more sources
Parallel and External-Memory Construction of Minimal Perfect Hash Functions with PTHash [PDF]
IEEE Transactions on Knowledge and Data Engineering, 2021 A function $f : U \to \lbrace 0,\ldots,n-1\rbrace$f:U→{0,...,n-1} is a minimal perfect hash function for a set $S \subseteq U$S⊆U of size $n$n, if $f$f bijectively maps $S$S into the first $n$n natural numbers.
Giulio Ermanno Pibiri, Roberto Trani
openalex +3 more sources
GPERF : a perfect hash function generator [PDF]
, 1992 gperf is a widely available perfect hash function generator written in C++. It automates a common system software operation: keyword recognition. gperf translates an n element user-specified keyword list keyfile into source code containing a k element ...
Schmidt, Douglas C., Suda, Tatsuya
core +2 more sources
An informal analysis of perfect hash function search
Applied Mathematics Letters, 1989 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cercone, Nick, Krause, Max
openaire +2 more sources
Parallel and External-Memory Construction of Minimal Perfect Hash Functions With PTHash
IEEE Transactions on Knowledge and Data Engineering, 2023 Accepted by IEEE ...
Giulio Ermanno Pibiri, Roberto Trani
openalex +6 more sources
Practical minimal perfect hash functions for large databases [PDF]
Communications of the ACM, 1992 We describe the first practical algorithms for finding minimal perfect hash functions that have been used to access very large databases (i.e., having over 1 million keys). This method extends earlier work wherein an 0(n-cubed) algorithm was devised, building upon prior work by Sager that described an 0(n-to the fourth) algorithm.
Edward A. Fox +3 more
openalex +2 more sources
ENGINEERING COMPRESSED STATIC FUNCTIONS AND MINIMAL PERFECT HASH FUNCTIONS
, 2018 \emph{Static functions} are data structures meant to store arbitrary mappings from finite sets to integers; that is, given universe of items $U$, a set of $n \in \mathbb{N}$ pairs $(k_i,v_i)$ where $k_i \in S \subset U, |S|=n$, and $v_i \in \{0, 1, \ldots, m-1\} , m \in \mathbb{N} $, a static function will retrieve $v_i$ given $k_i$ (usually, in ...
Marco Genuzio
openalex +4 more sources
Comments on perfect hashing functions [PDF]
Communications of the ACM, 1979 Michael R. Anderson, Maija Anderson
openalex +3 more sources