MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  The Automatic Complexity Analysis of Divide-and-Conquer Algorithms

Download:
Download as a PDF | Download as a PS
by E De Recherche, Et En Automatique, Domaine De Voluceau, Paul Zimmermann, Paul Zimmermann, Wolf Zimmermann, Wolf Zimmermann
ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-1149.ps.gz
Add To MetaCart

Abstract:

ffi

Citations

492 Art of Computer Programming, Volume 3: Sorting and Searching (2nd Edition – Knuth - 1998
372 Concrete Mathematics – Graham, Knuth, et al. - 1994
122 Applied and Computational Complex Analysis – Henrici - 1974
59 A unifying look at data structures – Vuillemin - 1980
59 Mechanical program analysis – Wegbreit - 1975
43 Combinatorial analysis of quicksort algorithm – Hennequin - 1989
41 Ace: An automatic complexity evaluator – Metayer - 1988
15 Lambda-Upsilon-Omega: An assistant algorithms analyzer – Flajolet, Salvy, et al. - 1989
14 Lambda--Upsilon--Omega: The 1989 Cookbook. Rapport de recherche 1073, Institut National de Recherche en Informatique et en Automatique – Flajolet, Salvy, et al. - 1989
4 Fonctions g'en'eratrices et asymptotique automatique. Research Report 967, Institut National de Recherche en Informatique et en Automatique – Salvy - 1989
3 Alas : un syst`eme d'analyse alg'ebrique. Rapport de DEA, Universit'e de Paris VII – Zimmermann - 1988
2 How to Mechanize Complexity Analysis – Zimmermann - 1988