Welcome to the home page for the Computer Science Department's Graduate Algorithms course CLA CS 530. This is the starting point for online course information and documentation.
Most recent class assignment: HW 5
Here is an older example final exam for 530.
A few examples of practice problems that are similar in style and level to problems appearing on the midterm.y
The discussion sessions will start the week of September 13.
The section are
Wednesdays: 3:30 - 4:30pm in PSY B51
Thursdays: 3:30 - 4:30pm in PSY B51
Fridays: 3:30 - 4:30pm in PSY B55
Please select one of the lab section to attend each week.
Some extra material and notes from class:
A few math background problems which were discussed in class.
An example of the Ford Fulkerson max-flow algorithm from the Sept. 14 class.
A very nice on-line lecture on the preflow-push algorithm by Dan Gusfield of UC Davis.
The reading on randomized algorithms that appears on HW 2 can also be found here.
Reading on polynomial identity testing.
Reading on a linear programming example.
CS 530 is the central graduate algorithms course in the computer science curriculum. It serves as the a core graduate theory course. It is the successor to the undergraduate algorithms course, CS 330, and has this course as a prerequisite. In CS 530 students will learn fundamental algorithm design and algorithm analysis at the graduate level. The following list of pointers provides access to information concerning the course, the students and the instructors.