Universal hashing and k-wise independent random variables via integer arithmetic without primes
- 1 January 1996
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 567-580
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Dynamic Perfect Hashing: Upper and Lower BoundsSIAM Journal on Computing, 1994
- Addendum to “simple constructions of almost k‐wise independent random variables”Random Structures & Algorithms, 1993
- Simple Constructions of Almost k‐wise Independent Random VariablesRandom Structures & Algorithms, 1992
- On the power of two-point based samplingJournal of Complexity, 1989
- A Simple Parallel Algorithm for the Maximal Independent Set ProblemSIAM Journal on Computing, 1986
- Log Depth Circuits for Division and Related ProblemsSIAM Journal on Computing, 1986
- A fast parallel algorithm for the maximal independent set problemJournal of the ACM, 1985
- Storing a Sparse Table with 0 (1) Worst Case Access TimeJournal of the ACM, 1984
- Data Structures and Algorithms 11984
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979