Kaplan, Eyal; Naor, Moni; Reingold, Omer Derandomized constructions of \(k\)-wise (almost) independent permutations. (English) Zbl 1192.68461 STOC’05: Proceedings of the 37th annual ACM symposium on theory of computing, Baltimore, MD, USA, May 22–24, 2005. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-960-8). 354-365 (2005). See Algorithmica 55, No. 1, 113–133 (2009; Zbl 1180.68200), resp. Lect. Notes Comput. Sci. 3624, 354-365 (2005; Zbl 1142.68449).For the entire collection see [Zbl 1088.68501]. Cited in 4 Documents MSC: 68R05 Combinatorics in computer science 05A05 Permutations, words, matrices 68W05 Nonnumerical algorithms Citations:Zbl 1142.68449; Zbl 1180.68200 PDFBibTeX XMLCite \textit{E. Kaplan} et al., in: Proceedings of the 37th annual ACM symposium on theory of computing, STOC'05. Baltimore, MD, USA, May 22--24, 2005. New York, NY: Association for Computing Machinery (ACM). 354--365 (2005; Zbl 1192.68461)