Analysis of Algorithms
Library Home || Full Table of Contents || Suggest a Link || Library Help
|A research site with papers to download, links to researchers, a newsletter, etc. Analysis of Algorithms (AofA) is a field in computer science whose overall goal is an understanding of the complexity of algorithms. While much research is devoted to worst-case evaluations, the focus in these pages is methods for average-case and probabilistic analysis. Properties of random strings, permutations, trees, and graphs are thus essential ingredients in the analysis of algorithms.|
|Levels:||Late College, Research|
|Resource Types:||Problems/Puzzles, Web-Based Discussions, Articles, Bibliographies|
© 1994-2013 Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.