On (ε,k)‐min‐wise independent permutations

DOI10.1002/rsa.20184zbMath1143.68498OpenAlexW4244204710MaRDI QIDQ5433268

Tatsuya Nagatani, Noga Alon, Toshiya Itoh

Publication date: 8 January 2008

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20184

zbMATH Keywords

resemblancemin-wise independencelinear algebra method

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Combinatorial probability (60C05)

Related Items (2)

Perturbed Identity Matrices Have High Rank: Proof and Applications ⋮ Sets of unit vectors with small subset sums

Cites Work

• Randomized geometric algorithms and pseudorandom generators
• Perturbed Identity Matrices Have High Rank: Proof and Applications
• On the sample size of k -restricted min-wise independent permutations and other k -wise distributions
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
• Unnamed Item

This page was built for publication: On (ε,k)‐min‐wise independent permutations