cse 630 : Theory of Algorithms and their Analysis : Spring 2007


Text:
Gilles Brassard and Paul Bratley, "Fundamentals of Algorithmics", Prentice-Hall 1996

Other references:
Aho, Hopcroft and Ullman: : "The Design and Analysis of Computer Algorithms" , Addison-Wesley 1974

Raymond Greenlaw, H.James Hoover and Walter L. Ruzzo: "Limits to Parallel Computation", Oxford University Press

Elias Horowitz and Sartaj Sahni: "Fundamentals of Computer Algorithms: ", Computer Science Press 1978

Donald E. Knuth: "The Art of Computer Programming" Second Edition, Addison-Wesley 1973

Rudolf Lidl and Gunter Pilz: "Applied Abstract Algebra" Second Edition, Springer 1997

Press, Flannery, Teukolsky and Vetterling: "Numerical Recipies - The Art of Scientific Computing" ; Multiple editions: ( C, Fortran, C++, others). Cambridge University Press

Mathworld



This course focuses on the techniques to design and analyze efficient algorithms. The material covered one of the core concerns of Computer Science.


Class schedule
Programming standards
Grading and assessment


http://www.cse.csusb.edu/egomez/cs630.html - updated 04/02/07