The.Algorithm.Design.Manual.Springer-Verlag.1998
The.Algorithm.Design.Manual.Springer-Verlag.1998 The.Algorithm.Design.Manual.Springer-Verlag.1998
About the Book -- The Algorithm Design Manual book did an admirable job of convincing me that there is considerable truth in it.'' -- Giri Narasimhan, The University of Memphis. ``The questions on problem solving are good enough that they ought to be talked about in every programming class in the undergraduate curriculum.'' -- Ron Danielson, Santa Clara University. Check out the preface and table of contents for more information. You may order this book, and are encouraged to do so. You might also be interested in my previous book, Implementing Discrete Mathematics . Please leave your name and address to receive additional information about the book and notification of significant upgrades to this site when they occur. If your WWW client does not support forms, please send an e-mail to algorith@cs.sunysb.edu with your name, e-mail address, and mailing address for further information. First Name: Last Name : E-mail : Company Name : Number and Street: City : State : Zip : Phone : Return to the home page If you have problems with this page, please send E-mail to: algorith@cs.sunysb.edu file:///E|/ABOUTBK.HTM (3 of 3) [19/1/2003 1:34:00]
Copyright and Disclaimers Copyright Notice This electronic component package is protected by federal copyright law and international treaty. The copyright holder retains title to and ownership of the package. U.S. copyright law prohibits you from making any copy of the CD-ROM for any reason, without the written permission of Springer-Verlag, except that you may download and copy the contents of this CD-ROM disc for your own research, teaching, and communications use. Springer-Verlag or its designee has the right to audit your computer and electronic component usage to determine whether any unauthorized copies of this package have been made. For those programs and data contained on this CD-ROM and WWW site whereby the rights are owned by the original creators and source, any request for permission to use their software for commercial purposes must be directed to them. The printed book with which this electronic component is packaged may not be translated or copied in whole or in part without the written permission of Springer-Verlag except for brief excerpts in connection with reviews or scholarly analysis. Use in connection with any form of information storage and retrieval, electronic adaptation, computer software or by similar or dissimilar methodology now known or hereafter developed is forbidden. Springer-Verlag or the author makes no warranty of representation, either express or implied, with respect to this CD-ROM, WWW site, or book, including their quality, merchantability, or fitness for a particular purpose. In no event will Springer-Verlag, or the author be liable for direct, indirect, special, incidental, or consequential damages arising out of the use or inability to use the disc, WWW site, or book, even if Springer-Verlag or the author has been advised of the possibility of such damages. About the Book Send us Mail Go to Main Page file:///E|/WEBSITE/INFO/COPYRIGH.HTM [19/1/2003 1:34:01]
- Page 771 and 772: Index (complete) English to French
- Page 773 and 774: Index (complete) file directory tre
- Page 775 and 776: Index (complete) geom.bib, geometri
- Page 777 and 778: Index (complete) Hamiltonian Cycle
- Page 779 and 780: Index (complete) implementation cha
- Page 781 and 782: Index (complete) job-shop schedulin
- Page 783 and 784: Index (complete) linear programming
- Page 785 and 786: Index (complete) , , , , , , , math
- Page 787 and 788: Index (complete) modular arithmetic
- Page 789 and 790: Index (complete) normal distributio
- 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: About the Book -- The Algorithm Des
- 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 and 842: Postscript version of the lecture n
- Page 843 and 844: Lecture 1 - analyzing algorithms Ne
- 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
Copyright and Disclaimers<br />
Copyright Notice<br />
This electronic component package is protected by federal copyright law and international treaty. <strong>The</strong><br />
copyright holder retains title to and ownership of the package. U.S. copyright law prohibits you from<br />
making any copy of the CD-ROM for any reason, without the written permission of <strong>Springer</strong>-Verlag,<br />
except that you may download and copy the contents of this CD-ROM disc for your own research,<br />
teaching, and communications use. <strong>Springer</strong>-Verlag or its designee has the right to audit your computer<br />
and electronic component usage to determine whether any unauthorized copies of this package have been<br />
made.<br />
For those programs and data contained on this CD-ROM and WWW site whereby the rights are owned<br />
by the original creators and source, any request for permission to use their software for commercial<br />
purposes must be directed to them.<br />
<strong>The</strong> printed book with which this electronic component is packaged may not be translated or copied in<br />
whole or in part without the written permission of <strong>Springer</strong>-Verlag except for brief excerpts in<br />
connection with reviews or scholarly analysis. Use in connection with any form of information storage<br />
and retrieval, electronic adaptation, computer software or by similar or dissimilar methodology now<br />
known or hereafter developed is forbidden.<br />
<strong>Springer</strong>-Verlag or the author makes no warranty of representation, either express or implied, with<br />
respect to this CD-ROM, WWW site, or book, including their quality, merchantability, or fitness for a<br />
particular purpose. In no event will <strong>Springer</strong>-Verlag, or the author be liable for direct, indirect, special,<br />
incidental, or consequential damages arising out of the use or inability to use the disc, WWW site, or<br />
book, even if <strong>Springer</strong>-Verlag or the author has been advised of the possibility of such damages.<br />
About the Book<br />
Send us Mail<br />
Go to Main Page<br />
file:///E|/WEBSITE/INFO/COPYRIGH.HTM [19/1/2003 1:34:01]