Results 131 to 140 of about 76,072 (189)
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 +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A perfect hash function for image database indexing
Proceedings of the 1994 ACM symposium on Applied computing - SAC '94, 1994C. Sabharwal, S. Bhatia
semanticscholar +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
A fast implementation of a perfect hash function for picture objects
Pattern Recognition, 1994 Sanjiv Bhatia, Chaman L. Sabharwal
openalex +2 more sources
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
MOVE GENERATION WITH PERFECT HASH FUNCTIONS [PDF]
ICGA Journal, 2008 We present two new perfect hashing schemes that can be used for efficient bitboard move generation for sliding pieces in chess-like board games without the need to use rotated bitboards. Moreover, we show that simple variations of these schemes give minimal perfect hashing schemes.
Fenner, Trevor, Levene, Mark
openaire +1 more source
Lexicon design using perfect hash functions
ACM SIGSOC Bulletin, 1981The 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
openaire +1 more source
Generating a Rotation Reduction Perfect Hashing Function
Mathematics Magazine, 1995 Arlene Blasius
openalex +2 more sources
Perfect hashing functions for hardware applications
[1991] Proceedings. Seventh International Conference on Data Engineering, 2002Perfect 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 ...
M.V. Ramakrishna, G.A. Portice
openaire +1 more source