A Small Approximately Min-Wise Independent Family of Hash Functions

Journal of Algorithms

Volumn 38, Issue 1, 2001, Pages 84-90

  Indyk, Piotr ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0344612511     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2000.1131     Document Type: Article

References (8)

1. A. Broder, On the resemblance and containment of documents, in "SEQUENCES'98," pp. 21-29.
2. A. Broder, M. Charikar, A. Frieze, and M. Mitzenmacher, Min-wise independent permutations, in "STOC'98."
3. A. Broder, M. Charikar, and M. Mitzenmacher, A derandomization using min-wise independent permutations, in "RANDOM'98."
4. A. Broder, S. Glassman, M. Manasse, and G. Zweig, Syntactic clustering of the Web, in "WWW6," pp. 391-404, 1998.
5. E. Cohen, Size-estimation framework with applications to transitive closure and reachability, in "FOCS'94," pp. 190-200.
6. R. Motwani and P. Raghavan, "Randomized Algorithms," Cambridge Univ. Press, Cambridge, UK, 1995.
7. K. Mulmuley, Randomized geometric algorithms and pseudorandom generators, Algorithmica 16, Nos. 4/5 (1996), 450-463.
8. K. Mulmuley, "Computational Geometry: An Introduction through Randomized Algorithms," Prentice Hall, New York, 1994.