On the sample size of k-restricted min-wise independent permutations and other k-wise distributions

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 710-719

  Itoh, Toshiya ^a   Takei, Yoshinori ^b   Tarui, Jun ^c  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^b NAGAOKA UNIVERSITY OF TECHNOLOGY   (Japan)

^c UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

Author keywords

Higher Incidence Matrices; k Wise Independence; Linear Algebra Methods; Min Wise Independent Permutations

Indexed keywords

ALGEBRA; ALGORITHMS; MATRIX ALGEBRA; PROBABILITY DISTRIBUTIONS; SET THEORY;

PERMUTATIONS;

COMPUTATION THEORY;

EID: 0038784483     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780642.780645     Document Type: Conference Paper

References (22)

1. N. Alon, L. Babai, and A. Itai. A fast and simple randomized parallel algorithm for the maximal independent set problem. J. of Algorithms, 7:567-583, 1986.
2. N. Alon, J. Spencer, and P. Erdos. The Probabilistic Method. John Wiley & Sons, 1st edition, 1992.
3. A. Broder. On the resemblance and containment of documents. In Proc. of Compression and Complexity of Sequences, pages 21-29. IEEE Computer Society, 1998.
4. A. Broder, M. Charikar, A. Frieze, and M. Mitzenmacher. Min-wise independent permutations. J. Comput. Syst. Sci., 60:630-659, 2000; a preliminary version appeared in: Proc. of 30th STOC, pages 327-336, 1998.
5. A. Broder, M. Charikar, A. Frieze, and M. Mitzenmacher. Min-wise independent permutations. J. Comput. Syst. Sci., 60:630-659, 2000; a preliminary version appeared in: Proc. of 30th STOC, pages 327-336, 1998.
6. A. Broder, M. Charikar, and M. Mitzenmacher. A derandomization using min-wise independent permutations. In Lecture Notes in Computer Science vol. 1518: Proc. of RANDOM'98, pages 15-24. Springer, 1998.
7. A. Broder and M. Mitzenmacher. Completeness and robustness properties of min-wise independent permutations. Random Structures & Algorithms, 18:18-30, 2001.
8. I. Chakravarti. Fractional replication in asymmetrical factorial designs and partially balanced arrays. Sankhyā, 17 (Part 2):143-164, 1956.
9. B. Chor, O. Goldreich, J. Håstad, J. Freidmann, S. Rudich, and R. Smolensky. The bit extraction problem or t-resilient functions. In Proc. of 26th FOCS, pages 396-407, 1985.
10. R. Graham, D. Knuth, and O. Patashnik. Concrete Mathematics: A Foundation of Computer Science. Addison-Wesley, 1994.
11. T. Itoh, Y. Takei, and J. Tarui. On permutations with limited independence. In Proc. of 11th SODA, pages 137-146, 2000.
12. M. Luby and A. Wigderson. Pairwise independence and derandomization. Technical Report TR-95-035, International Computer Science Institute, 1995.
13. J. Matousěk and M. Stojaković. On restricted min-wise independence of permutations. Preprint. http://kam.mff.cuni.cz/̃matousek/preprints.html/, Nov. 21, 2002.
14. K. Mulmuley. Randomized geometric algorithms and pseudorandom generators. Algorithmica, 16:450-463, 1996.
15. M. Naor and M. Yung. Universal one-way hash functions and their cryptographic applications. In Proc. of 21st STOC, pages 33-43, 1989.
16. S. Norin. A polynomial lower bound for the size of any k-min-wise independent set of permutation. Zapiski Nauchnyh Seminarov POMI, 277:104-116, 2001(in Russian), http://www.pdmi.ras.ru/znsl/.
17. C. Rao. Factorial experiments derivable from combinatorial arrangements of arrays. J. Roy. Statist. Soc. (Suppl.), 9:128-139, 1947.
18. D. Ray-Chaudhuri and R. Wilson. On t-design. Osaka J. Math, 12:737-744, 1975.
19. J. Srivastava. Some general existence conditions for balanced arrays of strength t and 2 symbols. J. Combinatorial Theory, (A) 13:198-206, 1972.
20. M. Tsetlin. Finite automata and models of simple forms of behavior. Russian Math. Surv., 18:1-27, 1963.
21. J. van Lint and R. Wilson. A course in Combinatorics. Cambridge Univ. Press, 2nd edition, 2001.
22. M. Wegman and J. Carter. New hash functions and their use in authentication and set equality. J. Comput. Syst. Sci., 22:265-279, 1981.