On the asymptotic behavior of some algorithms
P Robert - Random Structures & Algorithms, 2005 - Wiley Online Library
P Robert
Random Structures & Algorithms, 2005•Wiley Online LibraryA 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.© 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2005
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.© 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2005
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. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2005
Wiley Online LibraryShowing the best result for this search. See all results