In computer science, a perfect hash function h for a set S is a hash function that maps distinct elements in S to a set of m integers, with no collisions...
23 KB (2,908 words) - 00:02, 20 June 2025
Universal hashing – Technique for selecting hash functions Perfect hash function – Hash function without any collisions Injective map – Function that preserves...
9 KB (1,142 words) - 20:01, 19 June 2025
output. The values returned by a hash function are called hash values, hash codes, (hash/message) digests, or simply hashes. The values are usually used to...
50 KB (7,455 words) - 07:54, 7 July 2025
data type that maps keys to values. A hash table uses a hash function to compute an index, also called a hash code, into an array of buckets or slots...
54 KB (6,078 words) - 03:50, 19 June 2025
dynamic perfect hashing is a programming technique for resolving collisions in a hash table data structure. While more memory-intensive than its hash table...
13 KB (1,600 words) - 10:18, 27 May 2025
universal hashing (in a randomized algorithm or data structure) refers to selecting a hash function at random from a family of hash functions with a certain...
29 KB (4,908 words) - 10:51, 16 June 2025
adjusted so that those inputs yield distinct hash values, producing what is called a perfect hash function. Two input strings differing by exactly one...
4 KB (511 words) - 17:23, 17 December 2024
Succinct data structure (redirect from Succinct hash table)
perfect hash function, and can be implemented using as few as O ( m log log log n ) {\displaystyle O(m\log \log \log n)} bits. A succinct hash table...
19 KB (2,896 words) - 22:44, 19 June 2025
the perfect hash function. Using a minimum perfect hash function gives a big space improvement if the associated values are relatively small. Hashed filters...
10 KB (1,514 words) - 14:40, 29 July 2024
Bitboard (section Direct hashing)
squares (~bits in the corresponding hash function). As with other schemes which require a perfect hashing function, an exhaustive process of enumeration...
23 KB (3,016 words) - 19:50, 14 June 2025
non-cryptographic hash functions (NCHFs) are hash functions intended for applications that do not need the rigorous security requirements of the cryptographic hash functions...
7 KB (796 words) - 00:45, 28 April 2025
Lamport signature (category Hash-based cryptography)
be built from any cryptographically secure one-way function; usually a cryptographic hash function is used. Although the potential development of quantum...
13 KB (2,017 words) - 21:47, 26 November 2024
Cuckoo hashing is a scheme in computer programming for resolving hash collisions of values of hash functions in a table, with worst-case constant lookup...
23 KB (2,591 words) - 09:19, 30 April 2025
alternative rock band from Auckland, New Zealand Perfect hash function, a set of hash functions which generate no collisions. Potentially Hazardous Food...
1 KB (165 words) - 13:11, 30 June 2025
2 n {\displaystyle 2n} . Hash function Dynamic perfect hashing Daniel Roche (2013). SI486D: Randomness in Computing, Hashing Unit. United States Naval...
3 KB (449 words) - 00:07, 19 November 2023
used for: dynamic perfect hashing; even if the adversary can change the key-distribution depending on the values the hashing function has assigned to the...
8 KB (1,021 words) - 19:33, 30 June 2025
to cryptographic hash functions, which are designed to have significantly different hashes for even minor differences. Fuzzy hashing has been used to...
9 KB (815 words) - 07:57, 6 January 2025
SUHA (computer science) (category Hashing)
that a hypothetical hashing function will evenly distribute items into the slots of a hash table. Moreover, each item to be hashed has an equal probability...
4 KB (527 words) - 21:15, 15 December 2020
their nesting GNU Fontutils – font management utilities GNU gperf – perfect hash function generator GNU indent – program to indent C and C++ source code GNU...
24 KB (2,074 words) - 04:46, 7 March 2025
duplicates of a relatively small number of items, a constant-time perfect hash function can greatly speed up finding where to put an item1, turning the...
8 KB (918 words) - 15:58, 25 February 2025
system can be linked against it as well. During the chroot phase, bash's hashing feature is turned off and the temporary toolchain's bin directory moved...
29 KB (1,349 words) - 21:54, 25 May 2025
values of a hash function, with H = 2 l {\textstyle H=2^{l}} . With a birthday attack, it is possible to find a collision of a hash function with 50 % {\textstyle...
18 KB (2,307 words) - 08:59, 29 June 2025
computer science, a family of hash functions is said to be k-independent, k-wise independent or k-universal if selecting a function at random from the family...
15 KB (2,001 words) - 14:49, 17 October 2024
A distributed hash table (DHT) is a distributed system that provides a lookup service similar to a hash table. Key–value pairs are stored in a DHT, and...
36 KB (4,182 words) - 01:23, 10 June 2025
occupancy bits in the masked portion. One such scheme that uses a perfect hash function along with tricks to minimize the potential size of the table that...
12 KB (1,734 words) - 11:56, 11 March 2024
Bloom filter (category Hash-based data structures)
different bit-fields of such a hash, so this type of hash can be used to generate multiple "different" hash functions by slicing its output into multiple...
90 KB (10,788 words) - 04:12, 30 June 2025
|S|=k} , there exists a hash function h in F such that h : S → {1, ..., k} is perfect. In other words, there must exist a hash function in F that colors any...
13 KB (1,988 words) - 17:58, 17 November 2024
Proof of work (redirect from List of proof-of-work functions)
Cycle Merkle tree–based Guided tour puzzle protocol partial match od a hash function[citation needed] At the IACR conference Crypto 2022 researchers presented...
37 KB (4,073 words) - 04:05, 16 June 2025
Hopscotch hashing is a scheme in computer programming for resolving hash collisions of values of hash functions in a table using open addressing. It is...
7 KB (928 words) - 14:47, 18 December 2024
for 32-bit ctz uses de Bruijn sequences to construct a minimal perfect hash function that eliminates all branches. This algorithm assumes that the result...
44 KB (4,072 words) - 12:39, 29 June 2025