Results 151 to 160 of about 118,403 (212)
Some of the next articles are maybe not open access.
A perfect hash function for Ada reserved words
ACM SIGAda Ada Letters, 1984A fast perfect hash function is presented which allows the 63 Adat reserved words to be differentiated quickly from other Ada identifiers. Such functions are potentially useful in improving the performance of software that processes the text of Ada programs.
D. Wolverton
openaire +2 more sources
On the program size of perfect and universal hash functions
23rd Annual Symposium on Foundations of Computer Science (sfcs 1982), 1982 We address the question of program size of of perfect and universal hash functions. We prove matching upper and lower bounds (up to constant factors) on program size. Furthermore, we show that minimum or nearly minimum size programs can be found efficiently.
Kurt Mehlhorn
openalex +2 more sources
Direct Perfect Hashing Functions for External Files
Journal of Database Management, 1991 A file organization scheme based on composite perfect hashing, which guarantees single access retrieval from external files has been proposed recently. The ideal retrieval performance is achieved by using an auxiliary internal table and direct perfect hashing.
M. Ramakrishna, Yuchi Bannai
openalex +2 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.
N. Cercone, John Boates, Max Krause
openalex +2 more sources
Design Strategies for Minimal Perfect Hash Functions
, 2007 A minimal perfect hash function h for a set S ⊆ U of size n is a function h:U → {0,. . ., n-1} that is one-to-one on S. The complexity measures of interest are storage space for h, evaluation time (which should be constant), and construction time. The talk gives an overview of several recent randomized constructions of minimal perfect hash functions ...
Martin Dietzfelbinger
openalex +2 more sources
A scheme for constructing ordered minimal perfect hashing functions
Information Sciences, 1986 This paper describes a method to be used for the organization and retrieval of data. Jaeschke proposed the function \(h(k)=\lfloor C/(Dk+E)\rfloor mod n\), where n is the size of a given key set, for constructing minimal perfect hashing functions.
Chia‐Chen Chang
openalex +2 more sources
Minimal and Monotone Minimal Perfect Hash Functions
International Symposium on Mathematical Foundations of Computer Science, 2015A minimal perfect hash function (MPHF) is a (data structure providing a) bijective map from a set S of n keys to the set of the first n natural numbers. In the static case (i.e., when the set S is known in advance), there is a wide spectrum of solutions available, offering different trade-offs in terms of construction time, access time and size of the ...
P. Boldi
openaire +2 more sources
Perfect Hash-Based Routing Lookup for LEO Constellation Backbone Network
IEEE Transactions on Aerospace and Electronic Systems, 2023The performance of packet forwarding mainly relies on the routing lookup (RL) in high-speed routers and switches. Due to the network topology change and the limited resource on aerospace devices, the RL strategy for low Earth orbiting (LEO) constellation
Keran Zhang +4 more
semanticscholar +1 more source
IEEE Transactions on Circuits and Systems Part 1: Regular Papers, 2022
We have developed a method of secret-key exchange assisted by a secure hash algorithm for a stream cipher based on the augmented Lorenz map as a high-dimensional chaotic map.
Koshiro Onuki +3 more
semanticscholar +1 more source
We have developed a method of secret-key exchange assisted by a secure hash algorithm for a stream cipher based on the augmented Lorenz map as a high-dimensional chaotic map.
Koshiro Onuki +3 more
semanticscholar +1 more source