Pages that link to "Item:Q6163629"
From MaRDI portal
The following pages link to Universal Hashing via Integer Arithmetic Without Primes, Revisited (Q6163629):
Displaying 4 items.
- MMH* with arbitrary modulus is always almost-universal (Q269733) (← links)
- HalftimeHash: modern hashing without 64-bit multipliers or finite fields (Q832844) (← links)
- The computational complexity of universal hashing (Q1208411) (← links)
- On the Minimum Number of Multiplications Necessary for Universal Hash Functions (Q2946925) (← links)