On the asymptotic behavior of some Algorithms

Abstract : A 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.
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00004119
Contributor : Philippe Robert <>
Submitted on : Wednesday, February 2, 2005 - 10:54:51 AM
Last modification on : Friday, May 25, 2018 - 12:02:03 PM
Long-term archiving on : Thursday, April 1, 2010 - 7:59:22 PM

Identifiers

Collections

Citation

Philippe Robert. On the asymptotic behavior of some Algorithms. Random Structures and Algorithms, Wiley, 2005, 27, pp.235--250. ⟨10.1002/rsa.20075⟩. ⟨hal-00004119⟩

Share

Metrics

Record views

382

Files downloads

208