Computer Science – Data Structures and Algorithms
Scientific paper
2005-02-03
Random Structures and Algorithms 27 (2005) 235--250
Computer Science
Data Structures and Algorithms
November 2004
Scientific paper
10.1002/rsa.20075
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.
No associations
LandOfFree
On the asymptotic behavior of some Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the asymptotic behavior of some Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the asymptotic behavior of some Algorithms will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-177144