Results 21 to 30 of about 44,364 (200)
A Linear Time Algorithm for Finding Minimal Perfect Hash Functions [PDF]
The Computer Journal, 1993 Summary: A new algorithm for finding minimal perfect hash functions (MPHF) is proposed. The algorithm given three pseudorandom functions \(h_ 0\), \(h_ 1\) and \(h_ 2\), searches for a function \(g\) such that \(F(w)=(h_ 0(w)+g(h_ 1(w))+g(h_ 2(w))) \bmod m\) is a MPHF, where \(m\) is a number of input words.
Zbigniew J. Czech
openalex +2 more sources
Perfect hashing functions [PDF]
Communications of the ACM, 1977 A refinement of hashing which allows retrieval of an item in a static table with a single probe is considered. Given a set I of identifiers, two methods are presented for building, in a mechanical way, perfect hashing functions, i.e. functions transforming the elements of I into unique addresses.
Renzo Sprugnoli
openalex +4 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 +3 more sources
Order-preserving minimal perfect hash functions and information retrieval [PDF]
ACM Transactions on Information Systems, 1991 Rapid access to information is essential for a wide variety of retrieval systems and applications. Hashing has long been used when the fastest possible direct search is desired, but is generally not appropriate when sequential or range searches are also required.
Edward A. Fox +3 more
openalex +4 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.
Mark Levene, Trevor Fenner
openaire +2 more sources
Secure Authentication in the Smart Grid
Mathematics, 2022 Authenticated key agreement is a process in which protocol participants communicate over a public channel to share a secret session key, which is then used to encrypt data transferred in subsequent communications.
Mehdi Hosseinzadeh +4 more
doaj +1 more source
BMC Bioinformatics, 2021 Background Specialized data structures are required for online algorithms to efficiently handle large sequencing datasets. The counting quotient filter (CQF), a compact hashtable, can efficiently store k-mers with a skewed distribution.
Moustafa Shokrof +2 more
doaj +1 more source
A Secure Blockchain-Based Authentication and Key Agreement Scheme for 3GPP 5G Networks
Sensors, 2022 The futuristic fifth-generation cellular network (5G) not only supports high-speed internet, but must also connect a multitude of devices simultaneously without compromising network security.
Man Chun Chow, Maode Ma
doaj +1 more source
Constructing Minimal Perfect Hash Functions Using SAT Technology
Proceedings of the AAAI Conference on Artificial Intelligence, 2020 Minimal perfect hash functions (MPHFs) are used to provide efficient access to values of large dictionaries (sets of key-value pairs). Discovering new algorithms for building MPHFs is an area of active research, especially from the perspective of storage efficiency. The information-theoretic limit for MPHFs is 1/ln 2 ≈ 1.44 bits per key.
Sean Weaver, Marijn J. H. Heule
openalex +4 more sources
Analyzing execution path non-determinism of the Linux kernel in different scenarios
Connection Science, 2023 Safety-critical systems play a significant role in industrial domains, and their complexity is increasing with advanced technologies such as Artificial Intelligence (AI).
Yucong Chen +5 more
doaj +1 more source