دانلود کتاب های انتشارات MIT Press دانلود کتاب های انتشارات MIT Press

Introduction-to-Algorithm بازگشت

Introduction to Algorithm

Thomas Cormen , Charles Leiserson , Ronald Rivest , Clifford Stein ,
{"id":108,"title":"انتشارات MIT Press","manager":"-","shaba":"0","bank_name":"-","description":"-","ebook_profit":0,"rent_3_profit":0,"rent_6_profit":0,"rent_12_profit":0,"print_profit":0,"logo":null,"token":"2e124ed14dd8dd35","slug":"MIT-Press","rent_1_week_profit":0,"account":{"title":"MIT Press","email":"mitpress@gmail.com","role":"publisher","confirmed":1,"phone":null,"token":"d3e12a936095505a","oauth_provider":null,"address":null,"postal_code":null,"invite_code":"44xpwm","inviter_id":null,"change_password_at":"2017-10-07 11:22:37","created_at":"2017-12-09 15:46:11","updated_at":"2017-12-09 15:46:11","bazaar_credit":0,"description":"mitpress@gmail.com"},"city":{"title":"تهران","token":"9eb81c33a7bdf0bd"}}
{"query":"PUB::*::PID::108::*::T","current_page":1,"items":1,"data":[{"title":"Introduction to Algorithm","price":33,"ebook_price":"۳۳","rent_3_price":"۲۶","rent_6_price":"۱۱","rent_12_price":"-۱","print_price":"-۱","front_cover":{"thumbnail":"/storage/files/styles/thumbnail/books/13b8a393f9f3fea3/front.jpg","medium":"/storage/files/styles/medium/books/13b8a393f9f3fea3/front.jpg","medium_rounded":"/storage/files/styles/medium_rounded/books/13b8a393f9f3fea3/front.png","large":"/storage/files/styles/large/books/13b8a393f9f3fea3/front.jpg","medium_trans":"/storage/files/styles/medium_trans/books/13b8a393f9f3fea3/front.png","medium_zoom_fit":"/storage/files/styles/medium_zoom_fit/books/13b8a393f9f3fea3/front.png"},"back_cover":{"thumbnail":"/storage/files/styles/thumbnail/books/13b8a393f9f3fea3/back.jpg","medium":"/storage/files/styles/medium/books/13b8a393f9f3fea3/back.jpg","medium_rounded":"/storage/files/styles/medium_rounded/books/13b8a393f9f3fea3/back.png","large":"/storage/files/styles/large/books/13b8a393f9f3fea3/back.jpg","medium_trans":"/storage/files/styles/medium_trans/books/13b8a393f9f3fea3/back.png","medium_zoom_fit":"/storage/files/styles/medium_zoom_fit/books/13b8a393f9f3fea3/back.png"},"print_book":false,"isbn":"9780262033848","lang":"null","cover_type":"null","dimension":"null","year":2009,"nobat_chap":1,"description":"Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.\r\n\r\nThe first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called \"Divide-and-Conquer\"), and an appendix on matrices. It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many new exercises and problems have been added for this edition. As of the third edition, this textbook is published exclusively by the MIT Press.","pages_count":1312,"token":"13b8a393f9f3fea3","deleted_at":null,"published_at":"2017-12-12 14:48:54","available_for_web":true,"publisher_title":"MIT Press","edition":null,"currency":"EUR","subtitle":"null","country":"null","rent_1_week_price":"-۱","writer_authors":[{"id":1072,"title":"Thomas Cormen","firstname":"Thomas","lastname":"Cormen","token":"3fd2c677b0ef3f74"},{"id":1074,"title":"Charles Leiserson","firstname":"Charles","lastname":"Leiserson","token":"2a707ff7c20bf204"},{"id":1076,"title":"Ronald Rivest","firstname":"Ronald","lastname":"Rivest","token":"d9e398b8b526bc82"},{"id":1077,"title":"Clifford Stein","firstname":"Clifford","lastname":"Stein","token":"037bb93e40fe198d"}],"translator_authors":[],"available_e_book":true,"dir":true,"vitrines":[{"title":"کتاب‌های مشابه","url":"/api/bookstore/vitrines/similar-books/13b8a393f9f3fea3","type":"books","books":[]},{"title":"کتاب‌های دیگر ناشر","url":"/api/bookstore/vitrines/publisher-books/13b8a393f9f3fea3","type":"books","books":[]}],"authors":[{"id":1072,"title":"Thomas Cormen","firstname":"Thomas","lastname":"Cormen","token":"3fd2c677b0ef3f74"},{"id":1074,"title":"Charles Leiserson","firstname":"Charles","lastname":"Leiserson","token":"2a707ff7c20bf204"},{"id":1076,"title":"Ronald Rivest","firstname":"Ronald","lastname":"Rivest","token":"d9e398b8b526bc82"},{"id":1077,"title":"Clifford Stein","firstname":"Clifford","lastname":"Stein","token":"037bb93e40fe198d"}],"e_book":{"toc":[{"page":4,"title":"Contents"},{"page":12,"title":"Preface"},{"page":21,"title":"I Foundations","children":[{"page":24,"title":"1 The Role of Algorithms in Computing"},{"page":35,"title":"2 Getting Started"},{"page":62,"title":"3 Growth of Functions"},{"page":84,"title":"4 Divide-and-Conquer"},{"page":133,"title":"5 Probabilistic Analysis and Randomized Algorithms"}]},{"page":165,"title":"II Sorting and Order Statistics","children":[{"page":170,"title":"6 Heapsort"},{"page":189,"title":"7 Quicksort"},{"page":210,"title":"8 Sorting in Linear Time"},{"page":232,"title":"9 Medians and Order Statistics"}]},{"page":247,"title":"III Data Structures","children":[{"page":251,"title":"10 Elementary Data Structures"},{"page":272,"title":"11 Hash Tables"},{"page":305,"title":"12 Binary Search Trees"},{"page":327,"title":"13 Red-Black Trees"},{"page":358,"title":"14 Augmenting Data Structures"}]},{"page":375,"title":"IV Advanced Design and Analysis Techniques","children":[{"page":378,"title":"15 Dynamic Programming"},{"page":433,"title":"16 Greedy Algorithms"},{"page":470,"title":"17 Amortized Analysis"}]},{"page":499,"title":"V Advanced Data Structures","children":[{"page":503,"title":"18 B-Trees"},{"page":524,"title":"19 Fibonacci Heaps"},{"page":550,"title":"20 van Emde Boas Trees"},{"page":580,"title":"21 Data Structures for Disjoint Sets"}]},{"page":605,"title":"VI Graph Algorithms","children":[{"page":608,"title":"22 Elementary Graph Algorithms"},{"page":643,"title":"23 Minimum Spanning Trees"},{"page":662,"title":"24 Single-Source Shortest Paths"},{"page":703,"title":"25 All-Pairs Shortest Paths"},{"page":727,"title":"26 Maximum Flow"}]},{"page":787,"title":"VII Selected Topics","children":[{"page":791,"title":"27 Multithreaded Algorithms"},{"page":832,"title":"28 Matrix Operations"},{"page":862,"title":"29 Linear Programming"},{"page":917,"title":"30 Polynomials and the FFT"},{"page":945,"title":"31 Number-Theoretic Algorithms"},{"page":1004,"title":"32 String Matching"},{"page":1033,"title":"33 Computational Geometry"},{"page":1067,"title":"34 NP-Completeness"},{"page":1125,"title":"35 Approximation Algorithms"}]},{"page":1161,"title":"VIII Appendix: Mathematical Background","children":[{"page":1164,"title":"A Summations"},{"page":1177,"title":"B Sets, Etc."},{"page":1202,"title":"C Counting and Probability"},{"page":1236,"title":"D Matrices"}]},{"page":1250,"title":"Bibliography"},{"page":1270,"title":"Index"}],"pages_count":1312,"version":"6.15.2","dir":"ltr","state":"converting","token":"13b8a393f9f3fea3","status":"SUCCEED","pages_count_fa":"۱۳۱۲"},"publisher":{"id":108,"title":"MIT Press","manager":"-","shaba":"0","bank_name":"-","description":"-","ebook_profit":0,"rent_3_profit":0,"rent_6_profit":0,"rent_12_profit":0,"print_profit":0,"logo":null,"token":"2e124ed14dd8dd35","slug":"MIT-Press","rent_1_week_profit":0,"account":{"title":"MIT Press","email":"mitpress@gmail.com","role":"publisher","confirmed":1,"phone":null,"token":"d3e12a936095505a","oauth_provider":null,"address":null,"postal_code":null,"invite_code":"44xpwm","inviter_id":null,"change_password_at":"2017-10-07 11:22:37","created_at":"2017-12-09 15:46:11","updated_at":"2017-12-09 15:46:11","bazaar_credit":0,"description":"mitpress@gmail.com"},"city":{"title":"تهران","token":"9eb81c33a7bdf0bd"}},"tags":[{"title":"clrs","token":"122d4d84d84ad8f7","pivot":{"taggable_id":582,"tag_id":2747}}],"study_subjects":[{"id":23137,"title":"ساختمان داده‌ها","token":"df4cc573970b4ded","type":"","books_count":1,"created_at":"2017-10-07 11:36:27","updated_at":"2017-12-12 14:48:54","description":"فنی و مهندسی - کارشناسی || ارتباطات و فناوری اطلاعات - ","study_fields":[{"id":655,"title":"ارتباطات و فناوری اطلاعات","token":"e6203aca5979b20d","books_count":5,"created_at":"2017-10-07 11:22:52","updated_at":"2022-04-06 10:23:24","study_groups":[{"id":10,"title":"فنی و مهندسی","token":"cd075d6bdb3fbd29","style":{"first_color":"#F47820","second_color":"#F47820","icon":"images/categories/mohandesi.png"},"books_count":394,"created_at":"2017-10-07 11:22:44","updated_at":"2022-06-22 20:09:42"}]}]},{"id":23140,"title":"ساختمان داده‌ها و الگوریتم‌ها","token":"c7947edb4769ecdc","type":"","books_count":2,"created_at":"2017-10-07 11:36:27","updated_at":"2019-01-21 11:23:47","description":"فنی و مهندسی - کارشناسی || علوم کامپیوتر - ","study_fields":[{"id":1168,"title":"علوم کامپیوتر","token":"4822f290d609f762","books_count":19,"created_at":"2017-10-07 11:22:55","updated_at":"2022-06-22 20:09:42","study_groups":[{"id":10,"title":"فنی و مهندسی","token":"cd075d6bdb3fbd29","style":{"first_color":"#F47820","second_color":"#F47820","icon":"images/categories/mohandesi.png"},"books_count":394,"created_at":"2017-10-07 11:22:44","updated_at":"2022-06-22 20:09:42"}]}]},{"id":23143,"title":"ساختمان داده‌ها و برنامه نویسی کامپیوتر","token":"99d6b4894ded281f","type":"","books_count":2,"created_at":"2017-10-07 11:36:27","updated_at":"2020-09-26 17:13:53","description":"علوم تجربی - کارشناسی || فناوری اطلاعات سلامت - ","study_fields":[{"id":994,"title":"فناوری اطلاعات سلامت","token":"58949f094701c717","books_count":16,"created_at":"2017-10-07 11:22:54","updated_at":"2020-09-26 17:13:53","study_groups":[{"id":7,"title":"علوم تجربی","token":"c037eef8703f5ba1","style":{"first_color":"#2BD1B9","second_color":"#2BD1B9","icon":"images/categories/pezeshki.png"},"books_count":695,"created_at":"2017-10-07 11:22:44","updated_at":"2022-06-22 20:09:42"}]}]},{"id":26035,"title":"طراحی الگوریتم ها","token":"05ba630232278efd","type":"","books_count":3,"created_at":"2017-10-07 11:39:18","updated_at":"2017-12-12 14:48:54","description":"فنی و مهندسی - کارشناسی || مهندسی کامپیوتر - ","study_fields":[{"id":898,"title":"مهندسی کامپیوتر","token":"57bea94f4a51f6b8","books_count":25,"created_at":"2017-10-07 11:22:53","updated_at":"2022-06-22 20:09:42","study_groups":[{"id":10,"title":"فنی و مهندسی","token":"cd075d6bdb3fbd29","style":{"first_color":"#F47820","second_color":"#F47820","icon":"images/categories/mohandesi.png"},"books_count":394,"created_at":"2017-10-07 11:22:44","updated_at":"2022-06-22 20:09:42"}]}]}],"study_fields":[{"id":655,"title":"ارتباطات و فناوری اطلاعات","token":"e6203aca5979b20d","books_count":5,"created_at":"2017-10-07 11:22:52","updated_at":"2022-04-06 10:23:24","study_groups":[{"id":10,"title":"فنی و مهندسی","token":"cd075d6bdb3fbd29","style":{"first_color":"#F47820","second_color":"#F47820","icon":"images/categories/mohandesi.png"},"books_count":394,"created_at":"2017-10-07 11:22:44","updated_at":"2022-06-22 20:09:42"}]},{"id":1168,"title":"علوم کامپیوتر","token":"4822f290d609f762","books_count":19,"created_at":"2017-10-07 11:22:55","updated_at":"2022-06-22 20:09:42","study_groups":[{"id":10,"title":"فنی و مهندسی","token":"cd075d6bdb3fbd29","style":{"first_color":"#F47820","second_color":"#F47820","icon":"images/categories/mohandesi.png"},"books_count":394,"created_at":"2017-10-07 11:22:44","updated_at":"2022-06-22 20:09:42"}]},{"id":994,"title":"فناوری اطلاعات سلامت","token":"58949f094701c717","books_count":16,"created_at":"2017-10-07 11:22:54","updated_at":"2020-09-26 17:13:53","study_groups":[{"id":7,"title":"علوم تجربی","token":"c037eef8703f5ba1","style":{"first_color":"#2BD1B9","second_color":"#2BD1B9","icon":"images/categories/pezeshki.png"},"books_count":695,"created_at":"2017-10-07 11:22:44","updated_at":"2022-06-22 20:09:42"}]},{"id":898,"title":"مهندسی کامپیوتر","token":"57bea94f4a51f6b8","books_count":25,"created_at":"2017-10-07 11:22:53","updated_at":"2022-06-22 20:09:42","study_groups":[{"id":10,"title":"فنی و مهندسی","token":"cd075d6bdb3fbd29","style":{"first_color":"#F47820","second_color":"#F47820","icon":"images/categories/mohandesi.png"},"books_count":394,"created_at":"2017-10-07 11:22:44","updated_at":"2022-06-22 20:09:42"}]}],"study_groups":[{"id":10,"title":"فنی و مهندسی","token":"cd075d6bdb3fbd29","style":{"first_color":"#F47820","second_color":"#F47820","icon":"images/categories/mohandesi.png"},"books_count":394,"created_at":"2017-10-07 11:22:44","updated_at":"2022-06-22 20:09:42"},{"id":7,"title":"علوم تجربی","token":"c037eef8703f5ba1","style":{"first_color":"#2BD1B9","second_color":"#2BD1B9","icon":"images/categories/pezeshki.png"},"books_count":695,"created_at":"2017-10-07 11:22:44","updated_at":"2022-06-22 20:09:42"}],"views":1,"price_fa":"۳۳","titleLink":"Introduction-to-Algorithm","urlify":"Introduction-to-Algorithm","pages_count_fa":"۱۳۱۲","previews":null,"score":0}],"from":1,"path":"/MIT-Press","per_page":15,"to":1,"last_page":1,"total_authors_books":0,"total_books":1,"total_publisher_books":0,"total_isbn_books":0,"total":1,"title":"mit-press","errors":[],"timingAnalysis":{"scan_delay":"81ms","sorting_delay":"0ms","timeToFetch":"84ms","total":"165ms"}}
خرید یا کرایه
cancel
19