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...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
Singapore
World Scientific Pub. Co.
c2012
|
Ausgabe: | 2nd ed |
Schlagworte: | |
Online-Zugang: | FHN01 Volltext |
Zusammenfassung: | 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 |
Beschreibung: | xiii, 197 p. ill |
ISBN: | 9789814401166 |
Internformat
MARC
LEADER | 00000nmm a2200000zc 4500 | ||
---|---|---|---|
001 | BV044638894 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | cr|uuu---uuuuu | ||
008 | 171120s2012 |||| o||u| ||||||eng d | ||
020 | |a 9789814401166 |c electronic bk. |9 978-981-4401-16-6 | ||
024 | 7 | |a 10.1142/8439 |2 doi | |
035 | |a (ZDB-124-WOP)00002779 | ||
035 | |a (OCoLC)874329818 | ||
035 | |a (DE-599)BVBBV044638894 | ||
040 | |a DE-604 |b ger |e aacr | ||
041 | 0 | |a eng | |
049 | |a DE-92 | ||
082 | 0 | |a 005.1 |2 22 | |
084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
100 | 1 | |a Soltys, Michael |e Verfasser |4 aut | |
245 | 1 | 0 | |a An introduction to the analysis of algorithms |c Michael Soltys |
250 | |a 2nd ed | ||
264 | 1 | |a Singapore |b World Scientific Pub. Co. |c c2012 | |
300 | |a xiii, 197 p. |b ill | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
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 | 4 | |a Computer algorithms | |
650 | 0 | 7 | |a Beweis |0 (DE-588)4132532-1 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Programmanalyse |0 (DE-588)4175841-9 |2 gnd |9 rswk-swf |
655 | 7 | |8 1\p |0 (DE-588)4151278-9 |a Einführung |2 gnd-content | |
689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 0 | 1 | |a Beweis |0 (DE-588)4132532-1 |D s |
689 | 0 | |8 2\p |5 DE-604 | |
689 | 1 | 0 | |a Programmanalyse |0 (DE-588)4175841-9 |D s |
689 | 1 | |8 3\p |5 DE-604 | |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9789814401159 |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9814401153 |
856 | 4 | 0 | |u http://www.worldscientific.com/worldscibooks/10.1142/8439#t=toc |x Verlag |z URL des Erstveroeffentlichers |3 Volltext |
912 | |a ZDB-124-WOP | ||
999 | |a oai:aleph.bib-bvb.de:BVB01-030036866 | ||
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
966 | e | |u http://www.worldscientific.com/worldscibooks/10.1142/8439#t=toc |l FHN01 |p ZDB-124-WOP |q FHN_PDA_WOP |x Verlag |3 Volltext |
Datensatz im Suchindex
_version_ | 1804178056286306304 |
---|---|
any_adam_object | |
author | Soltys, Michael |
author_facet | Soltys, Michael |
author_role | aut |
author_sort | Soltys, Michael |
author_variant | m s ms |
building | Verbundindex |
bvnumber | BV044638894 |
classification_rvk | ST 134 |
collection | ZDB-124-WOP |
ctrlnum | (ZDB-124-WOP)00002779 (OCoLC)874329818 (DE-599)BVBBV044638894 |
dewey-full | 005.1 |
dewey-hundreds | 000 - Computer science, information, general works |
dewey-ones | 005 - Computer programming, programs, data, security |
dewey-raw | 005.1 |
dewey-search | 005.1 |
dewey-sort | 15.1 |
dewey-tens | 000 - Computer science, information, general works |
discipline | Informatik |
edition | 2nd ed |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03303nmm a2200541zc 4500</leader><controlfield tag="001">BV044638894</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">171120s2012 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789814401166</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-981-4401-16-6</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1142/8439</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-124-WOP)00002779</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)874329818</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV044638894</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-92</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Soltys, Michael</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">An introduction to the analysis of algorithms</subfield><subfield code="c">Michael Soltys</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">2nd ed</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Singapore</subfield><subfield code="b">World Scientific Pub. Co.</subfield><subfield code="c">c2012</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xiii, 197 p.</subfield><subfield code="b">ill</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="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</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Beweis</subfield><subfield code="0">(DE-588)4132532-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmanalyse</subfield><subfield code="0">(DE-588)4175841-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><subfield code="0">(DE-588)4151278-9</subfield><subfield code="a">Einführung</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Beweis</subfield><subfield code="0">(DE-588)4132532-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Programmanalyse</subfield><subfield code="0">(DE-588)4175841-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9789814401159</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9814401153</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://www.worldscientific.com/worldscibooks/10.1142/8439#t=toc</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveroeffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-124-WOP</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030036866</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://www.worldscientific.com/worldscibooks/10.1142/8439#t=toc</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-124-WOP</subfield><subfield code="q">FHN_PDA_WOP</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
genre | 1\p (DE-588)4151278-9 Einführung gnd-content |
genre_facet | Einführung |
id | DE-604.BV044638894 |
illustrated | Not Illustrated |
indexdate | 2024-07-10T07:57:54Z |
institution | BVB |
isbn | 9789814401166 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030036866 |
oclc_num | 874329818 |
open_access_boolean | |
owner | DE-92 |
owner_facet | DE-92 |
physical | xiii, 197 p. ill |
psigel | ZDB-124-WOP ZDB-124-WOP FHN_PDA_WOP |
publishDate | 2012 |
publishDateSearch | 2012 |
publishDateSort | 2012 |
publisher | World Scientific Pub. Co. |
record_format | marc |
spelling | Soltys, Michael Verfasser aut An introduction to the analysis of algorithms Michael Soltys 2nd ed Singapore World Scientific Pub. Co. c2012 xiii, 197 p. ill txt rdacontent c rdamedia cr rdacarrier 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 Computer algorithms Beweis (DE-588)4132532-1 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Programmanalyse (DE-588)4175841-9 gnd rswk-swf 1\p (DE-588)4151278-9 Einführung gnd-content Algorithmus (DE-588)4001183-5 s Beweis (DE-588)4132532-1 s 2\p DE-604 Programmanalyse (DE-588)4175841-9 s 3\p DE-604 Erscheint auch als Druck-Ausgabe 9789814401159 Erscheint auch als Druck-Ausgabe 9814401153 http://www.worldscientific.com/worldscibooks/10.1142/8439#t=toc Verlag URL des Erstveroeffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | Soltys, Michael An introduction to the analysis of algorithms Computer algorithms Beweis (DE-588)4132532-1 gnd Algorithmus (DE-588)4001183-5 gnd Programmanalyse (DE-588)4175841-9 gnd |
subject_GND | (DE-588)4132532-1 (DE-588)4001183-5 (DE-588)4175841-9 (DE-588)4151278-9 |
title | An introduction to the analysis of algorithms |
title_auth | An introduction to the analysis of algorithms |
title_exact_search | An introduction to the analysis of algorithms |
title_full | An introduction to the analysis of algorithms Michael Soltys |
title_fullStr | An introduction to the analysis of algorithms Michael Soltys |
title_full_unstemmed | An introduction to the analysis of algorithms Michael Soltys |
title_short | An introduction to the analysis of algorithms |
title_sort | an introduction to the analysis of algorithms |
topic | Computer algorithms Beweis (DE-588)4132532-1 gnd Algorithmus (DE-588)4001183-5 gnd Programmanalyse (DE-588)4175841-9 gnd |
topic_facet | Computer algorithms Beweis Algorithmus Programmanalyse Einführung |
url | http://www.worldscientific.com/worldscibooks/10.1142/8439#t=toc |
work_keys_str_mv | AT soltysmichael anintroductiontotheanalysisofalgorithms |