Universal hashing and k-wise independent random variables via integer arithmetic without primes
From MaRDI portal
Publication:4593961
DOI10.1007/3-540-60922-9_46zbMath1379.68104OpenAlexW1546441687MaRDI QIDQ4593961
Publication date: 16 November 2017
Published in: STACS 96 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-60922-9_46
Data structures (68P05) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items
Improved bounds for dictionary look-up with one error ⋮ Sample(x)=(a*x<=t) Is a Distinguisher with Probability 1/8 ⋮ Exact Weight Subgraphs and the k-Sum Conjecture ⋮ The universality of iterated hashing over variable-length strings ⋮ Universal Hashing via Integer Arithmetic Without Primes, Revisited ⋮ Unnamed Item ⋮ A subquadratic algorithm for 3XOR ⋮ Fingerprints for highly similar streams ⋮ Subquadratic algorithms for 3SUM ⋮ Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication ⋮ The circulant hash revisited ⋮ Optimal Las Vegas reduction from one-way set reconciliation to error correction ⋮ Generation of \(k\)-wise independent random variables with small randomness ⋮ Bounds on the OBDD-size of integer multiplication via universal hashing ⋮ 3SUM, 3XOR, triangles
This page was built for publication: Universal hashing and k-wise independent random variables via integer arithmetic without primes
