Analysis of Algorithms for Permutations Biased by Their Number of Records - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Analysis of Algorithms for Permutations Biased by Their Number of Records

Résumé

The topic of the article is the parametric study of the complexity of algorithms on arrays of pairwise distinct integers. We introduce a model that takes into account the non-uniformness of data, which we call the Ewens-like distribution of parameter θ for records on permutations: the weight θ r of a permutation depends on its number r of records. We show that this model is meaningful for the notion of presortedness, while still being mathematically tractable. Our results describe the expected value of several classical permutation statistics in this model, and give the expected running time of three algorithms: the Insertion Sort, and two variants of the Min-Max search.
Fichier principal
Vignette du fichier
1605.02905.pdf (592.71 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01838692 , version 1 (13-07-2018)

Identifiants

  • HAL Id : hal-01838692 , version 1

Citer

Nicolas Auger, Mathilde Bouvel, Cyril Nicaud, Carine Pivoteau. Analysis of Algorithms for Permutations Biased by Their Number of Records. 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithm AOFA 2016, Jul 2016, Cracovie, Poland. ⟨hal-01838692⟩
93 Consultations
139 Téléchargements

Partager

Gmail Facebook X LinkedIn More