Skip to Main content Skip to Navigation
Conference papers

Distributional asymptotics in the analysis of algorithms: Periodicities and discretization

Abstract : It is well known that many distributions that arise in the analysis of algorithms have an asymptotically fluctuating behaviour in the sense that we do not have 'full' convergence, but only convergence along suitable subsequences as the size of the input to the algorithm tends to infinity. We are interested in constructions that display such behaviour via an ordinarily convergent background process in the sense that the periodicities arise from this process by deterministic transformations, typically involving discretization as a decisive step. This leads to structural representations of the resulting family of limit distributions along subsequences, which in turn may give access to their properties, such as the tail behaviour (unsuccessful search in digital search trees) or the dependence on parameters of the algorithm (success probability in a selection algorithm).
Complete list of metadata

Cited literature [21 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Monday, August 17, 2015 - 4:59:10 PM
Last modification on : Sunday, November 25, 2018 - 2:02:17 PM
Long-term archiving on: : Wednesday, November 18, 2015 - 12:15:38 PM


Publisher files allowed on an open archive




Rudolf Grübel. Distributional asymptotics in the analysis of algorithms: Periodicities and discretization. 2007 Conference on Analysis of Algorithms, AofA 07, 2007, Juan les Pins, France. pp.497-510, ⟨10.46298/dmtcs.3528⟩. ⟨hal-01184776⟩



Record views


Files downloads