java

tiger

常用链接

统计

my Blogs

最新评论

计算机科学的史诗(算法)【转】

计算机科学的史诗
The Art of Computer Programming(TAOCP)

  学习讨论网页

如果你认为你是一名真正优秀的程序员……Knuth的《计算机程序设计艺术》,如果你能读懂整套书的话,请给我发一份你的简历。--Bill Gates

这是一套集所有基础算法之大成的经典之作。当今软件开发人员所掌握的绝大多数计算机程序设计的知识都来源于此。--Byte

作者简介:
    Donald.E.Knuth(
唐纳德.E.克努特,中文名高德纳)是算法和程序设计技术的先驱者,是计算机排版系统TEXMETAFONT的发明者,他因这些成就和大量创造性的影响深远的著作(19部书和160篇论文)而誉满全球。作为斯坦福大学计算机程序设计艺术的荣誉退休教授,他当前正全神贯注于完成其关于计算机科学的史诗性的七卷集。这一伟大工程在1962年他还是加利福尼亚理工学院的研究生时就开始了。
     Knuth
教授获得了许多奖项和荣誉,包括美国计算机协会图灵奖(ACM Turing Award),美国前总统卡特授予的科学金奖(Medal of Science),美国数学学会斯蒂尔奖(AMS Steele Prize),以及199611月由于发明先进技术荣获的极受尊重的京都奖(KyotoPrize)。现与其妻Jill生活于斯坦福校园内。

他的主页 http://www-cs-faculty.stanford.edu/~knuth/taocp.html

 At the end of 1999, these books (The Art of Comupter Programming) were named among the best twelve scientific monographs of the century by American Scientist, along with: Dirac on quantum mechanics, Einstein on relativity, Mandelbrot on fractals, Pauling on the chemical bond, Russell and Whitehead on foundations of mathematics, von Neumann and Morgenstern on game theory, Wiener on cybernetics, Woodward and Hoffmann on orbital symmetry, Feynman on quantum electrodynamics, Smith on the search for structure, and Einstein's collected papers.

 

下载这套书的第一和第三册中文版 (阅读该书使用的软件下载. 该内容来源于网络,仅供参考学习.如有用于商业目的,后果自负;如有版权冲突,来信告知,一定删除. 再次声明,该书来自网上其他书籍下载类站点,图书版权归原作者和电子书制作者所有。请您预览该书后,在24小时内从计算机上将该书删除。)

下载这套书的第二册英文版 (该内容来源于网络,仅供参考学习.如有用于商业目的,后果自负;如有版权冲突,来信告知,一定删除. 再次声明,该书来自网上其他书籍下载类站点,图书版权归原作者和电子书制作者所有。请您预览该书后,在24小时内从计算机上将该书删除。)

knuth 先生的<< 具体数学>> 下载(TAOCP 的数学基础)

<< 算法导论>> 下载( 经典的教材)


算法导论

Introduction to AlgorithmsCLRS

学习和讨论网页

本书自第一版出版以来,已经成为世界范围内广泛使用的大学教材和专业人员的标准参考手册。本书全面论述了算法的内容,从一定深度上涵盖了算法的诸多方面,同时其讲授和分析方法又兼顾了各个层次读者的接受能力。各章内容自成体系,可作为独立单元学习。所有算法都用英文和伪码描述,使具备初步编程经验的人也可读懂。全书讲解通俗易懂,且不失深度和数学上的严谨性。

Topics covered: Overview of algorithms (including algorithms as a technology); designing and analyzing algorithms; asymptotic notation; recurrences and recursion; probabilistic analysis and randomized algorithms; heapsort algorithms; priority queues; quicksort algorithms; linear time sorting (including radix and bucket sort); medians and order statistics (including minimum and maximum); introduction to data structures (stacks, queues, linked lists, and rooted trees); hash tables (including hash functions); binary search trees; red-black trees; augmenting data structures for custom applications; dynamic programming explained (including assembly-line scheduling, matrix-chain multiplication, and optimal binary search trees); greedy algorithms (including Huffman codes and task-scheduling problems); amortized analysis (the accounting and potential methods); advanced data structures (including B-trees, binomial and Fibonacci heaps, representing disjoint sets in data structures); graph algorithms (representing graphs, minimum spanning trees, single-source shortest paths, all-pairs shortest paths, and maximum flow algorithms); sorting networks; matrix operations; linear programming (standard and slack forms); polynomials and the Fast Fourier Transformation (FFT); number theoretic algorithms (including greatest common divisor, modular arithmetic, the Chinese remainder theorem, RSA public-key encryption, primality testing, integer factorization); string matching; computational geometry (including finding the convex hull); NP-completeness (including sample real-world NP-complete problems and their insolvability); approximation algorithms for NP-complete problems (including the traveling salesman problem); reference sections for summations and other mathematical notation, sets, relations, functions, graphs and trees, as well as counting and probability backgrounder (plus geometric and binomial distributions).

  请记住:算法导论 是本教材 而 TAOCP 是本史诗。

电子版下载

TAOCP 讨论网页

 

posted on 2006-04-26 09:36 翠竹 阅读(829) 评论(0)  编辑  收藏 所属分类: java好书


只有注册用户登录后才能发表评论。


网站导航: