Results 161 to 170 of about 118,403 (212)

Minimal and almost minimal perfect hash function search with application to natural language lexicon design

, 1983
Nick Cercone, Max Krause, John Boates
openalex   +2 more sources

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

A fast implementation of a perfect hash function for picture objects

Pattern Recognition, 1994
Sanjiv Bhatia, Chaman L. Sabharwal
openalex   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

SAPFS: An Efficient Symmetric-Key Authentication Key Agreement Scheme With Perfect Forward Secrecy for Industrial Internet of Things

IEEE Internet of Things Journal, 2023
An edge-cloud Industrial Internet of Things (IIoT) can help meet the computing requirements of industrial applications, particularly in time and latency-sensitive services.
Yunru Zhang, De-biao He, P. Vijayakumar, Min Luo, Xinyi Huang   +4 more
semanticscholar   +1 more source

Fingerprinting-based Minimal Perfect Hashing Revisited

ACM Journal of Experimental Algorithmics, 2023
In this paper we study a fingerprint-based minimal perfect hash function (FMPH for short). While FMPH is not as space-efficient as some other minimal perfect hash functions (for example RecSplit, CHD, or PTHash), it has a number of practical advantages ...
Piotr Beling
semanticscholar   +1 more source

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 ...
M.V. Ramakrishna, G.A. Portice
openaire   +1 more source

A Transparent Zero-Knowledge Dual Membership Set Commitment based on Perfect Hash Function

International Symposium on Computing and Networking - Across Practical Development and Theoretical Research
Verifying a secret element’s (non-)membership status to a private set is challenging yet valuable for access control and verifiable computing applications.
Keyang Liu, Tsuyoshi Takagi
semanticscholar   +1 more source

The Quantum Resistant Cryptographic Algorithm Based on OTP Cipher and Hash Function

2024 IEEE International Conference on Consumer Electronics-Asia (ICCE-Asia)
The article proposes a new quantum-resistant cryptographic algorithm constructed based on the OTP (One-Time Pad) cipher and a hash function. By inheriting the property of “perfect secrecy” from the OTP cipher, the proposed algorithm can resist various ...
L. H. Dung, T. Duc, Tuan Nguyen Kim, Nong Phuong Trang   +3 more
semanticscholar   +1 more source

Perfect hash functions for large dictionaries

Proceedings of the ACM first workshop on CyberInfrastructure: information management in eScience, 2007
We describe a new practical algorithm for finding perfect hash functions with no specification space at all, suitable for key sets ranging in size from small to very large. The method is able to find perfect hash functions for various sizes of key sets in linear time.
openaire   +1 more source

Reciprocal hashing

Communications of the ACM, 1981
A method is presented for building minimal perfect hash functions, i.e., functions which allow single probe retrieval from minimally sized tables of identifier sets. A proof of existence for minimal perfect hash functions of a special type (reciprocal type) is given.
openaire   +2 more sources