Cargando…

An introduction to the analysis of algorithms /

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 mat...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Soltys, Michael, 1971-
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Singapore ; Hackensack, NJ : World Scientific Publishing Co., Ã2012.
Edición:2nd ed.
Temas:
Acceso en línea:Texto completo

MARC

LEADER 00000cam a2200000Ia 4500
001 EBSCO_ocn810317531
003 OCoLC
005 20231017213018.0
006 m o d
007 cr cnu---unuuu
008 120910s2012 si ob 001 0 eng d
040 |a IDEBK  |b eng  |e pn  |c IDEBK  |d N$T  |d YDXCP  |d E7B  |d OCLCQ  |d I9W  |d OCLCF  |d DEBBG  |d B24X7  |d COO  |d DEBSZ  |d OCLCQ  |d LOA  |d JBG  |d COCUF  |d AGLDB  |d CNNOR  |d MOR  |d CCO  |d PIFPO  |d LIV  |d OCLCQ  |d U3W  |d STF  |d WRM  |d OCLCQ  |d VTS  |d NRAMU  |d INT  |d OCLCQ  |d A6Q  |d AU@  |d M8D  |d LEAUB  |d CEF  |d OCLCQ  |d OCL  |d UKCRE  |d EYM  |d OCLCO  |d OCLCQ  |d BRF  |d QGK 
019 |a 889313249  |a 961558618  |a 962691315  |a 965994685  |a 966385613  |a 988409573  |a 992064106  |a 1037764181  |a 1038695194  |a 1045547004  |a 1083554279  |a 1086408736  |a 1100831089  |a 1153455507  |a 1179571897  |a 1259162612 
020 |a 9789814401166  |q (electronic bk.) 
020 |a 9814401161  |q (electronic bk.) 
020 |z 9789814401159  |q (hardback) 
020 |z 9814401153  |q (hardback) 
020 |a 1283593750 
020 |a 9781283593755 
020 |a 9786613906205 
020 |a 6613906204 
029 1 |a AU@  |b 000053310474 
029 1 |a CHNEW  |b 000622361 
029 1 |a DEBBG  |b BV040888024 
029 1 |a DEBBG  |b BV043094664 
029 1 |a DEBSZ  |b 421359455 
029 1 |a NZ1  |b 14696559 
029 1 |a ZWZ  |b 184587425 
035 |a (OCoLC)810317531  |z (OCoLC)889313249  |z (OCoLC)961558618  |z (OCoLC)962691315  |z (OCoLC)965994685  |z (OCoLC)966385613  |z (OCoLC)988409573  |z (OCoLC)992064106  |z (OCoLC)1037764181  |z (OCoLC)1038695194  |z (OCoLC)1045547004  |z (OCoLC)1083554279  |z (OCoLC)1086408736  |z (OCoLC)1100831089  |z (OCoLC)1153455507  |z (OCoLC)1179571897  |z (OCoLC)1259162612 
037 |a itpro 
050 4 |a QA9.58  |b .S63 2012eb 
072 7 |a UY  |2 bicssc 
072 7 |a MAT  |x 041000  |2 bisacsh 
082 0 4 |a 518  |2 22 
049 |a UAMI 
100 1 |a Soltys, Michael,  |d 1971- 
245 1 3 |a An introduction to the analysis of algorithms /  |c Michael Soltys. 
250 |a 2nd ed. 
260 |a Singapore ;  |a Hackensack, NJ :  |b World Scientific Publishing Co.,  |c Ã2012. 
300 |a 1 online resource 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a data file  |2 rda 
504 |a Includes bibliographical references and index. 
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. 
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. 
546 |a English. 
590 |a eBooks on EBSCOhost  |b EBSCO eBook Subscription Academic Collection - Worldwide 
650 0 |a Algorithms  |v Textbooks. 
650 7 |a MATHEMATICS  |x Numerical Analysis.  |2 bisacsh 
650 7 |a Algorithms.  |2 fast  |0 (OCoLC)fst00805020 
655 7 |a Textbooks.  |2 fast  |0 (OCoLC)fst01423863 
776 0 |z 9789814401159 
776 0 |z 9789814401166 
856 4 0 |u https://ebsco.uam.elogim.com/login.aspx?direct=true&scope=site&db=nlebk&AN=478654  |z Texto completo 
938 |a Books 24x7  |b B247  |n bks00063238 
938 |a ebrary  |b EBRY  |n ebr10596906 
938 |a EBSCOhost  |b EBSC  |n 478654 
938 |a ProQuest MyiLibrary Digital eBook Collection  |b IDEB  |n 390620 
938 |a YBP Library Services  |b YANK  |n 7640079 
994 |a 92  |b IZTAP