scientific article; zbMATH DE number 1418345

MaRDI QIDQ4941908zbMATH OpenFDO

Authors Philipp Woelfel

Publication date 19 March 2000

zbMATH Keywords

hash families

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Combinatorial techniques for universal hashing
• On a family of universal hash functions
• Universal hash functions from exponential sums over finite fields and Galois rings
• New Universal Hash Functions
• Universal hashing and geometric codes

Cited in

(26)

• The computational complexity of universal hashing
• Combinatorial techniques for universal hashing
• 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
• 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
• MMH* with arbitrary modulus is always almost-universal
• Tiny families of functions with random properties: a quality-size trade-off for hashing (preliminary version)
• Universal hash functions from exponential sums over finite fields and Galois rings
• Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
• Uniform Hashing in Constant Time and Optimal Space
• A new multi-linear universal hash family
• scientific article; zbMATH DE number 3930363 (Why is no real title available?)
• Optimal hashing
• Tiny families of functions with random properties: A quality-size trade-off for hashing
• Computing and Combinatorics
• scientific article; zbMATH DE number 1445340 (Why is no real title available?)
• Strongly Constrained Discrete Hashing
• On a family of universal hash functions
• Polynomial hash functions are reliable (extended abstract)
• Interactive Hashing: An Information Theoretic Tool (Invited Talk)
• Universal Hashing via Integer Arithmetic Without Primes, Revisited
• Universal hashing based on field multiplication and (near-)MDS matrices
• HalftimeHash: modern hashing without 64-bit multipliers or finite fields
• Variationally universal hashing
• A construction method for optimally universal hash families and its consequences for the existence of RBIBDs

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)