This material has been developed over a period of several years in an upper-division course taught to computer science students at SUNY, Stony Brook, by Steve Skiena. A major goal of the author has been to take some of the "mystery" out of identifying and dealing with algorithms which these students will later use in the workplace, drawing heavily on the author's own real-world experiences, the book stressing design and analysis. Thus the work takes on a very practical character, as reflected in its title: "Manual". The Book is divided into two parts, the first being a general guide to techniques for the design and analysis of computer algorithms. The second is a reference section, comprising the catalog of algorithmic resources, implementations, and an extensive bibliography. The primary audience for this book/CD-ROM combination is the working professional who uses algorithms on a daily basis and has need for a handy reference.A major feature of this book is the inclusion of a complete "catalog" of important algorithmic problems.By browsing this catalog, readers can quickly identify what the problem they have encountered is called, what is known about it, and how they should proceed if they need to solve it. Nothing like this catalog exists in the computing literature for general computer algorithms. This work can also readily be used as a course supplement or adjunct text in standard courses on algorithm design, or simply as a "student reference guide", as the author puts it. Pedagogic features include pen-and-paper exercises, "team projects", independent student projects, "take home" lessons (goals) at the beginning of chapters. Other teaching and learning aids reside on the accompanying CD-ROM.
"synopsis" may belong to another edition of this title.
..."the book is an algorithm implementation treasure trove, and putting all of these implementations in one place was no small feat. The list of implementations, an extensive bibliography, and the CD-ROM make the book an invaluable resource for everyone interested in the subject." --ACM Computing Reviews .,."the book is an algorithm implementation treasure trove, and putting all of these implementations in one place was no small feat. The list of implementations, an extensive bibliography, and the CD-ROM make the book an invaluable resource for everyone interested in the subject." --ACM Computing Reviews
This material has been developed over a period of several years in an upper-division course taught to computer science students at SUNY, Stony Brook, by Steve Skiena. A major goal of the author has been to take some of the "mystery" out of identifying and dealing with algorithms which these students will later use in the workplace, drawing heavily on the author's own real-world experiences, the book stressing design and analysis. Thus the work takes on a very practical character, as reflected in its title: "Manual". The Book is divided into two parts, the first being a general guide to techniques for the design and analysis of computer algorithms. The second is a reference section, comprising the catalog of algorithmic resources, implementations, and an extensive bibliography. The primary audience for this book/CD-ROM combination is the working professional who uses algorithms on a daily basis and has need for a handy reference.A major feature of this book is the inclusion of a complete "catalog" of important algorithmic problems.By browsing this catalog, readers can quickly identify what the problem they have encountered is called, what is known about it, and how they should proceed if they need to solve it.
Nothing like this catalog exists in the computing literature for general computer algorithms. This work can also readily be used as a course supplement or adjunct text in standard courses on algorithm design, or simply as a "student reference guide", as the author puts it. Pedagogic features include pen-and-paper exercises, "team projects", independent student projects, "take home" lessons (goals) at the beginning of chapters. Other teaching and learning aids reside on the accompanying CD-ROM."About this title" may belong to another edition of this title.
Seller: Better World Books: West, Reno, NV, U.S.A.
Condition: Good. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good. Seller Inventory # GRP82963869
Seller: World of Books (was SecondSale), Montgomery, IL, U.S.A.
Condition: Good. Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc. Seller Inventory # 00110768417
Seller: BooksRun, Philadelphia, PA, U.S.A.
Hardcover. Condition: Fair. 1st ed. 1998. Corr. 2nd printing. The item might be beaten up but readable. May contain markings or highlighting, as well as stains, bent corners, or any other major defect, but the text is not obscured in any way. Seller Inventory # 0387948600-7-1-13
Seller: World of Books Inc, Montgomery, IL, U.S.A.
Hardback. Condition: Good. Most professional programmers that I've encountered are not well prepared to tacklealgorithmdesignproblems.Thisisapity, becausethetechniquesofalgorithm design form one of the core practical technologies of computer science. Designing correct, e?cient, and implementable algorithms for real-world problems requires access to two distinct bodies of knowledge: - Techniques - Good algorithm designers understand several fundamental - gorithm design techniques, including data structures, dynamic programming, depth-?rst search, backtracking, and heuristics. Perhaps the single most - portantdesigntechniqueismodeling, theartofabstractingamessyreal-world application into a clean problem suitable for algorithmic attack. - Resources - Good algorithm designers stand on the shoulders of giants. Ratherthanlaboringfromscratchtoproduceanewalgorithmforeverytask, they can ?gure out what is known about a particular problem. Rather than re-implementing popular algorithms from scratch, they seek existing imp- mentations to serve as a starting point. They are familiar with many classic algorithmic problems, which provide su?cient source material to model most any application. This book is intended as a manual on algorithm design, providing access to combinatorial algorithm technology for both students and computer professionals. Seller Inventory # CIN0387948600G
Seller: Evergreen Goodwill, Seattle, WA, U.S.A.
hardcover. Condition: Good. Seller Inventory # mon0000308583
Seller: HPB-Red, Dallas, TX, U.S.A.
Hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Seller Inventory # S_417265536
Seller: PAPER CAVALIER UK, London, United Kingdom
Condition: very good. Gently used. May include previous owner's signature or bookplate on the front endpaper, sticker on back and/or remainder mark on text block. Seller Inventory # 9780387948607-3
Quantity: 1 available
Seller: Argosy Book Store, ABAA, ILAB, New York, NY, U.S.A.
hardcover. Condition: near fine. Illustrated in black and white. 486 pages. 8vo, red pictorial boards. New York: Springer-Verlag, (1998). A near fine copy. Accompanying CD at rear. Seller Inventory # 310913
Seller: Anybook.com, Lincoln, United Kingdom
Condition: Fair. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In fair condition, suitable as a study copy. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,1100grams, ISBN:9780387948607. Seller Inventory # 3993861
Quantity: 1 available
Seller: Budget Books, Pasadena, CA, U.S.A.
Hardcover. Condition: New. No Jacket. 1st Edition. With unopened CD-ROM. Ships from California. Seller Inventory # 6963