%0 Journal Article %1 AutoDivConqCplx1989 %A Zimmermann, Paul %A Zimmermann, Wolf %D 1989 %K WCET mgr todo_tags %T The automatic complexity analysis of divide-and-conquer algorithms %U ftp://ftp.inria.fr/INRIA/publication/dienst/RR-1149.pdf %X Current tools performing automatic complexity analysis are capable to deal with function definitions based on structural induction. Divide-and-Conquer Algorithms with "intelligent" divide function (like quicksort) are not based on structural induction, but on noetherian induction. This paper presents a method of automatic complexity analysis to deal with such kinds of functions.

@article{AutoDivConqCplx1989, abstract = {Current tools performing automatic complexity analysis are capable to deal with function definitions based on structural induction. Divide-and-Conquer Algorithms with "intelligent" divide function (like quicksort) are not based on structural induction, but on noetherian induction. This paper presents a method of automatic complexity analysis to deal with such kinds of functions.}, added-at = {2009-07-16T13:55:53.000+0200}, author = {Zimmermann, Paul and Zimmermann, Wolf}, biburl = {https://www.bibsonomy.org/bibtex/2ebd648d9e7c4bb6ad2b2d2404473f53e/gwpl}, interhash = {d5cc2a04b16fef91c48236cbabbb2627}, intrahash = {ebd648d9e7c4bb6ad2b2d2404473f53e}, keywords = {WCET mgr todo_tags}, month = {December}, timestamp = {2009-07-16T13:56:09.000+0200}, title = {The automatic complexity analysis of divide-and-conquer algorithms}, url = {ftp://ftp.inria.fr/INRIA/publication/dienst/RR-1149.pdf}, year = 1989 }