Constructing an optimal family of min-wise independent permutations

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E83-A, Issue 4, 2000, Pages 747-754

  Takei, Yoshinori ^a   Itoh, Toshiya ^a   Shinozaki, Takahiro ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Min wise independence; Optimal bound; P samplability; Permutations

Indexed keywords

MIN-WISE INDEPENDENT PERMUTATIONS;

ALGORITHMS; POLYNOMIALS; SET THEORY; WORLD WIDE WEB;

INDEXING (OF INFORMATION);

EID: 0033715518     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (6)

1. A.V. Aho, J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1975.
2. A.Z. Broder, " On the resemblance and containment of cocuments," Proc. Compression and Complexity of Sequences, pp.21-29, 1998.
3. A.Z. Broder, M. Charikar, A.M. Frieze, and M. Mitzenmacher, Min-Wise independent permutations, Proc. 30th Annual ACM Symposium on Theory of Computing, pp.327-336, 1998.
4. T. Itoh, Y, Takei, and J. Tarui, " On permutations with limited-independence," Proc. 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.137-146, 2000.
5. L.R. Graham, E.D. Knuth, and O. Patashnik, Concrete Mathematics, 2nd ed., Addison-Wesley, Reading, Mass., 1994.
6. K. Mulmuley, " Randomized geometric algorithms and pseudorandom generators," Algorithmica, vol.16, pp.450-463, 1996.