scientific article; zbMATH DE number 1418345

zbMATH Open0955.68035MaRDI QIDQ4941908FDOQ4941908

Philipp Woelfel

Publication date: 19 March 2000

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

hash families

Mathematics Subject Classification ID

Data structures (68P05)

Cited In (16)

• Title not available (Why is that?)
• Computing and Combinatorics
• HalftimeHash: modern hashing without 64-bit multipliers or finite fields
• Universal Hashing via Integer Arithmetic Without Primes, Revisited
• Strongly Constrained Discrete 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
• The computational complexity of universal hashing
• On perfect hashing of numbers with sparse digit representation via multiplication by a constant
• 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
• Title not available (Why is that?)
• Interactive Hashing: An Information Theoretic Tool (Invited Talk)
• Combinatorial techniques for universal hashing
• 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)