Premium
On the asymptotic behavior of some algorithms
Author(s) -
Robert Philippe
Publication year - 2005
Publication title -
random structures and algorithms
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.314
H-Index - 69
eISSN - 1098-2418
pISSN - 1042-9832
DOI - 10.1002/rsa.20075
Subject(s) - struct , simple (philosophy) , representation (politics) , context (archaeology) , algorithm , computer science , tree (set theory) , asymptotic analysis , mathematics , mathematical analysis , paleontology , philosophy , epistemology , politics , political science , law , biology , programming language
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