Computer Science 250 -- Algorithms and Their Analysis

Course Information

Class meeting time:
M-W-F: 9-9:50
Tu: 2:30-4:20 (Lab)

Textbook: Algorithms, by Dasgupta, Papadimitriou and Vazirani.

Dr. Andrew Thall
Office: 104 Alden Hall
Phone: 332-2877
email: athall AT allegheny DOT edu
www: http://cs.allegheny.edu/~thall
Office Hours:
M-W-F: 10-11 AM
Tu-Thu: 1-2:30 PM

Interesting or otherwise useful links:

contains a listing of integer multiplication timings
for various arb-prec. packages.

Lab 3

A nice talk from Sylvain Gelly et al. (INRIA) presented at the University of Alberta,
describing Monte Carlo methods for playing the game of go, a much more
difficult challenge in computation than chess.
mogoPresentationUniversityAlberta.pdf

Sample data and Mathematica notebooks for doing typical analyses
testdat.dat
errorplots.nb
TurningListsIntoParameters.nb
logScaling.nb

Prof. K's intro to Mathematica graphing:
http://cs.allegheny.edu/~gkapfham/teach/cs580/tutorial/graph.html

Compiled Java .class for doing fast multiplies on your MyBigInts.
(The previous fftStuff.tgz does not work with student code. Use this one.)
fftStuff2.tgz