A derandomization using min-wise independent permutations

Author： Broder A.Z.   Charikar M.   Mitzenmacher M.  

Publisher： Elsevier

ISSN： 1570-8667

Source： Journal of Discrete Algorithms, Vol.1, Iss.1, 2003-02, pp. : 11-20

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On some properties of min-wise independent families and groups of permutations

By Bargachev V.  

Journal of Mathematical Sciences, Vol. 134, Iss. 5, 2006-05 ,pp. : 2340-2345

Springer Publishing Company

Access to resources Recommend Favorite

A recursive construction of t‐wise uniform permutations

By  

RANDOM STRUCTURES AND ALGORITHMS, Vol. 46, Iss. 3, 2015-05 ,pp. : 531-540

John Wiley & Sons Inc

Access to resources Recommend Favorite

Hats, auctions and derandomization

By  

RANDOM STRUCTURES AND ALGORITHMS, Vol. 46, Iss. 3, 2015-05 ,pp. : 478-493

John Wiley & Sons Inc

Access to resources Recommend Favorite

Algorithms for Finite and Semi-Infinite Min–Max–Min Problems Using Adaptive Smoothing Techniques

By Polak E.   Royset J. O.  

Journal of Optimization Theory and Applications, Vol. 119, Iss. 3, 2003-12 ,pp. : 421-457

Springer Publishing Company

Access to resources Recommend Favorite

Identification of fuzzy dynamic systems using Max-Min recurrent neural networks

By Blanco A.   Delgado M.   Pegalajar M.C.  

Fuzzy Sets and Systems, Vol. 122, Iss. 3, 2001-09 ,pp. : 451-467

Elsevier

Access to resources Recommend Favorite