Exhaustive search of permutations with many patterns
Speaker(s) : Axel Bacher (LIPN)
How many patterns (subsequences up to order isomorphism) of size k can a permutation with size n contain? What are the optimal permutations? The goal of this work is to answer this question experimentally, for n up to 17, by exhaustively searching all permutations on GPUs. I will detail the algorithms used, then do a quick introduction to GPU programming and explain a few salient points of their implementation. Work in common with Michael Engen (University of Florida).
Marc.Mezzarobba (at) nulllip6.fr