Completeness and robustness properties of min-wise independent permutations

Random Structures and Algorithms

Volumn 18, Issue 1, 2001, Pages 18-30

  Broder, Andrei Z ^a   Mitzenmacher, Michael ^b  

^a AltaVista Company   (United States)

^b HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035529274     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/1098-2418(200101)18:1<18::AID-RSA2>3.0.CO;2-M     Document Type: Article

References (15)

1. N. Alon and J. H. Spencer, The Probabilistic Method, John Wiley and Sons New York, 1992.
2. A. Z. Broder, On the resemblance and containment of documents, Proc Compression and Complexity of Sequences 1997, 29, IEEE Computer Society, 1988, pp. 21-29.
3. A. Z. Broder, On the resemblance and containment of documents, Proc Compression and Complexity of Sequences 1997, 29, IEEE Computer Society, 1988, pp. 21-29.
4. A. Z. Broder, Filtering near-duplicate documents. Preliminary version presented at FUN 98. Final version in Proc of the 11th Annual Symposium on Combinatorial Pattern Matching. June 2000. Available as Lecture Notes in Computer Science, Vol. 1848.
5. A. Z. Broder, M. Burrows, and M. S. Manasse, Efficient computation of minima of random functions. Manuscript.
6. A. Z. Broder, M. Charikar, A. Frieze, and M. Mitzenmacher, Min-wise independent permutations, Journal of Computer and System Sciences, 60 (2000), 630-659.
7. A. Z. Broder, M. Charikar, and M. Mitzenmacher, A derandomization using min-wise independent permutations, Proc Random 98, 1998, pp. 15-24. available as Lecture Notes in Computer Science, Vol. 1518.
8. A. Z. Broder, S. C. Glassman, M. S. Manasse, and G. Zweig, Syntactic clustering of the Web, Proc Sixth International World Wide Web Conference, 1997, pp. 391-404.
9. E. Cohen, Size-estimation framework with applications to transitive closure and reachability. Journal of Computer and System Sciences, 55 (1997), 441-453.
10. P. Indyk, A small approximately min-wise independent family, Proc 10th ACM-SIAM Symp Discrete Algorithms, 1999, pp. 454-456.
11. D. Karger, E. Lehman, T Leighton, M. Levine, D. Lewin, and R. Panigrahy, Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web, Proc 29th ACM Symp Theory of Computing, El Paso, Texas, 1997, pp. 654-663.
12. D. Koller and N. Megiddo, Constructing small sample spaces satisfying given constraints, SIAM J Discrete Math, 7 (1994), pp. 260-274.
13. K. Mulmuley, Randomized geometric algorithms and pseudorandom generators, Algorithmica, 16 (1996), 450-463.
14. M. Saks, A. Srinivasan, S. Zhou, and D. Zuckerman, Low discrepancy sets yield approximate min-wise independent permutation families, Information Processing Letters, 73:1-2 (2000), pp. 29-32.
15. Y. Takei, T. Itoh, and T. Shinozaki, An optimal construction of exactly min-wise independent permutations, Technical Report COMP98-62, IEICE, 1998.