tag:blogger.com,1999:blog-4185761723648392811.post5783291353511701449..comments2010-01-04T14:52:47.169-08:00Peter Dolanhttp://www.blogger.com/profile/08458407522991668575noreply@blogger.comBlogger1125tag:blogger.com,1999:blog-4185761723648392811.post-33664025752414011482007-11-13T08:15:00.000-08:002007-11-13T08:15:00.000-08:00I don't know how choosing permutations «at random» works out. There are many kinds of random!<BR/><BR/>As far as constructing min-wise independent permutations, I've found this <A HREF="http://www.icsi.berkeley.edu/~zhao/minwise/" REL="nofollow">implementation</A>, I'm not sure what construction it uses; and this <A HREF="http://citeseer.ist.psu.edu/353974.html" REL="nofollow">paper</A> that gives a construction algorithm, referencing Brodner's method and Indyk's method. I am interested in more.Anonymousnoreply@blogger.com