scientific article; zbMATH DE number 1418345
From MaRDI portal
Recommendations
Cited in
(25)- HalftimeHash: modern hashing without 64-bit multipliers or finite fields
- scientific article; zbMATH DE number 1445340 (Why is no real title available?)
- Computing and Combinatorics
- MMH* with arbitrary modulus is always almost-universal
- Universal Hashing via Integer Arithmetic Without Primes, Revisited
- Strongly Constrained Discrete Hashing
- Variationally universal hashing
- Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
- A construction method for optimally universal hash families and its consequences for the existence of RBIBDs
- Universal hash functions from exponential sums over finite fields and Galois rings
- Tiny families of functions with random properties: a quality-size trade-off for hashing (preliminary version)
- Universal hashing based on field multiplication and (near-)MDS matrices
- The computational complexity of universal hashing
- Polynomial hash functions are reliable (extended abstract)
- On perfect hashing of numbers with sparse digit representation via multiplication by a constant
- A trade-off between collision probability and key size in universal hashing using polynomials
- On a family of universal hash functions
- Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication
- Bounds on the OBDD-size of integer multiplication via universal hashing
- scientific article; zbMATH DE number 3930363 (Why is no real title available?)
- Interactive Hashing: An Information Theoretic Tool (Invited Talk)
- Combinatorial techniques for universal hashing
- A new multi-linear universal hash family
- Uniform Hashing in Constant Time and Optimal Space
- Optimal hashing
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4941908)
