The.Algorithm.Design.Manual.Springer-Verlag.1998

The.Algorithm.Design.Manual.Springer-Verlag.1998 The.Algorithm.Design.Manual.Springer-Verlag.1998

18.04.2013 Views

Algorithm Repository -- Algorithms Courses Algorithms Courses Instructors for combinatorial algorithms courses around the world are putting lecture notes and other interesting material on the WWW for their classes, but there is no reason the rest of the world shouldn't benefit as well. Below are the best course sites we have found to date. A similar collection of algorithm courses is being maintained by Kirk Pruhs at Univ. of Pittsburgh. ● Gordon Royle -- Topics covered include graph algorithms, network flow, P=NP, travelling salesman, string processing, greedy algorithm, cryptography, and combinatorial search. On-line lecture notes are included. ● Steven Skiena -- Topic covered include sorting and searching, combinatorial search, dynamic programming, graph algorithms, and intractibility. On-line lecture notes are included. ● Guy Blelloch -- Parallel algorithms and programming. Included are animations of parallel algorithms, and information about the NESL parallel programming language they are written in. ● Algorithms in the Real World (CMU) -- An interesting collection of pointers and descriptive material on applications of algorithms in practice. Feel free to look around. If you find something useful, then drop us a line to let us know what we did right. If you're looking for something that's not here yet, drop us a line and tell us that too. We're looking for as many good implementations as we can find -- so if you have an implementation for a specific problem, or know where one can be found, let us know and we'll see if we can't get it attached to the site. This algorithms repository is part of the ongoing algorithms-related research conducted here in the Department of Computer Science at the State University of New York at Stony Brook. About the Book Send us Mail Go to Main Page file:///E|/WEBSITE/INFO/COURSES.HTM [19/1/2003 1:34:11]

Lecture 1 - analyzing algorithms Next: Lecture 2 - asymptotic Up: No Title Previous: No Title Lecture 1 - analyzing algorithms Listen To Part 1-7 Lecture Schedule subject topics reading Preliminaries Analyzing algorithms 1-32 " Asymptotic notation 32-37 " Recurrence relations 53-64 Sorting Heapsort 140-150 " Quicksort 153-167 " Linear Sorting 172-182 Searching Data structures 200-215 " Binary search trees 244-245 " Red-Black trees:insertion 262-272 `` Red-Black trees:deletion 272-277 MIDTERM 1 Comb. Search Backtracking " Elements of dynamic programming 301-314 " Examples of dynamic programming 314-323 Graph Algorithms Data structures for graphs 465-477 " Breadth/depth-first search 477-483 " Topological Sort/Connectivity 485-493 " Minimum Spanning Trees 498-510 " Single-source shortest paths 514-532 " MIDTERM 2 All-pairs shortest paths 550-563 Intractability P and NP 916-928 " NP-completeness 929-939 " NP-completeness proofs 939-951 file:///E|/LEC/LECTUR16/NODE1.HTM (1 of 9) [19/1/2003 1:34:15]

<strong>Algorithm</strong> Repository -- <strong>Algorithm</strong>s Courses<br />

<strong>Algorithm</strong>s Courses<br />

Instructors for combinatorial algorithms courses around the world are putting lecture notes and other<br />

interesting material on the WWW for their classes, but there is no reason the rest of the world shouldn't<br />

benefit as well. Below are the best course sites we have found to date. A similar collection of algorithm<br />

courses is being maintained by Kirk Pruhs at Univ. of Pittsburgh.<br />

● Gordon Royle -- Topics covered include graph algorithms, network flow, P=NP, travelling<br />

salesman, string processing, greedy algorithm, cryptography, and combinatorial search. On-line<br />

lecture notes are included.<br />

● Steven Skiena -- Topic covered include sorting and searching, combinatorial search, dynamic<br />

programming, graph algorithms, and intractibility. On-line lecture notes are included.<br />

● Guy Blelloch -- Parallel algorithms and programming. Included are animations of parallel<br />

algorithms, and information about the NESL parallel programming language they are written in.<br />

● <strong>Algorithm</strong>s in the Real World (CMU) -- An interesting collection of pointers and descriptive<br />

material on applications of algorithms in practice.<br />

Feel free to look around. If you find something useful, then drop us a line to let us know what we did<br />

right. If you're looking for something that's not here yet, drop us a line and tell us that too. We're looking<br />

for as many good implementations as we can find -- so if you have an implementation for a specific<br />

problem, or know where one can be found, let us know and we'll see if we can't get it attached to the site.<br />

This algorithms repository is part of the ongoing algorithms-related research conducted here in the<br />

Department of Computer Science at the State University of New York at Stony Brook.<br />

About the Book<br />

Send us Mail<br />

Go to Main Page<br />

file:///E|/WEBSITE/INFO/COURSES.HTM [19/1/2003 1:34:11]

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!