CSCI 4450: Algorithm Analysis and Complexity Theory

This page contains material specific to the Fall 2001 CSCI 4450 Algorithm Analysis and Complexity Theory class taught by Steve Tate in the Department of Computer Sciences at the University of North Texas.

Who's in charge here, anyway?

All administrative questions about the class should be directed to the instructor. Questions about homework assignments should be directed first to the teaching assistant, if possible, and then to the instructor.

InstructorTeaching Assistant
Steve Tate Wentong Li
Office: GAB 320-DOffice: GAB 322
Office Hours: Mon/Wed 1:00-2:00, Fri 10:30-11:30 Office Hours: Tues/Thurs 2:00-3:30
E-Mail: srt@cs.unt.edu E-Mail: wl@cs.unt.edu

On-Line Information

Most documents are available in both HTML (looks good in a Web browser), PostScript, and PDF (looks good on paper). Since this course is very mathematical, and HTML offers very poor facilities for including mathematical expressions, some of the handouts are available only in PostScript or PDF. You will need a PostScript viewer, PostScript printer, or PDF viewer (such as Adobe Acrobat) in order to use these files.

Basic information:

Class Handouts and Information

Other Information

Current students are welcome to send me anonymous comments. This is for anonymous suggestions to (hopefully) improve classes. It is not for questions about homework or class material -- since these comments are anonymous I have no way to answer questions submitted here!


Steve Tate / University of North Texas / 940-565-4864 / srt@cs.unt.edu
Last modified: Wed Nov 7 16:48:54 CST 2001