Results 141 to 150 of about 44,364 (200)

MOFChecker: a package for validating and correcting metal-organic framework (MOF) structures.

Digit Discov
Jin X, Jablonka KM, Moubarak E, Li Y, Smit B.   +4 more
europepmc   +1 more source

An informal analysis of perfect hash function search

Applied Mathematics Letters, 1989
AbstractA brief explanation of perfect hash function search is presented followed by an informal analysis of the problem.
Nick Cercone, Max Krause
openalex   +3 more sources

Lexicon design using perfect hash functions

ACM SIGSOC Bulletin, 1981
The research reported in this paper derives from the recent algorithm of Cichelli (1980) for computing machine-independent, minimal perfect hash functions of the form:hash value: hash key length + associated value of the key's first letter + associated value of the key's last letterA minimal perfect hash function is one which provides single probe ...
Nick Cercone, Max Krause, John Boates
openalex   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

Collections of Functions for Perfect Hashing

SIAM Journal on Computing, 1986
Summary: Hashing techniques for accessing a table without searching it are usually designed to perform efficiently on the average over all possible contents of the table. If the table contents are known in advance, we might be able to choose a hashing function with guaranteed efficient (worst-case) performance.
Berman, Francine, Bock, Mary Ellen, Dittert, Eric, O'Donnell, Michael J., Plank, Darrell   +4 more
openaire   +3 more sources

Reducing the storage requirements of a perfect hash function

IEEE Transactions on Knowledge and Data Engineering, 1998
The amount of memory required by perfect hash functions at retrieval time is one of the primary issues to be taken into account when looking for such functions. This paper gives empirical evidence about the effectiveness of a strategy that is suitable for significantly reducing the memory requirements of the order-preserving minimal perfect hash ...
DI FELICE, Paolino, U. MADAMA
openaire   +3 more sources

Perfect hashing functions for hardware applications

[1991] Proceedings. Seventh International Conference on Data Engineering, 2002
Perfect hashing functions are determined that are suitable for hardware implementations. A trial-and-error method of finding perfect hashing functions is proposed using a simple universal/sub 2/ class (H/sub 3/) of hashing functions. The results show that the relative frequency of perfect hashing functions within the class H/sub 3/ is the same as ...
G.A. Portice, M.V. Ramakrishna
openaire   +2 more sources

On the Size of Separating Systems and Families of Perfect Hash Functions

SIAM Journal on Algebraic Discrete Methods, 1984
This paper presents two applications of an interesting information theoretic theorem about graphs. The first application concerns the derivation of good bounds for the function $Y(b,k,n)$, which is defined to be the minimum size of a family of functions such that for every subset of size k from an n element universe, there exists a perfect hash ...
Michael L. Fredman, János Komlós
openalex   +3 more sources

Monotone Minimal Perfect Hash Functions

2014
Problem Formulation Let Œx denote the set of the first x natural numbers. Given a positive integer u D 2, and a set S Œu with jS j D n, a function h W S ! Œm is perfect if and only if it is injective and minimal if and only if m D n. An (M)PHF is a data structure that allows one to evaluate a (minimal) perfect function of this kind.
P. Boldi, S. Vigna
openaire   +3 more sources

An Interactive System for Finding Perfect Hash Functions

IEEE Software, 1985
The interactive implementation of this hash function algorithm presents several examples of large lexicon design, illustrating how the minimality criterion and execution efficiency can vary when various problem parameters are adjusted.
John Boates, Max Krause, Nick Cercone
openaire   +2 more sources