On Restricted Min-Wise Independence of Permutations

Random Structures and Algorithms

Volumn 23, Issue 4, 2003, Pages 397-408

  Matoušek, Jiří ^a,b   Stojaković, Miloš ^b,c  

^a CHARLES UNIVERSITY   (Czech Republic)

^b ETH ZURICH   (Switzerland)

^c UNIVERSITY OF NOVI SAD   (Serbia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0345149763     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10101     Document Type: Article

References (19)

1. N. Alon, L. Babai, and A. Itai, A fast and simple randomized parallel algorithm for the maximal independent set problem, J Algorithms 7 (1986), 567-583.
2. L. Babai and P. Frankl, Linear algebra methods in combinatorics (preliminary version 2), Department of Computer Science, The University of Chicago, Chicago, 1992.
3. A. Z. Broder, M. Charikar, A. M. Frieze, and M. Mitzenmacher, Min-wise independent permutations, J Comput System Sci 60 (2000), 630-659 [preliminary version, Proc 30th Annu ACM Symp Theory of Computing (STOC), 1998].
4. A. Z. Broder, M. Charikar, A. M. Frieze, and M. Mitzenmacher, Min-wise independent permutations, J Comput System Sci 60 (2000), 630-659 [preliminary version, Proc 30th Annu ACM Symp Theory of Computing (STOC), 1998].
5. A. Z. Broder, M. Charikar, and M. Mitzenmacher, "A derandomization using min-wise independent permutations," Randomization and approximation techniques in computer science (Barcelona, 1998), 15-24, M. Luby, J. D. P. Rolim and M. J. Sema, Eds., Lecture Notes in Computer Science 1518. Springer-Verlag, Berlin, 1998.
6. A. Z. Broder and M. Mitzenmacher, Completeness and robustness properties of min-wise independent permutations, Random Structures Algorithms 18 (2001), 18-30.
7. B. Chor, O. Goldreich, J. Håstad, J. Friedman, S. Rudich, and R. Smolensky, The bit extraction problem of t-resilient functions (preliminary version), Proc 26th IEEE Symp Foundations of Computational Science (FOCS), Portland, OR, 1985, pp. 396-407.
8. J. A. Fill, Limits and rates of convergence for the distribution of search cost under the move-to-front rule, Theory Comput Sci 164(1-2) (1996), 185-206.
9. D. H. Gottlieb, A certain class of incidence matrices, Proc Amer Math Soc 17 (1966), 1233-1237.
10. P. Indyk, A small approximately min-wise independent family of hash functions, J Algorithms 38 (2001), 84-90.
11. T. Itoh, Y. Takei, and J. Tarui, On permutations with limited-independence, Proc 11th Annu ACM-SIAM Symp Discrete Algorithms, San Francisco, CA, 2000, pp. 137-146.
12. T. Itoh, Y. Takei, and J. Tarui, On the sample size of k-min-wise independent permutations and other k-wise distributions, Proc 35th Annu ACM Symp Theory of Computing (STOC), San Diego, CA, 2003, to appear.
13. H. Karloff and Y. Mansour, On construction of k-wise independent random variables, Combinatorica 17(1) (1997), 91-107.
14. D. Koller and N. Megiddo, Constructing small sample spaces satisfying given constraints, SIAM J Discrete Math 7 (1994), 260-274.
15. S. A. Norin, A polynomial lower bound for the size of any k-min-wise independent set of permutations (in Russian), Zap Nauchn Sem S-Petersburg Otdel Mat Inst Steklov (POMI) 227 (2001), 104-116.
16. M. Saks, A. Srinivasan, S. Zhou, and D. Zuckerman, Low discrepancy sets yield approximate min-wise independent permutation families, Inform Process Lett 73 (2000), 29-32.
17. J. Spencer, Minimal scrambling sets of simple orders, Acta Math Acad Sci Hungar 22 (1971), 349-353.
18. Y. Takei, T. Itoh, and T. Shinozaki, Constructing an optimal family of min-wise independent permutations, IECE Trans Fundam 83-A(4) (2000), 747-755.
19. M. L. Tsetlin, Finite automata and models of simple forms of behavior Russian Math Surveys 18(4) (1963), 1-27.