scientific article; zbMATH DE number 1418263

zbMath0949.60015MaRDI QIDQ4941822

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

Publication date: 3 December 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithmexplicit constructionspseudorandom permutationsdetection and filtering of near-duplicate documentsAltaVista Web indexapproximate min-wise independent permutation familieslow discrepancy sets for geometric rectangles

Mathematics Subject Classification ID

Asymptotic properties of nonparametric inference (62G20) Combinatorial probability (60C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Information storage and retrieval of data (68P20)

Related Items (1)

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

This page was built for publication: