A recursive construction of t‐wise uniform permutations

Publisher： John Wiley & Sons Inc

E-ISSN： 1098-2418|46|3|531-540

ISSN： 1042-9832

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

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

A derandomization using min-wise independent permutations

By Broder A.Z.   Charikar M.   Mitzenmacher M.  

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

Elsevier

Access to resources Recommend Favorite

Construction of Cryptographically Important Boolean Permutations

By Zhang Wenying  

Applicable Algebra in Engineering, Communication and Computing, Vol. 15, Iss. 3-4, 2004-11 ,pp. : 173-177

Springer Publishing Company

Access to resources Recommend Favorite

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

The Number of Permutations with Exactly r 132-Subsequences Is P -Recursive in the Size!

By Bona M.  

Advances in Applied Mathematics, Vol. 18, Iss. 4, 1997-05 ,pp. : 510-522

Academic Press

Access to resources Recommend Favorite

The Power of Choice in the Construction of Recursive Trees

By Mahmoud Hosam  

Methodology And Computing In Applied Probability, Vol. 12, Iss. 4, 2010-12 ,pp. : 763-773

Springer Publishing Company

Access to resources Recommend Favorite