東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁 到查詢結果 [ subject:"Algorithms" ]

切換: 標籤 | MARC模式 | ISBD

An introduction to the analysis of a...

Soltys, Michael, (1971-)

FindBook

Google Book

Amazon

博客來

An introduction to the analysis of algorithms

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	An introduction to the analysis of algorithms/ Michael Soltys.
作者:	Soltys, Michael,
出版者:	Singapore ;World Scientific Publishing Co., : c2012.,
面頁冊數:	1 online resource.
內容註:	1. Preliminaries. 1.1. Induction. 1.2. Invariance. 1.3. Correctness of algorithms. 1.4. Stable marriage. 1.5. Answers to selected problems. 1.6. Notes -- 2. Greedy algorithms. 2.1. Minimum cost spanning trees. 2.2. Jobs with deadlines and profits. 2.3. Further examples and problems. 2.4. Answers to selected problems. 2.5. Notes -- 3. Divide and conquer. 3.1. Mergesort. 3.2. Multiplying numbers in binary. 3.3. Savitch's algorithm. 3.4. Further examples and exercises. 3.5. Answers to selected problems. 3.6. Notes -- 4. Dynamic programming. 4.1. Longest monotone subsequence problem. 4.2. All pairs shortest path problem. 4.3. Simple knapsack problem. 4.4. Activity selection problem. 4.5. Jobs with deadlines, durations and profits. 4.6. Further examples and problems. 4.7. Answers to selected problems. 4.8. Notes -- 5. Online algorithms. 5.1. List accessing problem. 5.2. Paging. 5.3. Answers to selected problems. 5.4. Notes -- 6. Randomized algorithms. 6.1. Perfect matching. 6.2. Pattern matching. 6.3. Primality testing. 6.4. Public key cryptography. 6.5. Further exercises. 6.6. Answers to selected problems. 6.7. Notes.
標題:	Algorithms - Congresses. -
電子資源:	http://www.worldscientific.com/worldscibooks/10.1142/8439#t=toc
ISBN:	9789814401166 (electronic bk.)

An introduction to the analysis of algorithms
Soltys, Michael,1971-

An introduction to the analysis of algorithms[electronic resource] /Michael Soltys. - 2nd ed. - Singapore ;World Scientific Publishing Co.,c2012. - 1 online resource.

Includes bibliographical references and index.

1. Preliminaries. 1.1. Induction. 1.2. Invariance. 1.3. Correctness of algorithms. 1.4. Stable marriage. 1.5. Answers to selected problems. 1.6. Notes -- 2. Greedy algorithms. 2.1. Minimum cost spanning trees. 2.2. Jobs with deadlines and profits. 2.3. Further examples and problems. 2.4. Answers to selected problems. 2.5. Notes -- 3. Divide and conquer. 3.1. Mergesort. 3.2. Multiplying numbers in binary. 3.3. Savitch's algorithm. 3.4. Further examples and exercises. 3.5. Answers to selected problems. 3.6. Notes -- 4. Dynamic programming. 4.1. Longest monotone subsequence problem. 4.2. All pairs shortest path problem. 4.3. Simple knapsack problem. 4.4. Activity selection problem. 4.5. Jobs with deadlines, durations and profits. 4.6. Further examples and problems. 4.7. Answers to selected problems. 4.8. Notes -- 5. Online algorithms. 5.1. List accessing problem. 5.2. Paging. 5.3. Answers to selected problems. 5.4. Notes -- 6. Randomized algorithms. 6.1. Perfect matching. 6.2. Pattern matching. 6.3. Primality testing. 6.4. Public key cryptography. 6.5. Further exercises. 6.6. Answers to selected problems. 6.7. Notes.

