Journée-séminaire de combinatoire

(équipe CALIN du LIPN, université Paris-Nord, Villetaneuse)

Le 14 avril 2020 à 14h00 en visioconférence, Axel Bacher nous parlera de : Exhaustive search of permutations with many patterns

Résumé : 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).

 [Slides.pdf] [vidéo]


Dernière modification : Friday 10 April 2020 Valid HTML 4.01! Valid CSS! Contact : Cyril.Banderier at lipn.univ-paris13.fr