A derandomization using min-wise independent permutations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1518, Issue , 1998, Pages 15-24

  Broder, Andrei Z ^a   Charikar, Moses ^b   Mitzenmacher, Michael ^a  

^a HEWLETT PACKARD COMPANY   (United States)

^b Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DERANDOMIZATION; MIN-WISE INDEPENDENT PERMUTATIONS; MULTI-SET; SET COVER;

RANDOM PROCESSES;

EID: 84958668671     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49543-6_2     Document Type: Conference Paper

References (12)

1. N. Alon, O. Goldreich, J. H astad, and R. Peralta. Simple constructions of almost kwise independent random variables. Random Structures and Algorithms, 3(3):289304, 1992.
2. A. Z. Broder. On the resemblance and containment of documents. In Proceedings of Compression and Complexity of Sequences 1997, pages 21-29. IEEE Computer Society, 1988.
3. A. Z. Broder. Filtering near-duplicate documents. In Proceedings of FUN 98, 1998. To appear.
4. A. Z. Broder, M. Charikar, A. Frieze, and M. Mitzenmacher. Min-wise independent permutations. In Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, pages 327-336, 1998.
5. A. Z. Broder, S. C. Glassman, M. S. Manasse, and G. Zweig. Syntactic clustering of the Web. In Proceedings of the Sixth International World Wide Web Conference, pages 391-404, 1997.
6. J. L. Carter and M. N. Wegman. Universal classes of hash functions. Journal of Computer and System Sciences, 18(2):143-154, Apr. 1979.
7. U. Feige. A threshold of ln n for approximating set cover (preliminary version). In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 314-318, Philadelphia, Pennsylvania, 22-24 May 1996.
8. M. R. Garey and D. S. Johnson. Computers and Intractibility: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979.
9. P. Indyk, A small approximately min-wise independent family of hash functions. manuscript, 1998.
10. R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85-104. Plenum Press, New York, 1972.
11. M. Luby and A. Wigderson. Pairwise independence and derandomization. Technical Report TR-95-035, International Computer Science Institute, Berkeley, California, 1995.
12. S. Rajagopalan and V. V. Vazirani. Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs. In 34th Annual Symposium on Foundations of Computer Science, pages 322-331, Palo Alto, California, 3-5 Nov. 1993. IEEE. Journal version to appear in SIAM Journal of Computing.