On the asymptotic behavior of some Algorithms

Simple item page
dc.creatorRobert, Philippe
dc.date2005-02-03
dc.date.accessioned2026-07-07T06:23:23Z
dc.date.available2026-07-07T06:23:23Z
dc.descriptionA simple approach is presented to study the asymptotic behavior of some algorithms with an underlying tree structure. It is shown that some asymptotic oscillating behaviors can be precisely analyzed without resorting to complex analysis techniques as it is usually done in this context. A new explicit representation of periodic functions involved is obtained at the same time.
dc.descriptionNovember 2004
dc.identifierhttps://arxiv.org/abs/cs/0502014
dc.identifierhttp://arxiv.org/abs/cs/0502014
dc.identifierRandom Structures and Algorithms 27 (2005) 235--250
dc.identifierdoi:10.1002/rsa.20075
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/96215
dc.subjectData Structures and Algorithms
dc.subjectClassical Analysis and ODEs
dc.subjectProbability
dc.titleOn the asymptotic behavior of some Algorithms
dc.typetext

Files

Collections

arXiv