Low discrepancy sets yield approximate min-wise independent permutation families

Information Processing Letters

Volumn 73, Issue 1-2, 2000, Pages 29-32

  Saks, Michael ^a   Srinivasan, Aravind ^b   Zhou, Shiyu ^c   Zuckerman, David ^d  

^a RUTGERS UNIVERSITY   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c UNIVERSITY OF PENNSYLVANIA   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; COMPUTATIONAL GEOMETRY; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

DOCUMENT FILTERING; EXPLICIT CONSTRUCTION; MINWISE INDEPENDENT PERMUTATIONS; PSEUDORANDOM PERMUTATIONS;

INFORMATION RETRIEVAL;

EID: 0033907633     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(99)00163-5     Document Type: Article

References (15)

1. Alon N., Babai L., Itai A. A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms. Vol. 7:1986;567-583.
2. Armoni R., Saks M., Wigderson A., Zhou S. Discrepancy sets and pseudorandom generators for combinatorial rectangles. Proc. IEEE Symposium on Foundations of Computer Science. 1996;412-421.
3. Broder A.Z., Charikar M., Frieze A., Mitzenmacher M. Min-wise independent permutations. Proc. ACM Symposium on Theory of Computing. 1998;327-336.
4. Cameron P.J. Finite permutation groups and finite simple groups. Bull. London Math. Soc. Vol. 13:1981;1-22.
5. Even G., Goldreich O., Luby M., Nisan N., Veličković B. Approximations of general independent distributions. Proc. ACM Symposium on Theory of Computing. 1992;10-16.
6. Impagliazzo R., Nisan N., Wigderson A. Pseudorandomness for network algorithms. Proc. ACM Symposium on Theory of Computing. 1994;356-364.
7. Indyk P. A small approximately min-wise independent family of hash functions. Proc. ACM-SIAM Symposium on Discrete Algorithms. 1999;454-456.
8. Joffe A. On a set of almost deterministic k -independent random variables. Ann. Probab. Vol. 2:(1):1974;161-162.
9. Karp R.M., Wigderson A. A fast parallel algorithm for the maximal independent set problem. J. ACM. Vol. 32:1985;762-773.
10. Linial N., Luby M., Saks M., Zuckerman D. Efficient construction of a small hitting set for combinatorial rectangles in high dimension. Combinatorica. Vol. 17:1997;215-234.
11. Lu C.-J. Improved pseudorandom generators for combinatorial rectangles. Proc. International Conference on Automata, Languages and Programming. 1998;223-234.
12. Luby M. A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. Vol. 15:(4):1986;1036-1053.
13. Naor M., Reingold O. On the construction of pseudo-random permutations: Luby-Rackoff revisited. J. Cryptology. Vol. 12:1999;29-66.
14. Rees E.G. Notes on Geometry. 1983;Springer, Berlin.
15. Takei Y., Itoh T., Shinozaki T. An optimal construction of exactly min-wise independent permutations. Technical Report COMP98-62, IEICE:1998.