The.Algorithm.Design.Manual.Springer-Verlag.1998
The.Algorithm.Design.Manual.Springer-Verlag.1998 The.Algorithm.Design.Manual.Springer-Verlag.1998
Index Next: About this document Up: The Algorithm Design Manual Previous: References Index This index provides fast access to important keywords and topics in the on-line Book. The menu below partitions the index entries by the first letter of the alphabet, for ease of access. A full document index is also provided. Be aware that the index pointer typically resides at the end of the relevant paragraph in the document, so we recommend scrolling once towards the front of the document before reading. A similar index has been provided for the Lecture Notes, which may also be of interest. A B C D E F G H I J K L M N O P Q R S T U V W X Y Z Complete Index (note: the complete index is large; it will take a bit of time to load) Algorithms Mon Jun 2 23:33:50 EDT 1997 file:///E|/BOOK/BOOK5/NODE233.HTM [19/1/2003 1:27:36]
The Algorithm Design Manual The Algorithm Design Manual The CD-ROM Steven S. Skiena Department of Computer Science State University of New York Stony Brook, NY 11794-4400 What is a manual without software? The electronic supplement to this book is a ISO-9660 compatible, multiplatform CD-ROM, which can be viewed using Netscape, Microsoft Explorer, or any other WWW browser. This CD-ROM contains: ● The Algorithm Design Manual: Hypertext Edition A complete hypertext version of the full printed book. Indeed, the extensive cross-references within the book are best followed using the hypertext version. ● The Algorithm Repository Website -- The source code and URLs for all cited implementations, mirroring the Stony Brook Algorithm Repository WWW site. Programs in C, C++, Fortran, and Pascal are included, providing an average of four different implementations for each algorithmic problem. ● Algorithms Lectures -- More than 30 hours of audio lectures on the design and analysis of algorithms are provided, all keyed to on-line lecture notes. Following these lectures provides another approach to learning algorithm design techniques. Listening to all the audio is analogous to taking a one-semester file:///E|/INDEX.HTM (1 of 2) [19/1/2003 1:27:37]
- Page 1 and 2: The Algorithm Design Manual Next: P
- Page 3 and 4: Preface Next: Acknowledgments Up: T
- Page 5 and 6: Preface one stressing design over a
- Page 7 and 8: Acknowledgments Mon Jun 2 23:33:50
- Page 9 and 10: Contents Next: Techniques Up: The A
- Page 11 and 12: Contents ■ All-Pairs Shortest Pat
- Page 13 and 14: Contents ■ Graph Problems: Polyno
- Page 15: Contents ● About this document ..
- Page 19 and 20: Lecture Notes -- Analysis of Algori
- Page 21 and 22: Lecture Notes -- Analysis of Algori
- Page 23 and 24: The Stony Brook Algorithm Repositor
- Page 25 and 26: Techniques Next: Introduction to Al
- Page 27 and 28: Techniques Algorithms Mon Jun 2 23:
- Page 29 and 30: Introduction to Algorithms ● Reas
- Page 31 and 32: Data Structures and Sorting divide-
- Page 33 and 34: Breaking Problems Down ● Dynamic
- Page 35 and 36: Graph Algorithms The take-home less
- Page 37 and 38: Combinatorial Search and Heuristic
- Page 39 and 40: Intractable Problems and Approximat
- Page 41 and 42: How to Design Algorithms Next: Reso
- Page 43 and 44: How to Design Algorithms with a cou
- Page 45 and 46: How to Design Algorithms Next: Reso
- Page 47 and 48: A Catalog of Algorithmic Problems N
- Page 49 and 50: A Catalog of Algorithmic Problems
- Page 51 and 52: Algorithmic Resources Next: Softwar
- Page 53 and 54: References L. Adleman. Algorithmic
- Page 55 and 56: References AS89 Ata83 Ata84 problem
- Page 57 and 58: References BJL 91 A. Blum, T. Jiang
- Page 59 and 60: References BS81 BS86 BS93 BS96 BS97
- Page 61 and 62: References J. M. Chambers. Partial
- Page 63 and 64: References CT80 CT92 1971. G. Carpa
- Page 65 and 66: References K. Daniels and V. Milenk
Index<br />
Next: About this document Up: <strong>The</strong> <strong>Algorithm</strong> <strong>Design</strong> <strong>Manual</strong> Previous: References<br />
Index<br />
This index provides fast access to important keywords and topics in the on-line Book. <strong>The</strong> menu below<br />
partitions the index entries by the first letter of the alphabet, for ease of access. A full document index is<br />
also provided.<br />
Be aware that the index pointer typically resides at the end of the relevant paragraph in the document, so<br />
we recommend scrolling once towards the front of the document before reading.<br />
A similar index has been provided for the Lecture Notes, which may also be of interest.<br />
A B C D E F G H<br />
I J K L M N O P<br />
Q R S T U V W X<br />
Y Z<br />
Complete Index<br />
(note: the complete index is large; it will take a bit of time to load)<br />
<strong>Algorithm</strong>s<br />
Mon Jun 2 23:33:50 EDT 1997<br />
file:///E|/BOOK/BOOK5/NODE233.HTM [19/1/2003 1:27:36]
Change language