Pré-Publication, Document De Travail Année : 2021

An Asymptotic Stability Theorem for Divide-and-Conquer Sequences

Résumé

Divide-and-conquer is a popular strategy to design algorithms. It splits the input into several smaller subproblems, solving each subproblem separately, and then combine together to solve the original problem. The analysis of such divide-and-conquer algorithms naturally leads to divide-and-conquer recurrences. The present paper furnishes an asymptotic stability theorem, for a wide range of divide-and-conquer sequences, extending an established result.

Fichier principal
Vignette du fichier
MICHAEL_GUEDJ__DAC__E1.pdf (193.15 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-02902407 , version 1 (19-07-2020)
hal-02902407 , version 2 (30-08-2021)

Licence

Identifiants

  • HAL Id : hal-02902407 , version 2

Citer

Michael Guedj. An Asymptotic Stability Theorem for Divide-and-Conquer Sequences. 2021. ⟨hal-02902407v2⟩

Collections

187 Consultations
210 Téléchargements

Partager

  • More