Encyclopedia of Algorithms

书名：Encyclopedia of Algorithms
作者：Ming-YangKao
译者：
ISBN：9780387307701
出版社：Springer
出版时间：2008-08-06
格式：epub/mobi/azw3/pdf
页数：1400页
豆瓣评分： 7.8

书籍简介：

The Encyclopedia of Algorithms will provide a comprehensive set of solutions to important algorithmic problems for students and researchers interested in quickly locating useful information. The first edition of the reference will focus on high-impact solutions from the most recent decade; later editions will widen the scope of the work. Nearly 500 entries will be organized alphabetically by problem, with subentries allowing for distinct solutions and special cases to be listed by the year. An entry will include: a description of the basic algorithmic problem the input and output specifications the key results examples of applications citations to the key literature Open problems, links to downloadable code, experimental results, data sets, and illustrations may be provided. All entries will be written by experts; links to Internet sites that outline their research work will also be provided. The entries will be peer-reviewed. This defining reference will be published in print and on line. The print publication will include an index of subjects and authors as well as a chronology for locating recent solutions. The online edition will supplement this index with hyperlinks as well as include hyperlinks in the text of the entries to related entries, xRefer citations, and other useful URLs mentioned above.

作者简介：

Ming-Yang Kao

Department of Electrical Engineering and Computer Science

McCormick School of Engineering and Applied Science

Northwestern University

2145 Sheridan Road, Room M324

Evanston, IL 60208

(o) 847-230-9867

kao@northwestern.edu

www.cs.northwestern.edu/~kao

书友短评：

@ 可乐音 有些浅显，感觉类似All of statistics。 @ 简称为老陶 这种参考书根本不可能读完，而且读完也没用。但是没读完就说自己“读过”又很不好意思。这本书中提到的算法的参考文献，比这本书还要重要。 @ 简称为老陶 这种参考书根本不可能读完，而且读完也没用。但是没读完就说自己“读过”又很不好意思。这本书中提到的算法的参考文献，比这本书还要重要。 @ 可乐音 有些浅显，感觉类似All of statistics。

添加微信公众号:好书天下获取