The.Algorithm.Design.Manual.Springer-Verlag.1998
The.Algorithm.Design.Manual.Springer-Verlag.1998 The.Algorithm.Design.Manual.Springer-Verlag.1998
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]
- Page 791 and 792: Index (complete) parallel algorithm
- Page 793 and 794: Index (complete) planar subdivision
- Page 795 and 796: Index (complete) proof of correctne
- Page 797 and 798: Index (complete) regular expression
- Page 799 and 800: Index (complete) self-organizing tr
- Page 801 and 802: Index (complete) sine functions sin
- Page 803 and 804: Index (complete) spring embedding h
- Page 805 and 806: Index (complete) Symbol Technologie
- Page 807 and 808: Index (complete) trial division Tri
- Page 809 and 810: Index (complete) VLSI circuit layou
- Page 811 and 812: 1.4.4 Shortest Path 1.4.4 Shortest
- Page 813 and 814: 1.2.5 Constrained and Unconstrained
- Page 815 and 816: 1.6.4 Voronoi Diagrams 1.6.4 Vorono
- Page 817 and 818: 1.4.7 Eulerian Cycle / Chinese Post
- Page 819 and 820: Online Bibliographies Online Biblio
- Page 821 and 822: About the Book -- The Algorithm Des
- Page 823 and 824: Copyright and Disclaimers Copyright
- Page 825 and 826: CD-ROM Installation Installation an
- Page 827 and 828: CD-ROM Installation install a sound
- Page 829 and 830: Thanks! Frank Ruscica file:///E|/WE
- Page 831 and 832: Thanks! Zhong Li Thanks also to Fil
- Page 833 and 834: CD-ROM Installation To use the CD-R
- Page 835 and 836: Binary Search in Action Binary Sear
- Page 837 and 838: Binary Search in Action file:///E|/
- Page 839 and 840: Binary Search in Action file:///E|/
- Page 841: Postscript version of the lecture n
- Page 845 and 846: Lecture 1 - analyzing algorithms Yo
- Page 847 and 848: Lecture 1 - analyzing algorithms Th
- Page 849 and 850: Lecture 1 - analyzing algorithms Th
- Page 851 and 852: Lecture 1 - analyzing algorithms is
- Page 853 and 854: Lecture 2 - asymptotic notation How
- Page 855 and 856: Lecture 2 - asymptotic notation Not
- Page 857 and 858: Lecture 2 - asymptotic notation alg
- Page 859 and 860: Lecture 2 - asymptotic notation Sup
- Page 861 and 862: Lecture 2 - asymptotic notation Nex
- Page 863 and 864: Lecture 3 - recurrence relations Is
- Page 865 and 866: Lecture 3 - recurrence relations
- Page 867 and 868: Lecture 3 - recurrence relations Li
- Page 869 and 870: Lecture 3 - recurrence relations Su
- Page 871 and 872: Lecture 3 - recurrence relations A
- Page 873 and 874: Lecture 4 - heapsort Note iteration
- Page 875 and 876: Lecture 4 - heapsort The convex hul
- Page 877 and 878: Lecture 4 - heapsort 1. All leaves
- Page 879 and 880: Lecture 4 - heapsort left = 2i righ
- Page 881 and 882: Lecture 4 - heapsort Since this sum
- Page 883 and 884: Lecture 4 - heapsort Selection sort
- Page 885 and 886: Lecture 4 - heapsort Greedy Algorit
- Page 887 and 888: Lecture 5 - quicksort Partitioning
- Page 889 and 890: Lecture 5 - quicksort Listen To Par
- Page 891 and 892: Lecture 5 - quicksort Listen To Par
<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]