"\u0645\u0642\u062F\u0645\u0629 \u0641\u064A \u0627\u0644\u062E\u0648\u0627\u0631\u0632\u0645\u064A\u0627\u062A (\u0643\u062A\u0627\u0628)"@ar . . . "Introduction to Algorithms"@ko . . "\u0645\u0642\u062F\u0645\u0629 \u0641\u064A \u0627\u0644\u062E\u0648\u0627\u0631\u0632\u0645\u064A\u0627\u062A (\u0628\u0627\u0644\u0625\u0646\u062C\u0644\u064A\u0632\u064A\u0629: Introduction to Algorithms )\u200F \u0647\u0648 \u0643\u062A\u0627\u0628 \u062A\u0639\u0644\u064A\u0645\u064A \u0641\u064A \u0645\u062C\u0627\u0644 \u0627\u0644\u062E\u0648\u0627\u0631\u0632\u0645\u064A\u0627\u062A \u064A\u0633\u062A\u0639\u0645\u0644 \u0644\u0644\u062A\u062F\u0631\u064A\u0633 \u0641\u064A \u0627\u0644\u0639\u062F\u064A\u062F \u0645\u0646 \u0627\u0644\u062C\u0627\u0645\u0639\u0627\u062A \u062D\u0648\u0644 \u0627\u0644\u0639\u0627\u0644\u0645 \u0648\u0647\u0648 \u0645\u0635\u062F\u0631 \u0643\u062B\u064A\u0631\u0627 \u0645\u0627 \u064A\u062A\u0645 \u0627\u0644\u0627\u0633\u062A\u0634\u0647\u0627\u062F \u0628\u0647 \u0641\u064A \u0627\u0644\u0623\u0648\u0631\u0627\u0642 \u0627\u0644\u0639\u0644\u0645\u064A\u0629 \u0627\u0644\u0645\u062A\u0639\u0644\u0642\u0629 \u0628\u0627\u0644\u062E\u0648\u0627\u0631\u0632\u0645\u064A\u0627\u062A\u060C \u0645\u0639 \u0623\u0643\u062B\u0631 \u0645\u0646 10,000 \u0627\u0642\u062A\u0628\u0627\u0633\u0627 \u0645\u0648\u062B\u0642\u0627 \u0639\u0644\u0649 \u0645\u062D\u0631\u0643 CiteSeerX. \u0645\u0624\u0644\u0641\u0648\u0627 \u0627\u0644\u0643\u062A\u0627\u0628 \u0647\u0645 \u062A\u0648\u0645\u0627\u0633 \u0643\u0648\u0631\u0645\u0646\u060C \u062A\u0634\u0627\u0631\u0644\u0632 \u0644\u0627\u064A\u0633\u064A\u0631\u0633\u064A\u0646\u060C \u0631\u0648\u0646\u0627\u0644\u062F \u0631\u064A\u0641\u0633\u062A\u060C \u0648\u0643\u0644\u064A\u0641\u064A\u0631\u062F \u0633\u062A\u0627\u064A\u0646 \u0648\u0644\u0630\u0644\u0643 \u064A\u0639\u0631\u0641 \u0627\u0644\u0643\u062A\u0627\u0628 \u0627\u062E\u062A\u0635\u0627\u0631\u0627 \u0628\u0640CLRS. \u0628\u064A\u0639\u062A \u0623\u0643\u062B\u0631 \u0645\u0646 \u0646\u0635\u0641 \u0645\u0644\u064A\u0648\u0646 \u0646\u0633\u062E\u0629 \u0645\u0646 \u0627\u0644\u0643\u062A\u0627\u0628 \u062E\u0644\u0627\u0644 \u0623\u0648\u0644 20 \u0633\u0646\u0629 \u0645\u0646 \u0637\u0628\u0639\u0647."@ar . "\u0645\u0642\u062F\u0645\u0629 \u0641\u064A \u0627\u0644\u062E\u0648\u0627\u0631\u0632\u0645\u064A\u0627\u062A (\u0628\u0627\u0644\u0625\u0646\u062C\u0644\u064A\u0632\u064A\u0629: Introduction to Algorithms )\u200F \u0647\u0648 \u0643\u062A\u0627\u0628 \u062A\u0639\u0644\u064A\u0645\u064A \u0641\u064A \u0645\u062C\u0627\u0644 \u0627\u0644\u062E\u0648\u0627\u0631\u0632\u0645\u064A\u0627\u062A \u064A\u0633\u062A\u0639\u0645\u0644 \u0644\u0644\u062A\u062F\u0631\u064A\u0633 \u0641\u064A \u0627\u0644\u0639\u062F\u064A\u062F \u0645\u0646 \u0627\u0644\u062C\u0627\u0645\u0639\u0627\u062A \u062D\u0648\u0644 \u0627\u0644\u0639\u0627\u0644\u0645 \u0648\u0647\u0648 \u0645\u0635\u062F\u0631 \u0643\u062B\u064A\u0631\u0627 \u0645\u0627 \u064A\u062A\u0645 \u0627\u0644\u0627\u0633\u062A\u0634\u0647\u0627\u062F \u0628\u0647 \u0641\u064A \u0627\u0644\u0623\u0648\u0631\u0627\u0642 \u0627\u0644\u0639\u0644\u0645\u064A\u0629 \u0627\u0644\u0645\u062A\u0639\u0644\u0642\u0629 \u0628\u0627\u0644\u062E\u0648\u0627\u0631\u0632\u0645\u064A\u0627\u062A\u060C \u0645\u0639 \u0623\u0643\u062B\u0631 \u0645\u0646 10,000 \u0627\u0642\u062A\u0628\u0627\u0633\u0627 \u0645\u0648\u062B\u0642\u0627 \u0639\u0644\u0649 \u0645\u062D\u0631\u0643 CiteSeerX. \u0645\u0624\u0644\u0641\u0648\u0627 \u0627\u0644\u0643\u062A\u0627\u0628 \u0647\u0645 \u062A\u0648\u0645\u0627\u0633 \u0643\u0648\u0631\u0645\u0646\u060C \u062A\u0634\u0627\u0631\u0644\u0632 \u0644\u0627\u064A\u0633\u064A\u0631\u0633\u064A\u0646\u060C \u0631\u0648\u0646\u0627\u0644\u062F \u0631\u064A\u0641\u0633\u062A\u060C \u0648\u0643\u0644\u064A\u0641\u064A\u0631\u062F \u0633\u062A\u0627\u064A\u0646 \u0648\u0644\u0630\u0644\u0643 \u064A\u0639\u0631\u0641 \u0627\u0644\u0643\u062A\u0627\u0628 \u0627\u062E\u062A\u0635\u0627\u0631\u0627 \u0628\u0640CLRS. \u0628\u064A\u0639\u062A \u0623\u0643\u062B\u0631 \u0645\u0646 \u0646\u0635\u0641 \u0645\u0644\u064A\u0648\u0646 \u0646\u0633\u062E\u0629 \u0645\u0646 \u0627\u0644\u0643\u062A\u0627\u0628 \u062E\u0644\u0627\u0644 \u0623\u0648\u0644 20 \u0633\u0646\u0629 \u0645\u0646 \u0637\u0628\u0639\u0647."@ar . . "\u0412\u0441\u0442\u0443\u043F \u0434\u043E \u0430\u043B\u0433\u043E\u0440\u0438\u0442\u043C\u0456\u0432"@uk . "Introducci\u00F3n a los algoritmos (Introduction to Algorithms en versi\u00F3n original) es un libro de Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest y Clifford Stein. Tiene tres ediciones en ingl\u00E9s, la primera 1990, sin Clifford Stein, una segunda en 2001, y una tercera en 2009. Se usa como libro de texto para ense\u00F1ar algoritmos en algunas universidades. Cormen ense\u00F1a en el Dartmouth College, Rivest y Leiserson dan clases en el MIT, y Clifford Stein ense\u00F1a en la Universidad de Columbia."@es . . . "Introducci\u00F3n a los algoritmos"@es . . "Introduction to Algorithms is a book on computer programming by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The book has been widely used as the textbook for algorithms courses at many universities and is commonly cited as a reference for algorithms in published papers, with over 10,000 citations documented on CiteSeerX. The book sold half a million copies during its first 20 years. Its fame has led to the common use of the abbreviation \"CLRS\" (Cormen, Leiserson, Rivest, Stein), or, in the first edition, \"CLR\" (Cormen, Leiserson, Rivest)."@en . "\u7B97\u6CD5\u5BFC\u8BBA"@zh . . . . . "\u0410\u043B\u0433\u043E\u0440\u0438\u0301\u0442\u043C\u044B: \u043F\u043E\u0441\u0442\u0440\u043E\u0435\u0301\u043D\u0438\u0435 \u0438 \u0430\u043D\u0430\u0301\u043B\u0438\u0437 (\u0430\u043D\u0433\u043B. Introduction to Algorithms, CLRS) \u2014 \u043A\u043D\u0438\u0433\u0430 \u043F\u043E \u0430\u043B\u0433\u043E\u0440\u0438\u0442\u043C\u0430\u043C \u0438 \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0430\u043C \u0434\u0430\u043D\u043D\u044B\u0445, \u043D\u0430\u043F\u0438\u0441\u0430\u043D\u043D\u0430\u044F \u0422\u043E\u043C\u0430\u0441\u043E\u043C \u041A\u043E\u0440\u043C\u0435\u043D\u043E\u043C, \u0427\u0430\u0440\u043B\u044C\u0437\u043E\u043C \u041B\u0435\u0439\u0437\u0435\u0440\u0441\u043E\u043D\u043E\u043C, \u0420\u043E\u043D\u0430\u043B\u044C\u0434\u043E\u043C \u0420\u0438\u0432\u0435\u0441\u0442\u043E\u043C \u0438 \u041A\u043B\u0438\u0444\u0444\u043E\u0440\u0434\u043E\u043C \u0428\u0442\u0430\u0439\u043D\u043E\u043C. \u041A\u043D\u0438\u0433\u0430 \u0438\u0441\u043F\u043E\u043B\u044C\u0437\u0443\u0435\u0442\u0441\u044F \u0432\u043E \u043C\u043D\u043E\u0433\u0438\u0445 \u0443\u0447\u0435\u0431\u043D\u044B\u0445 \u0437\u0430\u0432\u0435\u0434\u0435\u043D\u0438\u044F\u0445 \u0432 \u043A\u0430\u0447\u0435\u0441\u0442\u0432\u0435 \u043F\u043E\u0441\u043E\u0431\u0438\u044F \u0438 \u0441\u043F\u0440\u0430\u0432\u043E\u0447\u043D\u0438\u043A\u0430, \u043D\u0430 \u043A\u043D\u0438\u0433\u0443 \u0438\u043C\u0435\u0435\u0442\u0441\u044F \u0431\u043E\u043B\u0435\u0435 4000 \u0441\u0441\u044B\u043B\u043E\u043A \u043D\u0430 CiteSeerX."@ru . "Introduction to Algorithms"@en . . "Introduction to Algorithms is a book on computer programming by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The book has been widely used as the textbook for algorithms courses at many universities and is commonly cited as a reference for algorithms in published papers, with over 10,000 citations documented on CiteSeerX. The book sold half a million copies during its first 20 years. Its fame has led to the common use of the abbreviation \"CLRS\" (Cormen, Leiserson, Rivest, Stein), or, in the first edition, \"CLR\" (Cormen, Leiserson, Rivest). In the preface, the authors write about how the book was written to be comprehensive and useful in both teaching and professional environments. Each chapter focuses on an algorithm, and discusses its design techniques and areas of application. Instead of using a specific programming language, the algorithms are written in pseudocode. The descriptions focus on the aspects of the algorithm itself, its mathematical properties, and emphasize efficiency."@en . . . . . . . "Introduction to Algorithms"@en . . "1990"^^ . "Introduzione agli algoritmi"@it . . "Introduction \u00E0 l'algorithmique"@fr . "* I Foundations \n** 1 The Role of Algorithms in Computing\n** 2 Getting Started\n** 3 Characterizing Running Times\n** 4 Divide-and-Conquer\n** 5 Probabilistic Analysis and Randomized Algorithms\n* II Sorting and Order Statistics \n** 6 Heapsort\n** 7 Quicksort\n** 8 Sorting in Linear Time\n** 9 Medians and Order Statistics\n* III Data Structures \n** 10 Elementary Data Structures\n** 11 Hash Tables\n** 12 Binary Search Trees\n** 13 Red-Black Trees\n* IV Advanced Design and Analysis Techniques \n** 14 Dynamic Programming\n** 15 Greedy Algorithms\n** 16 Amortized Analysis\n* V Advanced Data Structures\n** 17 Augmenting Data Structures\n** 18 B-Trees\n** 19 Data Structures for Disjoint Sets\n* VI Graph Algorithms \n** 20 Elementary Graph Algorithms\n** 21 Minimum Spanning Trees\n** 22 Single-Source Shortest Paths\n** 23 All-Pairs Shortest Paths\n** 24 Maximum Flow\n** 25 Matching in Bipartite Graphs\n* VII Selected Topics\n** 26 Parallel Algorithms\n** 27 Online Algorithms\n** 28 Matrix Operations\n** 29 Linear Programming\n** 30 Polynomials and the FFT\n** 31 Number-Theoretic Algorithms\n** 32 String Matching\n** 33 Machine-Learning Algorithms\n** 34 NP-Completeness\n** 35 Approximation Algorithms\n* VIII Appendix: Mathematical Background \n** A Summations\n** B Sets, Etc.\n** C Counting and Probability\n** D Matrices"@en . "978-0-262-04630-5" . . . . "\u300A\u7B97\u6CD5\u5BFC\u8BBA\u300B\uFF08\u82F1\u8A9E\uFF1AIntroduction to Algorithms\uFF09\u662F\u57FA\u7840\u7B97\u6CD5\u65B9\u9762\u6700\u6743\u5A01\u3001\u6700\u8BE6\u7EC6\u7684\u8457\u4F5C\u4E4B\u4E00\uFF0C\u5728\u5F88\u591A\u56FD\u9645\u8457\u540D\u5927\u5B66\u88AB\u7528\u4E8E\u7B97\u6CD5\u8BFE\u7684\u6559\u6750\u3002\u8BF8\u591A\u7B97\u6CD5\u65B9\u9762\u7684\u8BBA\u6587\u5C06\u5176\u5217\u5165\u53C2\u8003\u6587\u732E\u5F53\u4E2D\u3002 \u8BE5\u4E66\u8BE6\u7EC6\u7684\u4ECB\u7ECD\u4E86\u8BF8\u591A\u5E38\u89C1\u7684\u7B97\u6CD5\u53CA\u6570\u636E\u7ED3\u6784\uFF0C\u5E76\u7528\u4E25\u8C28\u7684\u8BC1\u660E\u6765\u8BBA\u8BC1\u5176\u6B63\u786E\u6027\u3002\u6BCF\u4E2A\u7AE0\u8282\u5747\u6709\u4F8B\u9898\uFF0C\u9002\u5408\u5B66\u4E60\u8005\u6DF1\u5165\u7406\u89E3\u3002\u7B2C\u4E00\u7248\u520A\u884C\u4E8E1990\u5E74\uFF0C2009\u5E74\u6700\u65B0\u7248\u4E3A\u7B2C\u4E09\u7248\u3002\u5728\u8BB8\u591A\u56FD\u5BB6\u5E38\u5E38\u4EE5\u4F5C\u8005\u59D3\u540D\u9996\u4E2A\u82F1\u6587\u5B57\u6BCD\u88AB\u79F0\u4E3ACLRS\uFF08\u7B2C\u4E00\u7248\u5219\u7B80\u79F0\u4E3ACLR\uFF09\u3002"@zh . "1087027115"^^ . . . . . "\u0410\u043B\u0433\u043E\u0440\u0438\u0301\u0442\u043C\u044B: \u043F\u043E\u0441\u0442\u0440\u043E\u0435\u0301\u043D\u0438\u0435 \u0438 \u0430\u043D\u0430\u0301\u043B\u0438\u0437 (\u0430\u043D\u0433\u043B. Introduction to Algorithms, CLRS) \u2014 \u043A\u043D\u0438\u0433\u0430 \u043F\u043E \u0430\u043B\u0433\u043E\u0440\u0438\u0442\u043C\u0430\u043C \u0438 \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0430\u043C \u0434\u0430\u043D\u043D\u044B\u0445, \u043D\u0430\u043F\u0438\u0441\u0430\u043D\u043D\u0430\u044F \u0422\u043E\u043C\u0430\u0441\u043E\u043C \u041A\u043E\u0440\u043C\u0435\u043D\u043E\u043C, \u0427\u0430\u0440\u043B\u044C\u0437\u043E\u043C \u041B\u0435\u0439\u0437\u0435\u0440\u0441\u043E\u043D\u043E\u043C, \u0420\u043E\u043D\u0430\u043B\u044C\u0434\u043E\u043C \u0420\u0438\u0432\u0435\u0441\u0442\u043E\u043C \u0438 \u041A\u043B\u0438\u0444\u0444\u043E\u0440\u0434\u043E\u043C \u0428\u0442\u0430\u0439\u043D\u043E\u043C. \u041A\u043D\u0438\u0433\u0430 \u0438\u0441\u043F\u043E\u043B\u044C\u0437\u0443\u0435\u0442\u0441\u044F \u0432\u043E \u043C\u043D\u043E\u0433\u0438\u0445 \u0443\u0447\u0435\u0431\u043D\u044B\u0445 \u0437\u0430\u0432\u0435\u0434\u0435\u043D\u0438\u044F\u0445 \u0432 \u043A\u0430\u0447\u0435\u0441\u0442\u0432\u0435 \u043F\u043E\u0441\u043E\u0431\u0438\u044F \u0438 \u0441\u043F\u0440\u0430\u0432\u043E\u0447\u043D\u0438\u043A\u0430, \u043D\u0430 \u043A\u043D\u0438\u0433\u0443 \u0438\u043C\u0435\u0435\u0442\u0441\u044F \u0431\u043E\u043B\u0435\u0435 4000 \u0441\u0441\u044B\u043B\u043E\u043A \u043D\u0430 CiteSeerX."@ru . . "1312"^^ . "\u0412\u0441\u0442\u0443\u043F \u0434\u043E \u0430\u043B\u0433\u043E\u0440\u0438\u0442\u043C\u0456\u0432 (\u0430\u043D\u0433\u043B. Introduction to Algorithms) \u2014 \u043A\u043D\u0438\u0436\u043A\u0430, \u044F\u043A\u0443 \u043D\u0430\u043F\u0438\u0441\u0430\u043B\u0438 \u0422\u043E\u043C\u0430\u0441 \u041A\u043E\u0440\u043C\u0435\u043D, \u0427\u0430\u0440\u043B\u044C\u0437 \u041B\u0435\u0439\u0437\u0435\u0440\u0441\u043E\u043D, \u0420\u043E\u043D\u0430\u043B\u044C\u0434 \u0420\u0456\u0432\u0435\u0441\u0442 \u0456 \u041A\u043B\u0456\u0444\u043E\u0440\u0434 \u0421\u0442\u0430\u0439\u043D. \u0407\u0457 \u0432\u0438\u043A\u043E\u0440\u0438\u0441\u0442\u043E\u0432\u0443\u044E\u0442\u044C \u044F\u043A \u043F\u0456\u0434\u0440\u0443\u0447\u043D\u0438\u043A \u0434\u043B\u044F \u043A\u0443\u0440\u0441\u0456\u0432 \u0437 \u0442\u0435\u043E\u0440\u0456\u0457 \u0430\u043B\u0433\u043E\u0440\u0438\u0442\u043C\u0456\u0432 \u0443 \u0431\u0430\u0433\u0430\u0442\u044C\u043E\u0445 \u0443\u043D\u0456\u0432\u0435\u0440\u0441\u0438\u0442\u0435\u0442\u0430\u0445 \u0456 \u0447\u0430\u0441\u0442\u043E \u0446\u0438\u0442\u0443\u044E\u0442\u044C \u0432 \u0434\u043E\u043A\u0443\u043C\u0435\u043D\u0442\u0430\u0445 \u0443 \u0446\u0456\u0439 \u0433\u0430\u043B\u0443\u0437\u0456; \u043D\u0430\u0440\u0430\u0437\u0456 \u043D\u0430 CiteSeerX \u0437\u0430\u0434\u043E\u043A\u0443\u043C\u0435\u043D\u0442\u043E\u0432\u0430\u043D\u043E \u0431\u0456\u043B\u044C\u0448 \u043D\u0456\u0436 6600 \u0446\u0438\u0442\u0443\u0432\u0430\u043D\u044C. \u041F\u0440\u043E\u0434\u0430\u0436\u0456 \u043A\u043D\u0438\u0436\u043A\u0438 \u0432\u043F\u0440\u043E\u0434\u043E\u0432\u0436 \u043F\u0435\u0440\u0448\u0438\u0445 20 \u0440\u043E\u043A\u0456\u0432 \u0441\u044F\u0433\u043D\u0443\u043B\u0438 \u043F\u0456\u0432\u043C\u0456\u043B\u044C\u0439\u043E\u043D\u0430 \u043F\u0440\u0438\u043C\u0456\u0440\u043D\u0438\u043A\u0456\u0432. \u0407\u0457 \u0441\u043B\u0430\u0432\u0430 \u043F\u0440\u0438\u0432\u0435\u043B\u0430 \u0434\u043E \u043F\u043E\u044F\u0432\u0438 \u043F\u043E\u0437\u043D\u0430\u0447\u0435\u043D\u043D\u044F \u00ABCLRS\u00BB (Cormen, Leiserson, Rivest, Stein)."@uk . . . . . . . "978"^^ . . . . . . . . . . . . "Introduction \u00E0 l'algorithmique, ou Introduction to algorithms en version originale, est un livre d'algorithmique \u00E9crit par Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, et Clifford Stein. Le livre est parfois appel\u00E9 CLRS, d'apr\u00E8s les initiales des noms des auteurs (CLR pour la premi\u00E8re \u00E9dition). Dans la pr\u00E9face, le livre se d\u00E9finit comme une ressource exhaustive \u00E0 la fois pour l'enseignement et l'usage professionnel. Chaque chapitre se concentre sur un algorithme ou une structure de donn\u00E9es, du concept th\u00E9orique jusqu'aux applications pratiques. Plut\u00F4t que d'utiliser un langage de programmation sp\u00E9cifique, les algorithmes sont d\u00E9crits en pseudo-code."@fr . "MIT Press" . . . . "\u300AIntroduction to Algorithms\u300B\uB294 \uC54C\uACE0\uB9AC\uC998 \uC785\uBB38\uC11C\uC774\uB2E4. \uB2E4\uD2B8\uBA38\uC2A4 \uB300\uD559\uAD50 \uAD50\uC218 \uD1A0\uBA38\uC2A4 H. \uCF54\uB974\uBA3C, \uB9E4\uC0AC\uCD94\uC138\uCE20 \uACF5\uACFC\uB300\uD559\uAD50 \uAD50\uC218 \uCC30\uC2A4 E. \uB808\uC774\uC11C\uC2A8\uACFC \uB85C\uB110\uB4DC \"\uB860\" L. \uB77C\uC774\uBCA0\uC2A4\uD2B8, \uCEEC\uB7FC\uBE44\uC544 \uB300\uD559\uAD50 \uAD50\uC218 \uD074\uB9AC\uD3EC\uB4DC \uC2A4\uD0C0\uC778 \uB124 \uBA85\uC774 \uAC19\uC774 \uC9C0\uC740 \uCC45\uC73C\uB85C, \uC800\uC790\uB4E4 \uC774\uB984\uC758 \uBA38\uB9BF\uAE00\uC790\uB97C \uB530\uC11C CLRS\uB77C\uACE0 \uBD80\uB974\uAE30\uB3C4 \uD55C\uB2E4. \uC774 \uCC45 1\uD310\uC740 \uC2A4\uD0C0\uC778\uC774 \uCC38\uC5EC\uD558\uC9C0 \uC54A\uC558\uAE30 \uB54C\uBB38\uC5D0 \uB098\uBA38\uC9C0 \uC138 \uC0AC\uB78C\uC758 \uBA38\uB9BF\uAE00\uC790\uB97C \uB530\uC11C CLR\uC774\uB77C\uACE0 \uBD88\uB838\uB2E4. \uD45C\uC9C0\uC758 \uBAA8\uBE4C\uC740 \uC5D0\uC11C \uC18C\uC7A5\uD558\uACE0 \uC788\uB294 \uC54C\uB809\uC0B0\uB354 \uCE7C\uB354\uC758 \uBE45 \uB808\uB4DC(Big red)\uC774\uB2E4. \uC608\uC81C\uB294 \uC11C\uC801\uC5D0 \uB3D9\uBD09\uB418\uC5B4 \uC788\uB294 CD-ROM\uC5D0 \uC790\uBC14\uB85C \uCF54\uB529\uB41C \uC18C\uC2A4\uD30C\uC77C\uC774 \uC900\uBE44\uB418\uC5B4 \uC788\uB2E4. \uB300\uD55C\uBBFC\uAD6D\uC5D0\uB294 \uC11C\uC6B8\uB300\uD559\uAD50\uC758 \uBB38\uBCD1\uB85C, \uC2EC\uADDC\uC11D, \uCDA9\uBD81\uB300\uD559\uAD50\uC758 \uC774\uCDA9\uC138 \uAD50\uC218\uAC00 \uBC88\uC5ED\uD558\uC5EC \uAC19\uC740 \uC81C\uBAA9\uC73C\uB85C \uCD9C\uAC04\uD558\uC600\uB2E4. CLRS\uB294 \uB0B4\uC6A9\uC774 \uCDA9\uC2E4\uD558\uAE30 \uB54C\uBB38\uC5D0 \uB9CE\uC740 \uB300\uD559\uC758 \uC804\uC0B0\uD559 \uAD00\uB828 \uD559\uACFC\uC5D0\uC11C \uC54C\uACE0\uB9AC\uC998 \uAC15\uC758 \uAD50\uC7AC\uB85C \uC0AC\uC6A9\uD55C\uB2E4. \uB610\uD55C \uC218\uB9CE\uC740 \uB17C\uBB38\uC5D0\uC11C \uC778\uC6A9\uD558\uAE30 \uB54C\uBB38\uC5D0, \uCC38\uACE0 \uBB38\uD5CC \uBAA9\uB85D\uC5D0\uC11C \uC27D\uAC8C \uBCFC \uC218 \uC788\uB294 \uCC45\uC774\uAE30\uB3C4 \uD558\uB2E4. 2006\uB144 9\uC6D4 \uC870\uC0AC\uC5D0 \uB530\uB974\uBA74 CiteSeer\uC5D0\uC11C \uC774 \uCC45\uC774 \uC804\uC0B0\uD559 \uB17C\uBB38 \uC778\uC6A9 \uD69F\uC218 2\uC704\uB97C \uAE30\uB85D\uD588\uB2E4. 2009\uB144 9\uC6D4\uC5D0 3\uD310\uC774 \uCD9C\uAC04\uB418\uC5C8\uB2E4."@ko . . . . . . . . . . . . . . . . "Introduction to Algorithms"@en . . . . . "30"^^ . . . "Introduction \u00E0 l'algorithmique, ou Introduction to algorithms en version originale, est un livre d'algorithmique \u00E9crit par Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, et Clifford Stein. Le livre est parfois appel\u00E9 CLRS, d'apr\u00E8s les initiales des noms des auteurs (CLR pour la premi\u00E8re \u00E9dition)."@fr . . . . "Introducci\u00F3n a los algoritmos (Introduction to Algorithms en versi\u00F3n original) es un libro de Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest y Clifford Stein. Tiene tres ediciones en ingl\u00E9s, la primera 1990, sin Clifford Stein, una segunda en 2001, y una tercera en 2009. Se usa como libro de texto para ense\u00F1ar algoritmos en algunas universidades. Cormen ense\u00F1a en el Dartmouth College, Rivest y Leiserson dan clases en el MIT, y Clifford Stein ense\u00F1a en la Universidad de Columbia."@es . "3499226"^^ . . . . . "\u0410\u043B\u0433\u043E\u0440\u0438\u0442\u043C\u044B: \u043F\u043E\u0441\u0442\u0440\u043E\u0435\u043D\u0438\u0435 \u0438 \u0430\u043D\u0430\u043B\u0438\u0437"@ru . "Introduzione agli algoritmi e strutture dati (Introduction to Algorithms) \u00E8 un libro di Thomas H. Cormen, , Ronald L. Rivest e .Edito da McGraw-Hill.\u00C8 usato come libro di testo nei corsi di algoritmi in molte universit\u00E0. La prima edizione del libro di testo non includeva come autore Stein, e cos\u00EC il libro divenne conosciuto con l'acronimo CLR.Dopo l'aggiunta del quarto autore nella seconda edizione, molti si riferiscono al libro con CLRS.Il libro \u00E8 accompagnato anche da un Cd-Rom con esempi in Java."@it . . . . . "\u0412\u0441\u0442\u0443\u043F \u0434\u043E \u0430\u043B\u0433\u043E\u0440\u0438\u0442\u043C\u0456\u0432 (\u0430\u043D\u0433\u043B. Introduction to Algorithms) \u2014 \u043A\u043D\u0438\u0436\u043A\u0430, \u044F\u043A\u0443 \u043D\u0430\u043F\u0438\u0441\u0430\u043B\u0438 \u0422\u043E\u043C\u0430\u0441 \u041A\u043E\u0440\u043C\u0435\u043D, \u0427\u0430\u0440\u043B\u044C\u0437 \u041B\u0435\u0439\u0437\u0435\u0440\u0441\u043E\u043D, \u0420\u043E\u043D\u0430\u043B\u044C\u0434 \u0420\u0456\u0432\u0435\u0441\u0442 \u0456 \u041A\u043B\u0456\u0444\u043E\u0440\u0434 \u0421\u0442\u0430\u0439\u043D. \u0407\u0457 \u0432\u0438\u043A\u043E\u0440\u0438\u0441\u0442\u043E\u0432\u0443\u044E\u0442\u044C \u044F\u043A \u043F\u0456\u0434\u0440\u0443\u0447\u043D\u0438\u043A \u0434\u043B\u044F \u043A\u0443\u0440\u0441\u0456\u0432 \u0437 \u0442\u0435\u043E\u0440\u0456\u0457 \u0430\u043B\u0433\u043E\u0440\u0438\u0442\u043C\u0456\u0432 \u0443 \u0431\u0430\u0433\u0430\u0442\u044C\u043E\u0445 \u0443\u043D\u0456\u0432\u0435\u0440\u0441\u0438\u0442\u0435\u0442\u0430\u0445 \u0456 \u0447\u0430\u0441\u0442\u043E \u0446\u0438\u0442\u0443\u044E\u0442\u044C \u0432 \u0434\u043E\u043A\u0443\u043C\u0435\u043D\u0442\u0430\u0445 \u0443 \u0446\u0456\u0439 \u0433\u0430\u043B\u0443\u0437\u0456; \u043D\u0430\u0440\u0430\u0437\u0456 \u043D\u0430 CiteSeerX \u0437\u0430\u0434\u043E\u043A\u0443\u043C\u0435\u043D\u0442\u043E\u0432\u0430\u043D\u043E \u0431\u0456\u043B\u044C\u0448 \u043D\u0456\u0436 6600 \u0446\u0438\u0442\u0443\u0432\u0430\u043D\u044C. \u041F\u0440\u043E\u0434\u0430\u0436\u0456 \u043A\u043D\u0438\u0436\u043A\u0438 \u0432\u043F\u0440\u043E\u0434\u043E\u0432\u0436 \u043F\u0435\u0440\u0448\u0438\u0445 20 \u0440\u043E\u043A\u0456\u0432 \u0441\u044F\u0433\u043D\u0443\u043B\u0438 \u043F\u0456\u0432\u043C\u0456\u043B\u044C\u0439\u043E\u043D\u0430 \u043F\u0440\u0438\u043C\u0456\u0440\u043D\u0438\u043A\u0456\u0432. \u0407\u0457 \u0441\u043B\u0430\u0432\u0430 \u043F\u0440\u0438\u0432\u0435\u043B\u0430 \u0434\u043E \u043F\u043E\u044F\u0432\u0438 \u043F\u043E\u0437\u043D\u0430\u0447\u0435\u043D\u043D\u044F \u00ABCLRS\u00BB (Cormen, Leiserson, Rivest, Stein)."@uk . . . "Cover of the fourth edition"@en . . . . . "\u300A\u7B97\u6CD5\u5BFC\u8BBA\u300B\uFF08\u82F1\u8A9E\uFF1AIntroduction to Algorithms\uFF09\u662F\u57FA\u7840\u7B97\u6CD5\u65B9\u9762\u6700\u6743\u5A01\u3001\u6700\u8BE6\u7EC6\u7684\u8457\u4F5C\u4E4B\u4E00\uFF0C\u5728\u5F88\u591A\u56FD\u9645\u8457\u540D\u5927\u5B66\u88AB\u7528\u4E8E\u7B97\u6CD5\u8BFE\u7684\u6559\u6750\u3002\u8BF8\u591A\u7B97\u6CD5\u65B9\u9762\u7684\u8BBA\u6587\u5C06\u5176\u5217\u5165\u53C2\u8003\u6587\u732E\u5F53\u4E2D\u3002 \u8BE5\u4E66\u8BE6\u7EC6\u7684\u4ECB\u7ECD\u4E86\u8BF8\u591A\u5E38\u89C1\u7684\u7B97\u6CD5\u53CA\u6570\u636E\u7ED3\u6784\uFF0C\u5E76\u7528\u4E25\u8C28\u7684\u8BC1\u660E\u6765\u8BBA\u8BC1\u5176\u6B63\u786E\u6027\u3002\u6BCF\u4E2A\u7AE0\u8282\u5747\u6709\u4F8B\u9898\uFF0C\u9002\u5408\u5B66\u4E60\u8005\u6DF1\u5165\u7406\u89E3\u3002\u7B2C\u4E00\u7248\u520A\u884C\u4E8E1990\u5E74\uFF0C2009\u5E74\u6700\u65B0\u7248\u4E3A\u7B2C\u4E09\u7248\u3002\u5728\u8BB8\u591A\u56FD\u5BB6\u5E38\u5E38\u4EE5\u4F5C\u8005\u59D3\u540D\u9996\u4E2A\u82F1\u6587\u5B57\u6BCD\u88AB\u79F0\u4E3ACLRS\uFF08\u7B2C\u4E00\u7248\u5219\u7B80\u79F0\u4E3ACLR\uFF09\u3002"@zh . "\u300AIntroduction to Algorithms\u300B\uB294 \uC54C\uACE0\uB9AC\uC998 \uC785\uBB38\uC11C\uC774\uB2E4. \uB2E4\uD2B8\uBA38\uC2A4 \uB300\uD559\uAD50 \uAD50\uC218 \uD1A0\uBA38\uC2A4 H. \uCF54\uB974\uBA3C, \uB9E4\uC0AC\uCD94\uC138\uCE20 \uACF5\uACFC\uB300\uD559\uAD50 \uAD50\uC218 \uCC30\uC2A4 E. \uB808\uC774\uC11C\uC2A8\uACFC \uB85C\uB110\uB4DC \"\uB860\" L. \uB77C\uC774\uBCA0\uC2A4\uD2B8, \uCEEC\uB7FC\uBE44\uC544 \uB300\uD559\uAD50 \uAD50\uC218 \uD074\uB9AC\uD3EC\uB4DC \uC2A4\uD0C0\uC778 \uB124 \uBA85\uC774 \uAC19\uC774 \uC9C0\uC740 \uCC45\uC73C\uB85C, \uC800\uC790\uB4E4 \uC774\uB984\uC758 \uBA38\uB9BF\uAE00\uC790\uB97C \uB530\uC11C CLRS\uB77C\uACE0 \uBD80\uB974\uAE30\uB3C4 \uD55C\uB2E4. \uC774 \uCC45 1\uD310\uC740 \uC2A4\uD0C0\uC778\uC774 \uCC38\uC5EC\uD558\uC9C0 \uC54A\uC558\uAE30 \uB54C\uBB38\uC5D0 \uB098\uBA38\uC9C0 \uC138 \uC0AC\uB78C\uC758 \uBA38\uB9BF\uAE00\uC790\uB97C \uB530\uC11C CLR\uC774\uB77C\uACE0 \uBD88\uB838\uB2E4. \uD45C\uC9C0\uC758 \uBAA8\uBE4C\uC740 \uC5D0\uC11C \uC18C\uC7A5\uD558\uACE0 \uC788\uB294 \uC54C\uB809\uC0B0\uB354 \uCE7C\uB354\uC758 \uBE45 \uB808\uB4DC(Big red)\uC774\uB2E4. \uC608\uC81C\uB294 \uC11C\uC801\uC5D0 \uB3D9\uBD09\uB418\uC5B4 \uC788\uB294 CD-ROM\uC5D0 \uC790\uBC14\uB85C \uCF54\uB529\uB41C \uC18C\uC2A4\uD30C\uC77C\uC774 \uC900\uBE44\uB418\uC5B4 \uC788\uB2E4. \uB300\uD55C\uBBFC\uAD6D\uC5D0\uB294 \uC11C\uC6B8\uB300\uD559\uAD50\uC758 \uBB38\uBCD1\uB85C, \uC2EC\uADDC\uC11D, \uCDA9\uBD81\uB300\uD559\uAD50\uC758 \uC774\uCDA9\uC138 \uAD50\uC218\uAC00 \uBC88\uC5ED\uD558\uC5EC \uAC19\uC740 \uC81C\uBAA9\uC73C\uB85C \uCD9C\uAC04\uD558\uC600\uB2E4. CLRS\uB294 \uB0B4\uC6A9\uC774 \uCDA9\uC2E4\uD558\uAE30 \uB54C\uBB38\uC5D0 \uB9CE\uC740 \uB300\uD559\uC758 \uC804\uC0B0\uD559 \uAD00\uB828 \uD559\uACFC\uC5D0\uC11C \uC54C\uACE0\uB9AC\uC998 \uAC15\uC758 \uAD50\uC7AC\uB85C \uC0AC\uC6A9\uD55C\uB2E4. \uB610\uD55C \uC218\uB9CE\uC740 \uB17C\uBB38\uC5D0\uC11C \uC778\uC6A9\uD558\uAE30 \uB54C\uBB38\uC5D0, \uCC38\uACE0 \uBB38\uD5CC \uBAA9\uB85D\uC5D0\uC11C \uC27D\uAC8C \uBCFC \uC218 \uC788\uB294 \uCC45\uC774\uAE30\uB3C4 \uD558\uB2E4. 2006\uB144 9\uC6D4 \uC870\uC0AC\uC5D0 \uB530\uB974\uBA74 CiteSeer\uC5D0\uC11C \uC774 \uCC45\uC774 \uC804\uC0B0\uD559 \uB17C\uBB38 \uC778\uC6A9 \uD69F\uC218 2\uC704\uB97C \uAE30\uB85D\uD588\uB2E4. 2009\uB144 9\uC6D4\uC5D0 3\uD310\uC774 \uCD9C\uAC04\uB418\uC5C8\uB2E4."@ko . . "7510"^^ . "1312"^^ . . "Introduzione agli algoritmi e strutture dati (Introduction to Algorithms) \u00E8 un libro di Thomas H. Cormen, , Ronald L. Rivest e .Edito da McGraw-Hill.\u00C8 usato come libro di testo nei corsi di algoritmi in molte universit\u00E0. La prima edizione del libro di testo non includeva come autore Stein, e cos\u00EC il libro divenne conosciuto con l'acronimo CLR.Dopo l'aggiunta del quarto autore nella seconda edizione, molti si riferiscono al libro con CLRS.Il libro \u00E8 accompagnato anche da un Cd-Rom con esempi in Java."@it . . . . . . .