Publication:4941822

zbMath0949.60015MaRDI QIDQ4941822

David Zuckerman, Aravind Srinivasan, Shiyu Zhou, Michael E. Saks

Publication date: 3 December 2000

zbMATH Keywords

algorithm; explicit constructions; pseudorandom permutations; detection and filtering of near-duplicate documents; AltaVista Web index; approximate min-wise independent permutation families; low discrepancy sets for geometric rectangles

Mathematics Subject Classification ID

62G20: Asymptotic properties of nonparametric inference

60C05: Combinatorial probability

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68P20: Information storage and retrieval of data

Related Items

Derandomized constructions of \(k\)-wise (almost) independent permutations

Cites Work

• Unnamed Item
• Unnamed Item
• Notes on geometry
• On the construction of pseudorandom permutations: Luby-Rackoff revisited
• Efficient construction of a small hitting set for combinatorial rectangles in high dimension
• On a set of almost deterministic k-independent random variables
• Pseudorandomness for network algorithms
• A Simple Parallel Algorithm for the Maximal Independent Set Problem
• A fast and simple randomized parallel algorithm for the maximal independent set problem
• A fast parallel algorithm for the maximal independent set problem
• Finite Permutation Groups and Finite Simple Groups