Drexel dragonThe Math ForumDonate to the Math Forum

The Math Forum Internet Mathematics Library

Browse and Search the Library
Home : Math Topics : Discrete Math : Algorithms

_____________________________________
Library Home || Search || Full Table of Contents || Suggest a Link || Library Help
_____________________________________


  Selected Sites   (see also All Sites in this category)

  1. Analysis of Algorithms - Flajolet, Prodinger
    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. more>>

  2. MX4002: Algorithms - Ian Craw and John Pulham; University of Aberdeen
    Lecture notes, tutorial sheets, exams, and other material provided for a course on algorithms with the objective of exposing the student to a small number of typical methods from a range of different contexts, so as to reveal the type of thinking that is involved and give students the basic hints as to how to proceed with individual problems. Applications include sorting algorithms, searching algorithms, string processing and language, geometric algorithms, graph algorithms, and mathematical algorithms. Individual topics include hatching convex polygons; recursion; optimal sorting; optimal merging; heapsort; grammars and parsing; abstract data types such as the ADT priority queue, traversals, binary trees, and Huffman codes; random shuffles; the Fast Fourier Transform (FFT) and its applications, such as image processing (Gaussian Blur and the Laplace Operator); and Big O timing formulas. Available online as well as in PDF format. more>>

  3. The Stony Brook Algorithm Repository - Steven S. Skiena; Dept. of Computer Science, SUNY-Stony Brook
    A comprehensive collection of algorithm implementations for over seventy of the most fundamental problems in combinatorial algorithms. The problem taxonomy, implementations, and supporting material are drawn from Skiena's book The Algorithm Design Manual. Since the practical person is more often looking for a program than an algorithm, Skiena provides pointers to solid implementations of useful algorithms, when they are available. Problems by Category: Data Structures; Numerical Problems; Combinatorial Problems; Graph Problems (polynomial-time problems, hard problems); Computational Geometry; Set and String Problems. Implementations By Language: C++; C; Pascal; FORTRAN; Mathematica; Lisp. more>>


 

Mason error

error in file:   /usr/lib/perl5/5.6.0/Carp/Heavy.pm
 
line 79:  Bizarre copy of ARRAY in aassign
context:  
... 
75:  # them according to the format variables defined earlier in
76:  # this file and join them onto the $sub sub-routine string
77:  if ($hargs) {
78:  # we may trash some of the args so we take a copy
79:  @a = @DB::args; # must get local copy of args
80:  # don't print any more than $MaxArgNums
81:  if ($MaxArgNums and @a > $MaxArgNums) {
82:  # cap the length of $#a and set the last element to '...'
83:  $#a = $MaxArgNums;
... 
component stack:   /library/branch.html
/library/dhandler
code stack:   /usr/lib/perl5/5.6.0/Carp/Heavy.pm:79

debug info:   Debug file is '/var/lib/mason/debug/anon/1'.

raw_error





























raw error:
 






























error while executing /library/branch.html:
Bizarre copy of ARRAY in aassign at /usr/lib/perl5/5.6.0/Carp/Heavy.pm line 79.