An introduction to the analysis of algorithms:
3.2 Multiplying numbers in binary3.3 Savitchâ#x80;#x99;s algorithm; 3.4 Further examples and problems; 3.4.1 Extended Euclidâ#x80;#x99;s algorithm; 3.4.2 Quicksort; 3.4.3 Git bisect; 3.5 Answers to selected problems; 3.6 Notes; 4. Dynamic Programming; 4.1 Longest monotone subsequence problem; 4.2 Al...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
New Jersey ; London ; Singapore ; Beijing ; Shanghai ; Hong Kong ; Taipei ; Chennai ; Tokyo
World Scientific
[2018]
|
| Ausgabe: | 3rd edition |
| Schlagworte: | |
| Online-Zugang: | EUV01 TUM01 TUM02 UBY01 Volltext |
| Zusammenfassung: | 3.2 Multiplying numbers in binary3.3 Savitchâ#x80;#x99;s algorithm; 3.4 Further examples and problems; 3.4.1 Extended Euclidâ#x80;#x99;s algorithm; 3.4.2 Quicksort; 3.4.3 Git bisect; 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.2.1 Bellman-Ford algorithm; 4.3 Simple knapsack problem; 4.3.1 Dispersed knapsack problem; 4.3.2 General knapsack problem; 4.4 Activity selection problem; 4.5 Jobs with deadlines, durations and profits; 4.6 Further examples and problems; 4.6.1 Consecutive subsequence sum problem 4.6.2 Shuffle4.7 Answers to selected problems; 4.8 Notes; 5. Online Algorithms; 5.1 List accessing problem; 5.2 Paging; 5.2.1 Demand paging; 5.2.2 FIFO; 5.2.3 LRU; 5.2.4 Marking algorithms; 5.2.5 FWF; 5.2.6 LFD; 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.4.1 Diffie-Hellman key exchange; 6.4.2 ElGamal; 6.4.3 RSA; 6.5 Further problems; 6.6 Answers to selected problems; 6.7 Notes; 7. Algorithms in Linear Algebra; 7.1 Introduction; 7.2 Gaussian Elimination 7.2.1 Formal proofs of correctness over Z27.3 Gram-Schmidt; 7.4 Gaussian lattice reduction; 7.5 Computing the characteristic polynomial; 7.5.1 Csankyâ#x80;#x99;s algorithm; 7.5.2 Berkowitzâ#x80;#x99;s algorithm; 7.5.3 Proving properties of the characteristic polynomial; 7.6 Answers to selected problems; 7.7 Notes; 8. Computational Foundations; 8.1 Introduction; 8.2 Alphabets, strings and languages; 8.3 Regular languages; 8.3.1 Deterministic Finite Automaton; 8.3.2 Nondeterministic Finite Automata; 8.3.3 Regular Expressions; 8.3.3.1 Method 1; 8.3.3.2 Method 2; 8.3.4 Algebraic laws for Regular Expressions |
| Beschreibung: | Includes bibliographical references and index |
| Beschreibung: | 1 Online-Ressource |
| ISBN: | 9789813235915 9789813235922 9813235918 |
| DOI: | 10.1142/10875 |
Internformat
MARC
| LEADER | 00000nmm a22000001c 4500 | ||
|---|---|---|---|
| 001 | BV046639687 | ||
| 003 | DE-604 | ||
| 005 | 20210428 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 200325s2018 xxu|||| o||u| ||||||eng d | ||
| 020 | |a 9789813235915 |c Online |9 978-981-3235-91-5 | ||
| 020 | |a 9789813235922 |c Online |9 978-981-3235-92-2 | ||
| 020 | |a 9813235918 |c Online |9 981-323-591-8 | ||
| 024 | 7 | |a 10.1142/10875 |2 doi | |
| 035 | |a (OCoLC)1045420660 | ||
| 035 | |a (DE-599)GBV1019075007 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 044 | |a xxu |c XD-US | ||
| 049 | |a DE-91G |a DE-706 |a DE-521 | ||
| 050 | 0 | |a QA9.58 | |
| 082 | 0 | |a 518/.1 |2 23 | |
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a DAT 530 |2 stub | ||
| 100 | 1 | |a Soltys, Michael |d 1971- |e Verfasser |0 (DE-588)1075056675 |4 aut | |
| 245 | 1 | 0 | |a An introduction to the analysis of algorithms |c Michael Soltys, California State University Channel Islands, USA |
| 250 | |a 3rd edition | ||
| 264 | 1 | |a New Jersey ; London ; Singapore ; Beijing ; Shanghai ; Hong Kong ; Taipei ; Chennai ; Tokyo |b World Scientific |c [2018] | |
| 300 | |a 1 Online-Ressource | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Includes bibliographical references and index | ||
| 520 | 3 | |a 3.2 Multiplying numbers in binary3.3 Savitchâ#x80;#x99;s algorithm; 3.4 Further examples and problems; 3.4.1 Extended Euclidâ#x80;#x99;s algorithm; 3.4.2 Quicksort; 3.4.3 Git bisect; 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.2.1 Bellman-Ford algorithm; 4.3 Simple knapsack problem; 4.3.1 Dispersed knapsack problem; 4.3.2 General knapsack problem; 4.4 Activity selection problem; 4.5 Jobs with deadlines, durations and profits; 4.6 Further examples and problems; 4.6.1 Consecutive subsequence sum problem | |
| 520 | 3 | |a 4.6.2 Shuffle4.7 Answers to selected problems; 4.8 Notes; 5. Online Algorithms; 5.1 List accessing problem; 5.2 Paging; 5.2.1 Demand paging; 5.2.2 FIFO; 5.2.3 LRU; 5.2.4 Marking algorithms; 5.2.5 FWF; 5.2.6 LFD; 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.4.1 Diffie-Hellman key exchange; 6.4.2 ElGamal; 6.4.3 RSA; 6.5 Further problems; 6.6 Answers to selected problems; 6.7 Notes; 7. Algorithms in Linear Algebra; 7.1 Introduction; 7.2 Gaussian Elimination | |
| 520 | 3 | |a 7.2.1 Formal proofs of correctness over Z27.3 Gram-Schmidt; 7.4 Gaussian lattice reduction; 7.5 Computing the characteristic polynomial; 7.5.1 Csankyâ#x80;#x99;s algorithm; 7.5.2 Berkowitzâ#x80;#x99;s algorithm; 7.5.3 Proving properties of the characteristic polynomial; 7.6 Answers to selected problems; 7.7 Notes; 8. Computational Foundations; 8.1 Introduction; 8.2 Alphabets, strings and languages; 8.3 Regular languages; 8.3.1 Deterministic Finite Automaton; 8.3.2 Nondeterministic Finite Automata; 8.3.3 Regular Expressions; 8.3.3.1 Method 1; 8.3.3.2 Method 2; 8.3.4 Algebraic laws for Regular Expressions | |
| 650 | 0 | 7 | |a Beweis |0 (DE-588)4132532-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Programmanalyse |0 (DE-588)4175841-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 653 | 0 | |a Algorithms / Textbooks | |
| 655 | 7 | |8 1\p |0 (DE-588)4151278-9 |a Einführung |2 gnd-content | |
| 689 | 0 | 0 | |a Programmanalyse |0 (DE-588)4175841-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 1 | 1 | |a Beweis |0 (DE-588)4132532-1 |D s |
| 689 | 1 | |8 2\p |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe, Hardcover |z 978-981-3235-90-8 |
| 856 | 4 | 0 | |u https://doi.org/10.1142/10875 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-124-WOP | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-032051078 | ||
| 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 | |
| 966 | e | |u https://doi.org/10.1142/10875 |l EUV01 |p ZDB-124-WOP |q EUV_EK_WSP |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1142/10875 |l TUM01 |p ZDB-124-WOP |q TUM_Einzelkauf |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1142/10875 |l TUM02 |p ZDB-124-WOP |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1142/10875 |l UBY01 |p ZDB-124-WOP |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804181332698333184 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Soltys, Michael 1971- |
| author_GND | (DE-588)1075056675 |
| author_facet | Soltys, Michael 1971- |
| author_role | aut |
| author_sort | Soltys, Michael 1971- |
| author_variant | m s ms |
| building | Verbundindex |
| bvnumber | BV046639687 |
| callnumber-first | Q - Science |
| callnumber-label | QA9 |
| callnumber-raw | QA9.58 |
| callnumber-search | QA9.58 |
| callnumber-sort | QA 19.58 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 134 |
| classification_tum | DAT 530 |
| collection | ZDB-124-WOP |
| ctrlnum | (OCoLC)1045420660 (DE-599)GBV1019075007 |
| dewey-full | 518/.1 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 518 - Numerical analysis |
| dewey-raw | 518/.1 |
| dewey-search | 518/.1 |
| dewey-sort | 3518 11 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| discipline_str_mv | Informatik Mathematik |
| doi_str_mv | 10.1142/10875 |
| edition | 3rd edition |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04391nmm a22006371c 4500</leader><controlfield tag="001">BV046639687</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20210428 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">200325s2018 xxu|||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789813235915</subfield><subfield code="c">Online</subfield><subfield code="9">978-981-3235-91-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789813235922</subfield><subfield code="c">Online</subfield><subfield code="9">978-981-3235-92-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9813235918</subfield><subfield code="c">Online</subfield><subfield code="9">981-323-591-8</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1142/10875</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1045420660</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBV1019075007</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">xxu</subfield><subfield code="c">XD-US</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-521</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA9.58</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">518/.1</subfield><subfield code="2">23</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="084" ind1=" " ind2=" "><subfield code="a">DAT 530</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Soltys, Michael</subfield><subfield code="d">1971-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1075056675</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, California State University Channel Islands, USA</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">3rd edition</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New Jersey ; London ; Singapore ; Beijing ; Shanghai ; Hong Kong ; Taipei ; Chennai ; Tokyo</subfield><subfield code="b">World Scientific</subfield><subfield code="c">[2018]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource</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="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">3.2 Multiplying numbers in binary3.3 Savitchâ#x80;#x99;s algorithm; 3.4 Further examples and problems; 3.4.1 Extended Euclidâ#x80;#x99;s algorithm; 3.4.2 Quicksort; 3.4.3 Git bisect; 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.2.1 Bellman-Ford algorithm; 4.3 Simple knapsack problem; 4.3.1 Dispersed knapsack problem; 4.3.2 General knapsack problem; 4.4 Activity selection problem; 4.5 Jobs with deadlines, durations and profits; 4.6 Further examples and problems; 4.6.1 Consecutive subsequence sum problem</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">4.6.2 Shuffle4.7 Answers to selected problems; 4.8 Notes; 5. Online Algorithms; 5.1 List accessing problem; 5.2 Paging; 5.2.1 Demand paging; 5.2.2 FIFO; 5.2.3 LRU; 5.2.4 Marking algorithms; 5.2.5 FWF; 5.2.6 LFD; 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.4.1 Diffie-Hellman key exchange; 6.4.2 ElGamal; 6.4.3 RSA; 6.5 Further problems; 6.6 Answers to selected problems; 6.7 Notes; 7. Algorithms in Linear Algebra; 7.1 Introduction; 7.2 Gaussian Elimination</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">7.2.1 Formal proofs of correctness over Z27.3 Gram-Schmidt; 7.4 Gaussian lattice reduction; 7.5 Computing the characteristic polynomial; 7.5.1 Csankyâ#x80;#x99;s algorithm; 7.5.2 Berkowitzâ#x80;#x99;s algorithm; 7.5.3 Proving properties of the characteristic polynomial; 7.6 Answers to selected problems; 7.7 Notes; 8. Computational Foundations; 8.1 Introduction; 8.2 Alphabets, strings and languages; 8.3 Regular languages; 8.3.1 Deterministic Finite Automaton; 8.3.2 Nondeterministic Finite Automata; 8.3.3 Regular Expressions; 8.3.3.1 Method 1; 8.3.3.2 Method 2; 8.3.4 Algebraic laws for Regular Expressions</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">Programmanalyse</subfield><subfield code="0">(DE-588)4175841-9</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="653" ind1=" " ind2="0"><subfield code="a">Algorithms / Textbooks</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">Programmanalyse</subfield><subfield code="0">(DE-588)4175841-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" 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="1" 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="1" ind2=" "><subfield code="8">2\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, Hardcover</subfield><subfield code="z">978-981-3235-90-8</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1142/10875</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</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-032051078</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="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1142/10875</subfield><subfield code="l">EUV01</subfield><subfield code="p">ZDB-124-WOP</subfield><subfield code="q">EUV_EK_WSP</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1142/10875</subfield><subfield code="l">TUM01</subfield><subfield code="p">ZDB-124-WOP</subfield><subfield code="q">TUM_Einzelkauf</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1142/10875</subfield><subfield code="l">TUM02</subfield><subfield code="p">ZDB-124-WOP</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1142/10875</subfield><subfield code="l">UBY01</subfield><subfield code="p">ZDB-124-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.BV046639687 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T14:13:58Z |
| indexdate | 2024-07-10T08:49:59Z |
| institution | BVB |
| isbn | 9789813235915 9789813235922 9813235918 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032051078 |
| oclc_num | 1045420660 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-706 DE-521 |
| owner_facet | DE-91G DE-BY-TUM DE-706 DE-521 |
| physical | 1 Online-Ressource |
| psigel | ZDB-124-WOP ZDB-124-WOP EUV_EK_WSP ZDB-124-WOP TUM_Einzelkauf |
| publishDate | 2018 |
| publishDateSearch | 2018 |
| publishDateSort | 2018 |
| publisher | World Scientific |
| record_format | marc |
| spelling | Soltys, Michael 1971- Verfasser (DE-588)1075056675 aut An introduction to the analysis of algorithms Michael Soltys, California State University Channel Islands, USA 3rd edition New Jersey ; London ; Singapore ; Beijing ; Shanghai ; Hong Kong ; Taipei ; Chennai ; Tokyo World Scientific [2018] 1 Online-Ressource txt rdacontent c rdamedia cr rdacarrier Includes bibliographical references and index 3.2 Multiplying numbers in binary3.3 Savitchâ#x80;#x99;s algorithm; 3.4 Further examples and problems; 3.4.1 Extended Euclidâ#x80;#x99;s algorithm; 3.4.2 Quicksort; 3.4.3 Git bisect; 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.2.1 Bellman-Ford algorithm; 4.3 Simple knapsack problem; 4.3.1 Dispersed knapsack problem; 4.3.2 General knapsack problem; 4.4 Activity selection problem; 4.5 Jobs with deadlines, durations and profits; 4.6 Further examples and problems; 4.6.1 Consecutive subsequence sum problem 4.6.2 Shuffle4.7 Answers to selected problems; 4.8 Notes; 5. Online Algorithms; 5.1 List accessing problem; 5.2 Paging; 5.2.1 Demand paging; 5.2.2 FIFO; 5.2.3 LRU; 5.2.4 Marking algorithms; 5.2.5 FWF; 5.2.6 LFD; 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.4.1 Diffie-Hellman key exchange; 6.4.2 ElGamal; 6.4.3 RSA; 6.5 Further problems; 6.6 Answers to selected problems; 6.7 Notes; 7. Algorithms in Linear Algebra; 7.1 Introduction; 7.2 Gaussian Elimination 7.2.1 Formal proofs of correctness over Z27.3 Gram-Schmidt; 7.4 Gaussian lattice reduction; 7.5 Computing the characteristic polynomial; 7.5.1 Csankyâ#x80;#x99;s algorithm; 7.5.2 Berkowitzâ#x80;#x99;s algorithm; 7.5.3 Proving properties of the characteristic polynomial; 7.6 Answers to selected problems; 7.7 Notes; 8. Computational Foundations; 8.1 Introduction; 8.2 Alphabets, strings and languages; 8.3 Regular languages; 8.3.1 Deterministic Finite Automaton; 8.3.2 Nondeterministic Finite Automata; 8.3.3 Regular Expressions; 8.3.3.1 Method 1; 8.3.3.2 Method 2; 8.3.4 Algebraic laws for Regular Expressions Beweis (DE-588)4132532-1 gnd rswk-swf Programmanalyse (DE-588)4175841-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Algorithms / Textbooks 1\p (DE-588)4151278-9 Einführung gnd-content Programmanalyse (DE-588)4175841-9 s DE-604 Algorithmus (DE-588)4001183-5 s Beweis (DE-588)4132532-1 s 2\p DE-604 Erscheint auch als Druck-Ausgabe, Hardcover 978-981-3235-90-8 https://doi.org/10.1142/10875 Verlag URL des Erstveröffentlichers 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 |
| spellingShingle | Soltys, Michael 1971- An introduction to the analysis of algorithms Beweis (DE-588)4132532-1 gnd Programmanalyse (DE-588)4175841-9 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4132532-1 (DE-588)4175841-9 (DE-588)4001183-5 (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_exact_search_txtP | An introduction to the analysis of algorithms |
| title_full | An introduction to the analysis of algorithms Michael Soltys, California State University Channel Islands, USA |
| title_fullStr | An introduction to the analysis of algorithms Michael Soltys, California State University Channel Islands, USA |
| title_full_unstemmed | An introduction to the analysis of algorithms Michael Soltys, California State University Channel Islands, USA |
| title_short | An introduction to the analysis of algorithms |
| title_sort | an introduction to the analysis of algorithms |
| topic | Beweis (DE-588)4132532-1 gnd Programmanalyse (DE-588)4175841-9 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Beweis Programmanalyse Algorithmus Einführung |
| url | https://doi.org/10.1142/10875 |
| work_keys_str_mv | AT soltysmichael anintroductiontotheanalysisofalgorithms |