Min-wise independent linear permutations

Electronic Journal of Combinatorics

Volumn 7, Issue 1 R, 2000, Pages 1-6

  Bohman, Tom ^a   Cooper, Colin ^b   Frieze, Alan ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0010112767     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1504     Document Type: Article

References (9)

1. N. Alon and J.H. Spencer, The Probabilistic Method, Wiley, 1992.
2. B. Bollobás, Martingales, isoperimetric inequalities and random graphs, in Combinatorics, A. Hajnal, L. Lovász and V.T. Sós Ed., Colloq. Math. Sci. Janos Bolyai 52, North Holland 1988.
3. A.Z. Broder, M. Charikar, A.M. Frieze and M. Mitzenmacher, Min-Wise Independent permutations, Proceedings of the 30th Annual ACM Symposium on Theory of Computing (1998) 327-336.
4. A.Z. Broder, M. Charikar and M. Mitzenmacher, A derandomization using min-wise independent permutations, Proceedings of Second International Workshop RANDOM '98 (M. Luby, J. Rolim, M. Serna Eds.) (1998) 15-24.
5. A.Z. Broder and U. Feige, Min-Wise versus Linear Independence, Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (2000).
6. P. Indyk, A small approximately min-wise independent family of hash-functions, Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (1999) 454-456.
7. C.J.H. McDiarmid, On the method of bounded di erences, Surveys in Combinatorics, 1989, Invited papers at the Twelfth British Combinatorial Conference, Edited by J. Siemons, Cambridge University Press, 148-188.
8. C.J.H. McDiarmid, Concentration, Probabilistic methods for algorithmic discrete mathematics, (M.Habib, C. McDiarmid, J. Ramirez-Alfonsin, B. Reed, Eds.), Springer (1998) 195-248.
9. M.J. Steele, Probability theory and combinatorial optimization, CBMS-NSF Regional Conference Series in Applied Mathematics 69, 1997.