This is intended as an introductory text, and for the most part, axiomatizations and formal proofs of results have been omitted (although the book does include extensive pointers to the literature). A large fraction of the book is devoted to exercises, ranging from straightforward applications of the concepts discussed to more interesting and involved problems. A couple of caveats about the readability of the book: many of the gures are insu ciently labelled or captioned, making them a challenge to decipher, and simple points seem to be belaboured in some places, while in other places a desire to keep the discussion informal has led to sloppiness. Nevertheless, this book should be valuable to anyone interested in learning about algorithmic game theory and electronic commerce. Review5 of Algorithms: Sequential, Parallel, and Distributed Authors: Kenneth A. Berman and Jerome L. Paul Publisher: Thomson Course Technology, 2005 $84.95, Hardcover, 962 pages Reviewer: William Schmeister Introduction Algorithms: Sequential, Parallel, and Distributed is an introduction to algorithms meant to provide a solid foundation for classical theory of algorithms. The target audience of the book, as stated in the preface, along with the content of the book, is the upper division undergraduate or the
End of preview. The entire article is 6 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/review-of-algorithms-sequential-parallel-and-distributed-by-kenneth-a-A6HErxtDoU
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Review of Algorithms: Sequential, Parallel, and Distributed by Kenneth A. Berman and Jerome L. Paul, Thomson Course Technology, 2005
Schmeister, William
Follow ACM SIGACT News
, Volume 37 (2)
Association for Computing Machinery – Jun 1, 2006
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
