锘??xml version="1.0" encoding="utf-8" standalone="yes"?>亚洲av无码专区首页,精品久久久久久亚洲,国产亚洲美女精品久久久久狼http://www.tkk7.com/Artvip/public class code (string [art])zh-cnSun, 11 May 2025 06:19:31 GMTSun, 11 May 2025 06:19:31 GMT60About Introduction to Algorithms http://www.tkk7.com/Artvip/archive/2006/05/01/44304.htmlArtArtMon, 01 May 2006 13:05:00 GMThttp://www.tkk7.com/Artvip/archive/2006/05/01/44304.htmlhttp://www.tkk7.com/Artvip/comments/44304.htmlhttp://www.tkk7.com/Artvip/archive/2006/05/01/44304.html#Feedback0http://www.tkk7.com/Artvip/comments/commentRss/44304.htmlhttp://www.tkk7.com/Artvip/services/trackbacks/44304.htmlAho, Alfred V., John E. Hopcroft, 涓?Jeffrey D. Ullman. 銆?strong>璁$畻鏈虹畻娉曚箣璁捐涓庡垎鏋愩嬶紙The Design and Analysis of Computer Algorithms錛?Addison-Wesley錛?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.
Aho錛?Alfred V.錛?John E. Hopcroft錛?涓?Jeffrey D. Ullman. 銆?strong>鏁版嵁緇撴瀯涓庣畻娉曘嬶紙Data Structures and Algorithms錛?Addison-Wesley錛?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.
Baase錛?Sara. 銆婅綆楁満綆楁硶錛氳璁′笌鍒嗘瀽瀵艱錛岀浜岀増銆嬶紙Computer Algorithms: Introduction to Design and Analysis. 2nd ed錛?Addison-Wesley錛?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.
Brassard錛?Gilles 涓?Paul Bratley. 銆婄畻娉曪細鐞嗚涓庡疄璺點嬶紝Prentice-Hall錛?1988. 寰堝ソ鐨勮寖渚嬪強涔?fàn)棰樺Q岀潃閲嶄簬鏂規(guī)硶鑰屼笉鏄釜鍒殑闂銆?br />Brassard, Gilles and Paul Bratley. Algorithmics: Theory and Practice. Prentice-Hall, 1988. Good examples and problems. Focus on methods rather than specific problems.
Chung錛?Kai Lai. 銆婂熀紜姒傜巼鐞嗚涓庨殢鏈鴻繃紼嬨嬶紝Springer-Verlag錛?1974. 瀵規(guī)鐜囩洿瑙夋х殑婕旂ず璇俱?br />Chung, Kai Lai. Elementary Probability Theory with Stochastic Processes. Springer-Verlag, 1974. Intuitive introduction to probability.
Even錛?Shimon. 銆婂浘褰㈢畻娉曘嬶紝Computer Science Press錛?1979. 瀵瑰浘褰㈢畻娉曟湁騫挎硾鐨勮榪幫紝鍖呭惈浜嗙綉緇滄祦鍙婂鉤闈㈡с?br />Even, Shimon. Graph Algorithms. Computer Science Press, 1979. Broad treatment of graph algorithms, including network flow and planarity.
Feller錛?William. 銆婃鐜囩悊璁哄璁轟笌搴旂敤銆嬶紝John Wiley & Sons錛?Vol 1. 1968錛?Vol 2. 1971. 瀵規(guī)鐜囧緢濂界殑鍙傝冦?br />Feller, William. An Introduction to Probability Theory and Its Applications. John Wiley & Sons, Vol 1. 1968, Vol 2. 1971. Excellent reference for probability theory.
Garey錛?Michael R. 涓嶥avid S. Johnson. 銆?strong>璁$畻鏈轟笌闅鵑┚椹э細瀵筃P瀹屾暣鎬х悊璁虹殑鎸囧崡銆嬶紝San Francisco: W. H. Freeman & Co錛?1979. 涓撴敞浜嶯P瀹屾暣鎬х殑鍙傝冧功銆傚湪鍚庡崐閮ㄥ惈鏈変竴浠絅P瀹屾暣闂闆嗙殑鍒楄〃鍙婂湪涔︿腑鍑虹幇榪囷紝閽堝澶氶」寮忔椂闂寸壒鍒儏鍐電殑綆楁硶鐨勫弬鑰冦?br />Garey, Michael R. and David S. Johnson. Computers and Intractibility: A Guide to the Theory of NP-Completeness. San Francisco: W. H. Freeman & 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.
Gonnet錛?G. H. 銆婄畻娉曚笌鏁版嵁緇撴瀯鎵嬪唽銆嬶紝Addison-Wesley錛?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.
Gusfield錛?Dan. 銆婂瓧涓詫紝鏍?wèi)锛屼笌搴忓垪鐨劷帡娉曘嬶紝 Cambridge University Press錛?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.
Horowitz錛?Ellis 涓嶴artaj Sahni. 銆?em>璁$畻鏈虹畻娉曞熀紜銆嬶紝Computer Science Press錛?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.
Kingston錛?Jeffrey H. 銆婄畻娉曚笌鏁版嵁緇撴瀯錛氳璁★紝姝g‘鎬э紝鍒嗘瀽銆嬶紝Addison-Wesley Publishing Co.錛?1991. 涓鏈紭鑹殑鏁版嵁緇撴瀯瀵煎叆涔︼紝鍏充簬綆楁硶姝g‘鎬ф湁涓綃囦笉閿欑殑绔犺妭銆?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.
Knuth錛?Donald E. 銆婅綆楁満紼嬪簭璁捐鑹烘湳銆嬶紝Addison-Wesley. 涓夊嵎濡傜櫨縐戝叏涔﹁埇鐨勪綔鍝侊細(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.
Lawler錛?Eugene L. 銆婄粍鍚堝紡浼橀夈嬶紝Holt錛?Rinehart錛?and Winston錛?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.
Liu錛?C. L. 銆婄粍鍚堟暟瀛﹀璁恒嬶紝McGraw-Hill錛?1968. 涓庤綆楁満縐戝鏈夊叧鐨勭粍鍚堟暟瀛︺傛湁浼樼鐨勪範(fàn)棰? Liu, C. L. Introduction to Combinatorial Mathematics. McGraw-Hill, 1968. Combinatorial mathematics relevant to computer science. Excellent problems.
Manber錛?Udi. 銆婄畻娉曞璁恒嬶紝Addison-Wesley錛?1989. 鐫閲嶄簬鍒涢犲姏鐨勫垵綰ф枃绔犮?br />Manber, Udi. Introduction to Algorithms. Addison-Wesley, 1989. Elementary text with an emphasis on creativity.
Mehlhorn錛?Kurt. 銆婃暟鎹粨鏋勪笌綆楁硶銆嬶紝Springer-Verlag錛?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.
Niven錛?Ivan 涓嶩erbert S. Zuckerman. 銆?em>鏁拌瀵艱銆嬶紝John Wiley & Sons錛?1980. 鏈夐槄璇諱環(huán)鍊肩殑鐨勬暟璁哄叆闂ㄤ粙緇嶃?br />Niven, Ivan and Herbert S. Zuckerman. An Introduction to the Theory of Numbers. John Wiley & Sons, 1980. Readable introduction to number theory.
Papadimitriou錛?Christos H. 涓嶬enneth Steiglitz. 銆婄粍鍚堝紡浼橀夛細綆楁硶涓庡鏉傛с嬶紝Prentice-Hall錛?1982. 綰挎ц鍒掑拰瀹冪殑鍙樹綋銆?br />Papadimitriou, Christos H. and Kenneth Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, 1982. Linear programming and its variants.
Press錛?William P.錛?Brian P. Flannery錛?Saul A. Teukolsky錛?涓?William T. Vetterling. 銆奀鐨勬暟鍊煎鏂癸細縐戝璁$畻鐨勮壓鏈嬶紝Cambridge: Cambridge University Press錛?1988. 鏁板肩畻娉曠殑紼嬪簭鐮? 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.
Reingold錛?E. M.錛?J. Nievergelt錛?涓嶯. Deo. 銆?em>緇勫悎綆楁硶錛氱悊璁轟笌搴旂敤銆嬶紝Prentice-Hall錛?1977. 鍦ㄩ掑綊鍏崇郴鍜屼簩鍏冩爲(wèi)鏂歸潰鐨勫唴瀹逛笉閿欍?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.
Sedgewick錛?Robert . 銆婄畻娉曪紝絎簩鐗堛嬶紝Addison-Wesley錛?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.
Sipser錛?Michael. 銆婅繍綆楃悊璁哄璁恒嬶紝PWS Publishing Co.錛?1997. 瀵瑰彲璁$畻鎬у強澶嶆潅鎬х悊璁哄緢濂界殑鏂囩珷銆?br />Sipser, Michael. Introduction to the Theory of Computation. PWS Publishing Co., 1997. A good text on computability and complexity theory.
Tarjan錛?Robert Endre. 銆婃暟鎹粨鏋勪笌緗戠粶綆楁硶銆嬶紝Society for Industrial and Applied Mathematics錛?1983. 鏈変竴鍫嗗ソ涓滆タ鐨勯珮闃朵功銆?br />Tarjan, Robert Endre. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, 1983. Advanced book with tons of good stuff.