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

Random Structures and Algorithms

Volumn 31, Issue 3, 2007, Pages 384-389

  Alon, Noga ^a   Itoh, Toshiya ^b   Nagatani, Tatsuya ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^c MITSUBISHI ELECTRIC CORPORATION   (Japan)

Author keywords

Linear algebra method; Min wise independence; Resemblance

Indexed keywords

EID: 34948872732     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20184     Document Type: Article

References (13)

1. N. Alon, Problems and results in extremal combinatorics, I, Discrete Math 273, 31-53.
2. N. Alon, Perturbed identity matrices have high rank: Proof and applications, (to appear).
3. n, Geometric Funct Anal 13 (2003), 467-482.
4. A. Broder, "On the resemblance and containment of documents", In Proceedings of Compression and Complexity of Sequences, Palo Alto, CA, 1998, pp. 21-29.
5. A. Broder, M. Charikar, A. Frieze, and M. Mitzenmacher, Min-wise independent permutations, J Comput Sys Sci 60 (2000), 630-659.
6. P. Indyk, A small approximately min-wise independent family of hash functions, J Algorithms 38 (2001), 84-90.
7. T. Itoh, Y. Takei, and J. Tarui, On permutations with limited independence, In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, 2000, pp. 137-146.
8. T. Itoh, Y. Takei, and J. Tarui, On the sample size k-restricted min-wise independent permutations and other k-wise distributions, In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, San Diego, CA, 2003, pp. 710-719.
9. J. Matoušek and M. Stojaković, On restricted min-wise independence of permutations, Random Struct Algorithms 23 (2003), 397-408.
10. K. Mulmuley, Randomized geometric algorithms and pseudorandom generators, Algorithmica 16 (1996), 450-463.
11. S. Norin, A polynomial lower bound for the size of any k-min-wise independent set of permutation, Zapiski Nauchnyh Seminarov (POMI), Vol. 277, 2001, pp. 104-116, Available at http://www.pdmi.ras.ru/znsl/ (in Russian).
12. M. Saks, A. Srinivasan, S. Zhou, and D. Zuckerman, Low discrepancy sets yield approximate min-wise independent permutation families, Info Process Lett 73 (2000), 29-32.
13. J. Tarui, T. Itoh, and Y. Takei, A nearly linear size 4-min-wise independent permutation family by finite geometries, In Proceedings of RANDOM-APPROX'03, Lecture Notes in Computer Science 2764, Springer, 2003, pp. 396-408.