﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>BlogJava-Code.art-随笔分类-Algorithms.art</title><link>http://www.blogjava.net/Artvip/category/10065.html</link><description>public class code (string [art])</description><language>zh-cn</language><lastBuildDate>Thu, 01 Mar 2007 13:07:20 GMT</lastBuildDate><pubDate>Thu, 01 Mar 2007 13:07:20 GMT</pubDate><ttl>60</ttl><item><title>About Introduction to Algorithms </title><link>http://www.blogjava.net/Artvip/archive/2006/05/01/44304.html</link><dc:creator>Art</dc:creator><author>Art</author><pubDate>Mon, 01 May 2006 13:05:00 GMT</pubDate><guid>http://www.blogjava.net/Artvip/archive/2006/05/01/44304.html</guid><wfw:comment>http://www.blogjava.net/Artvip/comments/44304.html</wfw:comment><comments>http://www.blogjava.net/Artvip/archive/2006/05/01/44304.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/Artvip/comments/commentRss/44304.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/Artvip/services/trackbacks/44304.html</trackback:ping><description><![CDATA[
		<span style="FONT-FAMILY: arial">Aho, Alfred V., John E. Hopcroft, 与 Jeffrey D. Ullman. 《<strong><em>计算机算法之设计与分析》（The Design and Analysis of Computer Algorithms） Addison-Wesley</em></strong>， 1974. 经典作品，但是在网络流，线性规划和近代算法方面较缺少。 Aho, Alfred V., John E. Hopcroft, and Jeffrey D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974. The classic text, but it lacks topics in network flows and linear programming, as well as more recent algorithms. <br /><br /><br />Aho， Alfred V.， John E. Hopcroft， 与 Jeffrey D. Ullman. 《<strong><em>数据结构与算法》（Data Structures and Algorithms） Addison-Wesley</em></strong>， 1983. 重新改版过后是以前作《计算机算法之设计与分析》（The Design and Analysis of Computer Algorithms ）前六章所改版的较基本版本。<br />Aho, Alfred V., John E. Hopcroft, and Jeffrey D. Ullman. Data Structures and Algorithms. Addison-Wesley, 1983. Revised and more elementary version of the first six chapters of The Design and Analysis of Computer Algorithms.<br /><br /><br /><br />Baase， Sara. <strong><em>《计算机算法：设计与分析导论，第二版》（Computer Algorithms: Introduction to Design and Analysis. 2nd ed） Addison-Wesley</em></strong>， 1988. 普通参考，尽管它的说明有时是潦草扼要的。<br />Baase, Sara. Computer Algorithms: Introduction to Design and Analysis. 2nd ed. Addison-Wesley, 1988. General reference, although the exposition is sometimes terse or sketchy.<br /><br /><br /><br />Bentley， Jon. <em><strong>《程序设计明珠》（Programming Pearls） Addison-Wesley</strong></em>， 1986. 算法设计在软件工程中的实用。（Programming Pearls 繁体中文版, 译者：许鸣程，出版商：基峰，出版日期：2001-11-22，ISBN：9575668804）<br />Bentley, Jon. Programming Pearls. Addison-Wesley, 1986. Applications of algorithm design techniques to software engineering.<br /><br /><br /><br />Bentley， Jon. <strong><em>《更多的程序设计明珠》（More Programming Pearls） Addison-Wesley</em></strong>， 1988. 更多算法设计在软件工程中的实用。<br />Bentley, Jon. More Programming Pearls. Addison-Wesley, 1988. More applications of algorithm design techniques to software engineering.<br /><br /><br /><br />Bentley， Jon Louis. <em><strong>《编写有效率的程序》（Writing Efficient Programs） Prentice-Hall</strong></em>， 1982. 非常杰出的效能精进调整。<br />Bentley, Jon Louis. Writing Efficient Programs. Prentice-Hall, 1982. Performance hacking extraordinaire.<br /><br /><br /><br />Brassard， Gilles 与 Paul Bratley. <strong><em>《算法：理论与实践》，Prentice-Hall</em></strong>， 1988. 很好的范例及习题，着重于方法而不是个别的问题。<br />Brassard, Gilles and Paul Bratley. Algorithmics: Theory and Practice. Prentice-Hall, 1988. Good examples and problems. Focus on methods rather than specific problems.<br /><br /><br /><br />Chung， Kai Lai. <strong><em>《基础概率理论与随机过程》，Springer-Verlag</em></strong>， 1974. 对概率直觉性的演示课。<br />Chung, Kai Lai. Elementary Probability Theory with Stochastic Processes. Springer-Verlag, 1974. Intuitive introduction to probability.<br /><br /><br /><br />Even， Shimon. <strong><em>《图形算法》，Computer Science Press</em></strong>， 1979. 对图形算法有广泛的论述，包含了网络流及平面性。<br />Even, Shimon. Graph Algorithms. Computer Science Press, 1979. Broad treatment of graph algorithms, including network flow and planarity.<br /><br /><br /><br />Feller， William. <strong><em>《概率理论导论与应用》，John Wiley &amp; Sons</em></strong>， Vol 1. 1968， Vol 2. 1971. 对概率很好的参考。<br />Feller, William. An Introduction to Probability Theory and Its Applications. John Wiley &amp; Sons, Vol 1. 1968, Vol 2. 1971. Excellent reference for probability theory.<br /><br /><br /><br />Garey， Michael R. 与David S. Johnson. 《<strong><em>计算机与难驾驭性：对NP完整性理论的指南》，San Francisco: W. H. Freeman &amp; Co</em></strong>， 1979. 专注于NP完整性的参考书。在后半部含有一份NP完整问题集的列表及在书中出现过，针对多项式时间特别情况的算法的参考。<br />Garey, Michael R. and David S. Johnson. Computers and Intractibility: A Guide to the Theory of NP-Completeness. San Francisco: W. H. Freeman &amp; Co., 1979. Reference book devoted to NP-completeness. The second half contains an extensive list of NP-complete problems and references to algorithms in the literature for polynomial-time special cases.<br /><br /><br /><br />Gonnet， G. H. <em><strong>《算法与数据结构手册》，Addison-Wesley</strong></em>， 1984. Pascal 及 C 码， 真正执行时间的比较，和对研究报告中分析的指示。<br />Gonnet, G. H. Handbook of Algorithms and Data Structures. Addison-Wesley, 1984. Code in Pascal and C, comparisons of actual running times, and pointers to analysis in research papers.<br /><br /><br /><br />Gusfield， Dan. <strong><em>《字串，树，与序列的算法》， Cambridge University Press</em></strong>， 1997. 操作字符字串及序列的算法的大概论述。<br />Gusfield, Dan. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, 1997. General treatment of algorithms that operate on character strings and sequences.<br /><br /><br /><br />Horowitz， Ellis 与Sartaj Sahni. 《<em><strong>计算机算法基础》，Computer Science Press</strong></em>， 1978. 择重介绍了数据结构，动态编程，以及分支与界限法。<br />Horowitz, Ellis and Sartaj Sahni. Fundamentals of Computer Algorithms. Computer Science Press, 1978. Good on data structures, dynamic programming, and branch-and-bound algorithms.<br /><br /><br /><br />Kingston， Jeffrey H. <em><strong>《算法与数据结构：设计，正确性，分析》，Addison-Wesley Publishing Co</strong></em>.， 1991. 一本优良的数据结构导入书，关于算法正确性有一篇不错的章节。<br />Kingston, Jeffrey H. Algorithms and Data Structures: Design, Correctness, Analysis. Addison-Wesley Publishing Co., 1991. A nice introductory book on data structures, with a good chapter on algorithm correctness.<br /><br /><br /><br />Knuth， Donald E. <strong><em><font color="#ff0000">《计算机程序设计艺术》，Addison-Wesley</font></em></strong>. 三卷如百科全书般的作品：(1) 基础算法， (2) 半数值算法， 与 (3) 排序与搜寻。<br />Knuth, Donald E. The Art of Computer Programming. Addison-Wesley. Encyclopedic work in three volumes: (1) Fundamental Algorithms, (2) Seminumerical Algorithms, and (3) Sorting and Searching.<br /><br /><br /><br />Lawler， Eugene L. <em><strong>《组合式优选》，Holt， Rinehart， and Winston</strong></em>， 1976. 图算法（密集图)，网络流，与线型规划。开始几章是很优秀的。<br />Lawler, Eugene L. Combinatorial Optimization. Holt, Rinehart, and Winston, 1976. Graph algorithms (dense graphs), network flows, and linear programming. First few chapters are excellent.<br /><br /><br /><br />Liu， C. L. <em><strong>《组合数学导论》，McGraw-Hill</strong></em>， 1968. 与计算机科学有关的组合数学。有优秀的习题.<br />Liu, C. L. Introduction to Combinatorial Mathematics. McGraw-Hill, 1968. Combinatorial mathematics relevant to computer science. Excellent problems.<br /><br /><br /><br />Manber， Udi. <em><strong><font color="#ff0000">《算法导论》，Addison-Wesley</font></strong></em>， 1989. 着重于创造力的初级文章。<br />Manber, Udi. Introduction to Algorithms. Addison-Wesley, 1989. Elementary text with an emphasis on creativity.<br /><br /><br /><br />Mehlhorn， Kurt. <em><strong>《数据结构与算法》，Springer-Verlag</strong></em>， 1984. 三卷： (1) 排序与搜寻， (2) 图算法和NP－完整性， 与 (3) 多维度查询与计算几何。基本及高阶论题的讲义。<br />Mehlhorn, Kurt. Data Structures and Algorithms. Springer-Verlag, 1984. Three volumes: (1) Sorting and Searching, (2) Graph Algorithms and NP-Completeness, and (3) Multidimensional Searching and Computational Geometry. Lecture notes on basic and advanced topics.<br /><br /><br /><br />Niven， Ivan 与Herbert S. Zuckerman. 《<em><strong>数论导论》，John Wiley &amp; Sons</strong></em>， 1980. 有阅读价值的的数论入门介绍。<br />Niven, Ivan and Herbert S. Zuckerman. An Introduction to the Theory of Numbers. John Wiley &amp; Sons, 1980. Readable introduction to number theory.<br /><br /><br /><br />Papadimitriou， Christos H. 与Kenneth Steiglitz. <em><strong>《组合式优选：算法与复杂性》，Prentice-Hall</strong></em>， 1982. 线性规划和它的变体。<br />Papadimitriou, Christos H. and Kenneth Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, 1982. Linear programming and its variants.<br /><br /><br /><br />Press， William P.， Brian P. Flannery， Saul A. Teukolsky， 与 William T. Vetterling. <em><strong>《C的数值处方：科学计算的艺术》，Cambridge: Cambridge University Press</strong></em>， 1988. 数值算法的程序码.<br />Press, William P., Brian P. Flannery, Saul A. Teukolsky, and William T. Vetterling. Numerical Recipies in C: The Art of Scientific Computing. Cambridge: Cambridge University Press, 1988. Code for numerical algorithms.<br /><br /><br /><br />Reingold， E. M.， J. Nievergelt， 与N. Deo. 《<em><strong>组合算法：理论与应用》，Prentice-Hall</strong></em>， 1977. 在递归关系和二元树方面的内容不错。<br />Reingold, E. M., J. Nievergelt, and N. Deo. Combinatorial Algorithms: Theory and Practice. Prentice-Hall, 1977. Good on recurrence relations and binary search trees.<br /><br /><br /><br />Sedgewick， Robert . <em><strong>《算法，第二版》，Addison-Wesley</strong></em>， 1988. 有着优秀论题广度的初阶文章。不重于分析，但是有很多图。<br />Sedgewick, Robert . Algorithms. 2nd ed. Addison-Wesley, 1988. Elementary text with an excellent breadth of topics. Light on analysis, but lots of figures.<br /><br /><br /><br />Sipser， Michael. <em><strong>《运算理论导论》，PWS Publishing Co</strong></em>.， 1997. 对可计算性及复杂性理论很好的文章。<br />Sipser, Michael. Introduction to the Theory of Computation. PWS Publishing Co., 1997. A good text on computability and complexity theory.<br /><br /><br /><br />Tarjan， Robert Endre. <em><strong>《数据结构与网络算法》，Society for Industrial and Applied Mathematics</strong></em>， 1983. 有一堆好东西的高阶书。<br />Tarjan, Robert Endre. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, 1983. Advanced book with tons of good stuff.</span>
		<br />
<img src ="http://www.blogjava.net/Artvip/aggbug/44304.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/Artvip/" target="_blank">Art</a> 2006-05-01 21:05 <a href="http://www.blogjava.net/Artvip/archive/2006/05/01/44304.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>