Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

The book review column

The book review column The Book Review Column∗ William Gasarch Department of Computer Science University of Maryland at College Park College Park, MD, 20742 gasarch@cs.umd.edu In this column we review 10 books on ALGORITHMS. 1. How to Think about Algorihtms by Je € Edmonds. Review by Kryiakos N. Sgarbas. This algorithmic textbook uses a meta-algorithmic approach to reveal that all algorithms of the same category work more or less the same way. The emphasis is more on how they work and how to think about them than on formal details of analysis. 2. A Programmer ™s Companion to Algorithm Analysis by Ernst Leiss. Review by Dean Kelley. This is not a textbook on algorithms. Rather, it focuses on the process of converting an algorithm to e ƒcient, correctly behaving and stable code. In doing so, it necessarily examines the considerable gulf between the abstract view of things when an algorithm is being designed and analyzed and the hard reality of the environment in which it ™s implementation executes. 3. Joint review of Algorithms by Johnonbaugh and Schaefer and Algorithms by Dasgupta, Papadimitriou, and U. Vazirani. Joint review by Dean Kelley. This is a joint review of two Algorithms textbooks. In many cases http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGACT News Association for Computing Machinery

The book review column

Gasarch, William
ACM SIGACT News , Volume 40 (2) – Jun 20, 2009
Download PDF
4 pages

Loading next page...
 
/lp/association-for-computing-machinery/the-book-review-column-zS9OJey0cu

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 2009 by ACM Inc.
ISSN
0163-5700
DOI
10.1145/1556154.1556156
Publisher site
See Article on Publisher Site

Abstract

The Book Review Column∗ William Gasarch Department of Computer Science University of Maryland at College Park College Park, MD, 20742 gasarch@cs.umd.edu In this column we review 10 books on ALGORITHMS. 1. How to Think about Algorihtms by Je € Edmonds. Review by Kryiakos N. Sgarbas. This algorithmic textbook uses a meta-algorithmic approach to reveal that all algorithms of the same category work more or less the same way. The emphasis is more on how they work and how to think about them than on formal details of analysis. 2. A Programmer ™s Companion to Algorithm Analysis by Ernst Leiss. Review by Dean Kelley. This is not a textbook on algorithms. Rather, it focuses on the process of converting an algorithm to e ƒcient, correctly behaving and stable code. In doing so, it necessarily examines the considerable gulf between the abstract view of things when an algorithm is being designed and analyzed and the hard reality of the environment in which it ™s implementation executes. 3. Joint review of Algorithms by Johnonbaugh and Schaefer and Algorithms by Dasgupta, Papadimitriou, and U. Vazirani. Joint review by Dean Kelley. This is a joint review of two Algorithms textbooks. In many cases

Journal

ACM SIGACT News – Association for Computing Machinery

Published: Jun 20, 2009

There are no references for this article.