A successor to the first edition, this updated and revised book is a great companion guide for students and engineers alike, specifically software engineers who design reliable code. While succinct, this edition is mathematically rigorous, covering the foundations of both computer scientists and mathematicians with interest in algorithms. Besides covering the traditional algorithms of Computer Science such as Greedy, Dynamic Programming and Divide & Conquer, this edition goes further by exploring two classes of algorithms that are often overlooked: Randomised and Online algorithms - with emphasis placed on the algorithm itself. The coverage of both fields are timely as the ubiquity of Randomised algorithms are expressed through the emergence of cryptography while Online algorithms are essential in numerous fields as diverse as operating systems and stock market predictions. While being relatively short to ensure the essentiality of content, a strong focus has been placed on self-containment, introducing the idea of pre/post-conditions and loop invariants to readers of all backgrounds. Containing programming exercises in Python, solutions will also be placed on the book's website.

ISBN: 9789814401166 (electronic bk.)Subjects--Topical Terms:

1245444
Algorithms
--Congresses.

LC Class. No.: QA9.58 / .S63 2012eb

Dewey Class. No.: 518

An introduction to the analysis of algorithms
LDR:03114cmm a2200241Ia 4500 001 1901345
006 m o d
007 cr cnu---unuuu
008 140122s2012 si ob 001 0 eng d
020 $a 9789814401166 (electronic bk.)
020 $a 9814401161 (electronic bk.)
035 $a ocn810317531
040 $a IDEBK $c IDEBK $d YDXCP $d E7B $d OCLCQ $d I9W
049 $a FISA
050 4 $a QA9.58 $b .S63 2012eb
082 0 4 $a 518 $2 22
100 1 $a Soltys, Michael, $d 1971- $3 2016423
245 1 3 $a An introduction to the analysis of algorithms $h [electronic resource] / $c Michael Soltys.
250 $a 2nd ed.
260 $a Singapore ; $a Hackensack, NJ : $b World Scientific Publishing Co., $c c2012.
300 $a 1 online resource.
504 $a Includes bibliographical references and index.
505 0 $a 1. Preliminaries. 1.1. Induction. 1.2. Invariance. 1.3. Correctness of algorithms. 1.4. Stable marriage. 1.5. Answers to selected problems. 1.6. Notes -- 2. Greedy algorithms. 2.1. Minimum cost spanning trees. 2.2. Jobs with deadlines and profits. 2.3. Further examples and problems. 2.4. Answers to selected problems. 2.5. Notes -- 3. Divide and conquer. 3.1. Mergesort. 3.2. Multiplying numbers in binary. 3.3. Savitch's algorithm. 3.4. Further examples and exercises. 3.5. Answers to selected problems. 3.6. Notes -- 4. Dynamic programming. 4.1. Longest monotone subsequence problem. 4.2. All pairs shortest path problem. 4.3. Simple knapsack problem. 4.4. Activity selection problem. 4.5. Jobs with deadlines, durations and profits. 4.6. Further examples and problems. 4.7. Answers to selected problems. 4.8. Notes -- 5. Online algorithms. 5.1. List accessing problem. 5.2. Paging. 5.3. Answers to selected problems. 5.4. Notes -- 6. Randomized algorithms. 6.1. Perfect matching. 6.2. Pattern matching. 6.3. Primality testing. 6.4. Public key cryptography. 6.5. Further exercises. 6.6. Answers to selected problems. 6.7. Notes.
520 $a A successor to the first edition, this updated and revised book is a great companion guide for students and engineers alike, specifically software engineers who design reliable code. While succinct, this edition is mathematically rigorous, covering the foundations of both computer scientists and mathematicians with interest in algorithms. Besides covering the traditional algorithms of Computer Science such as Greedy, Dynamic Programming and Divide & Conquer, this edition goes further by exploring two classes of algorithms that are often overlooked: Randomised and Online algorithms - with emphasis placed on the algorithm itself. The coverage of both fields are timely as the ubiquity of Randomised algorithms are expressed through the emergence of cryptography while Online algorithms are essential in numerous fields as diverse as operating systems and stock market predictions. While being relatively short to ensure the essentiality of content, a strong focus has been placed on self-containment, introducing the idea of pre/post-conditions and loop invariants to readers of all backgrounds. Containing programming exercises in Python, solutions will also be placed on the book's website.
650 0 $a Algorithms $v Congresses. $3 1245444
856 4 0 $u http://www.worldscientific.com/worldscibooks/10.1142/8439#t=toc