Algorithmic complexity of recursive and inductive algorithms.

Mark Burgin Algorithmic complexity of recursive and inductive algorithms. 31-60 2004 317 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/j.tcs.2003.12.003 db/journals/tcs/tcs317.html#Burgin04