Algorithms: design and analysis
Algorithms play a central role both in the theory and in the practice of computing. The goal of the authors was to write a textbook that would not trivialize the subject but would still be readable by most students on their own. The book contains over 120 exercises. Some of them are drills; others m...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Berlin ; Boston
De Gruyter
[2021]
|
| Schriftenreihe: | De Gruyter Textbook
|
| Schlagworte: | |
| Online-Zugang: | FAB01 FAW01 FCO01 FHA01 FHI01 FHR01 FKE01 FLA01 FWS01 FWS02 TUM01 UBY01 UPA01 Volltext |
| Zusammenfassung: | Algorithms play a central role both in the theory and in the practice of computing. The goal of the authors was to write a textbook that would not trivialize the subject but would still be readable by most students on their own. The book contains over 120 exercises. Some of them are drills; others make important points about the material covered in the text or introduce new algorithms not covered there. The book also provides programming projects. From the Table of Contents: Chapter 1: Basic knowledge of Mathematics, Relations, Recurrence relation and Solution techniques, Function and Growth of functions. Chapter 2: Different Sorting Techniques and their analysis. Chapter 3: Greedy approach, Dynamic Programming, Brach and Bound techniques, Backtracking and Problems, Amortized analysis, and Order Statics. Chapter 4: Graph algorithms, BFS, DFS, Spanning Tree, Flow Maximization Algorithms. Shortest Path Algorithms. Chapter 5: Binary search tree, Red black Tree, Binomial heap, B-Tree and Fibonacci Heap. Chapter 6: Approximation Algorithms, Sorting Networks, Matrix operations, Fast Fourier Transformation, Number theoretic Algorithm, Computational geometry Randomized Algorithms, String matching, NP-Hard, NP-Completeness, Cooks theorem |
| Beschreibung: | 1 Online-Ressource (X, 168 Seiten) |
| ISBN: | 9783110693607 9783110693751 |
| DOI: | 10.1515/9783110693607 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV047224394 | ||
| 003 | DE-604 | ||
| 005 | 20230830 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 210406s2021 |||| o||u| ||||||eng d | ||
| 020 | |a 9783110693607 |c Online, PDF |9 978-3-11-069360-7 | ||
| 020 | |a 9783110693751 |c Online, ePub |9 978-3-11-069375-1 | ||
| 024 | 7 | |a 10.1515/9783110693607 |2 doi | |
| 035 | |a (ZDB-23-DGG)9783110693607 | ||
| 035 | |a (OCoLC)1245336379 | ||
| 035 | |a (DE-599)BVBBV047224394 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-1043 |a DE-1046 |a DE-858 |a DE-Aug4 |a DE-859 |a DE-860 |a DE-739 |a DE-91 |a DE-706 |a DE-573 |a DE-863 |a DE-862 |a DE-898 |a DE-83 | ||
| 082 | 0 | |a 005.13 | |
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a DAT 530 |2 stub | ||
| 100 | 1 | |a Dimri, Sushil C. |e Verfasser |0 (DE-588)1231821825 |4 aut | |
| 245 | 1 | 0 | |a Algorithms |b design and analysis |c Sushil C. Dimri, Preeti Malik, Mangey Ram |
| 264 | 1 | |a Berlin ; Boston |b De Gruyter |c [2021] | |
| 264 | 4 | |c © 2021 | |
| 300 | |a 1 Online-Ressource (X, 168 Seiten) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a De Gruyter Textbook | |
| 520 | |a Algorithms play a central role both in the theory and in the practice of computing. The goal of the authors was to write a textbook that would not trivialize the subject but would still be readable by most students on their own. The book contains over 120 exercises. Some of them are drills; others make important points about the material covered in the text or introduce new algorithms not covered there. The book also provides programming projects. From the Table of Contents: Chapter 1: Basic knowledge of Mathematics, Relations, Recurrence relation and Solution techniques, Function and Growth of functions. Chapter 2: Different Sorting Techniques and their analysis. Chapter 3: Greedy approach, Dynamic Programming, Brach and Bound techniques, Backtracking and Problems, Amortized analysis, and Order Statics. Chapter 4: Graph algorithms, BFS, DFS, Spanning Tree, Flow Maximization Algorithms. Shortest Path Algorithms. Chapter 5: Binary search tree, Red black Tree, Binomial heap, B-Tree and Fibonacci Heap. Chapter 6: Approximation Algorithms, Sorting Networks, Matrix operations, Fast Fourier Transformation, Number theoretic Algorithm, Computational geometry Randomized Algorithms, String matching, NP-Hard, NP-Completeness, Cooks theorem | ||
| 650 | 4 | |a Algorithmen | |
| 650 | 4 | |a Datenstrukturen | |
| 650 | 4 | |a Künstliche Intelligenz | |
| 650 | 4 | |a Maschinelles Lernen | |
| 650 | 7 | |a COMPUTERS / Programming / Algorithms |2 bisacsh | |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Malik, Preeti |e Verfasser |0 (DE-588)1231822384 |4 aut | |
| 700 | 1 | |a Ram, Mangey |d 1980- |e Verfasser |0 (DE-588)1144926335 |4 aut | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-3-11-069341-6 |
| 856 | 4 | 0 | |u https://doi.org/10.1515/9783110693607 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-23-DGG |a ZDB-23-DEI | ||
| 940 | 1 | |q ZDB-23-DEI21 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-032628942 | ||
| 966 | e | |u https://doi.org/10.1515/9783110693607 |l FAB01 |p ZDB-23-DGG |q FAB_PDA_DGG |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1515/9783110693607 |l FAW01 |p ZDB-23-DGG |q FAW_PDA_DGG |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1515/9783110693607 |l FCO01 |p ZDB-23-DGG |q FCO_PDA_DGG |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1515/9783110693607 |l FHA01 |p ZDB-23-DGG |q FHA_PDA_DGG |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1515/9783110693607 |l FHI01 |p ZDB-23-DEI |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1515/9783110693607 |l FHR01 |p ZDB-23-DEI |q ZDB-23-DEI21_PuC23 |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1515/9783110693607 |l FKE01 |p ZDB-23-DGG |q FKE_PDA_DGG |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1515/9783110693607 |l FLA01 |p ZDB-23-DGG |q FLA_PDA_DGG |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1515/9783110693607 |l FWS01 |p ZDB-23-DEI |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1515/9783110693607 |l FWS01 |p ZDB-23-DEI |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1515/9783110693607 |l FWS02 |p ZDB-23-DEI |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1515/9783110693607 |l FWS02 |p ZDB-23-DEI |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1515/9783110693607 |l TUM01 |p ZDB-23-DEI |q TUM_Paketkauf |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1515/9783110693607 |l UBY01 |p ZDB-23-DEI |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1515/9783110693607 |l UPA01 |p ZDB-23-DGG |q UPA_PDA_DGG_Kauf2020-21 |x Verlag |3 Volltext | |
Datensatz im Suchindex
| DE-BY-FWS_katkey | 878394 |
|---|---|
| _version_ | 1806194436744413184 |
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Dimri, Sushil C. Malik, Preeti Ram, Mangey 1980- |
| author_GND | (DE-588)1231821825 (DE-588)1231822384 (DE-588)1144926335 |
| author_facet | Dimri, Sushil C. Malik, Preeti Ram, Mangey 1980- |
| author_role | aut aut aut |
| author_sort | Dimri, Sushil C. |
| author_variant | s c d sc scd p m pm m r mr |
| building | Verbundindex |
| bvnumber | BV047224394 |
| classification_rvk | ST 134 |
| classification_tum | DAT 530 |
| collection | ZDB-23-DGG ZDB-23-DEI |
| ctrlnum | (ZDB-23-DGG)9783110693607 (OCoLC)1245336379 (DE-599)BVBBV047224394 |
| dewey-full | 005.13 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.13 |
| dewey-search | 005.13 |
| dewey-sort | 15.13 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| doi_str_mv | 10.1515/9783110693607 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04685nmm a2200709zc 4500</leader><controlfield tag="001">BV047224394</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20230830 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">210406s2021 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783110693607</subfield><subfield code="c">Online, PDF</subfield><subfield code="9">978-3-11-069360-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783110693751</subfield><subfield code="c">Online, ePub</subfield><subfield code="9">978-3-11-069375-1</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/9783110693607</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-23-DGG)9783110693607</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1245336379</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047224394</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="049" ind1=" " ind2=" "><subfield code="a">DE-1043</subfield><subfield code="a">DE-1046</subfield><subfield code="a">DE-858</subfield><subfield code="a">DE-Aug4</subfield><subfield code="a">DE-859</subfield><subfield code="a">DE-860</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-573</subfield><subfield code="a">DE-863</subfield><subfield code="a">DE-862</subfield><subfield code="a">DE-898</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.13</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">Dimri, Sushil C.</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1231821825</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms</subfield><subfield code="b">design and analysis</subfield><subfield code="c">Sushil C. Dimri, Preeti Malik, Mangey Ram</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin ; Boston</subfield><subfield code="b">De Gruyter</subfield><subfield code="c">[2021]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 2021</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (X, 168 Seiten)</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="490" ind1="0" ind2=" "><subfield code="a">De Gruyter Textbook</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Algorithms play a central role both in the theory and in the practice of computing. The goal of the authors was to write a textbook that would not trivialize the subject but would still be readable by most students on their own. The book contains over 120 exercises. Some of them are drills; others make important points about the material covered in the text or introduce new algorithms not covered there. The book also provides programming projects. From the Table of Contents: Chapter 1: Basic knowledge of Mathematics, Relations, Recurrence relation and Solution techniques, Function and Growth of functions. Chapter 2: Different Sorting Techniques and their analysis. Chapter 3: Greedy approach, Dynamic Programming, Brach and Bound techniques, Backtracking and Problems, Amortized analysis, and Order Statics. Chapter 4: Graph algorithms, BFS, DFS, Spanning Tree, Flow Maximization Algorithms. Shortest Path Algorithms. Chapter 5: Binary search tree, Red black Tree, Binomial heap, B-Tree and Fibonacci Heap. Chapter 6: Approximation Algorithms, Sorting Networks, Matrix operations, Fast Fourier Transformation, Number theoretic Algorithm, Computational geometry Randomized Algorithms, String matching, NP-Hard, NP-Completeness, Cooks theorem</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmen</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenstrukturen</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Künstliche Intelligenz</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Maschinelles Lernen</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Programming / Algorithms</subfield><subfield code="2">bisacsh</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="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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Malik, Preeti</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1231822384</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ram, Mangey</subfield><subfield code="d">1980-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1144926335</subfield><subfield code="4">aut</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">978-3-11-069341-6</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/9783110693607</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-23-DGG</subfield><subfield code="a">ZDB-23-DEI</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-23-DEI21</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032628942</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9783110693607</subfield><subfield code="l">FAB01</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">FAB_PDA_DGG</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.1515/9783110693607</subfield><subfield code="l">FAW01</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">FAW_PDA_DGG</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.1515/9783110693607</subfield><subfield code="l">FCO01</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">FCO_PDA_DGG</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.1515/9783110693607</subfield><subfield code="l">FHA01</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">FHA_PDA_DGG</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.1515/9783110693607</subfield><subfield code="l">FHI01</subfield><subfield code="p">ZDB-23-DEI</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.1515/9783110693607</subfield><subfield code="l">FHR01</subfield><subfield code="p">ZDB-23-DEI</subfield><subfield code="q">ZDB-23-DEI21_PuC23</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.1515/9783110693607</subfield><subfield code="l">FKE01</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">FKE_PDA_DGG</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.1515/9783110693607</subfield><subfield code="l">FLA01</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">FLA_PDA_DGG</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.1515/9783110693607</subfield><subfield code="l">FWS01</subfield><subfield code="p">ZDB-23-DEI</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.1515/9783110693607</subfield><subfield code="l">FWS01</subfield><subfield code="p">ZDB-23-DEI</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.1515/9783110693607</subfield><subfield code="l">FWS02</subfield><subfield code="p">ZDB-23-DEI</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.1515/9783110693607</subfield><subfield code="l">FWS02</subfield><subfield code="p">ZDB-23-DEI</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.1515/9783110693607</subfield><subfield code="l">TUM01</subfield><subfield code="p">ZDB-23-DEI</subfield><subfield code="q">TUM_Paketkauf</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.1515/9783110693607</subfield><subfield code="l">UBY01</subfield><subfield code="p">ZDB-23-DEI</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.1515/9783110693607</subfield><subfield code="l">UPA01</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">UPA_PDA_DGG_Kauf2020-21</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV047224394 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T16:58:48Z |
| indexdate | 2024-08-01T16:07:24Z |
| institution | BVB |
| isbn | 9783110693607 9783110693751 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032628942 |
| oclc_num | 1245336379 |
| open_access_boolean | |
| owner | DE-1043 DE-1046 DE-858 DE-Aug4 DE-859 DE-860 DE-739 DE-91 DE-BY-TUM DE-706 DE-573 DE-863 DE-BY-FWS DE-862 DE-BY-FWS DE-898 DE-BY-UBR DE-83 |
| owner_facet | DE-1043 DE-1046 DE-858 DE-Aug4 DE-859 DE-860 DE-739 DE-91 DE-BY-TUM DE-706 DE-573 DE-863 DE-BY-FWS DE-862 DE-BY-FWS DE-898 DE-BY-UBR DE-83 |
| physical | 1 Online-Ressource (X, 168 Seiten) |
| psigel | ZDB-23-DGG ZDB-23-DEI ZDB-23-DEI21 ZDB-23-DGG FAB_PDA_DGG ZDB-23-DGG FAW_PDA_DGG ZDB-23-DGG FCO_PDA_DGG ZDB-23-DGG FHA_PDA_DGG ZDB-23-DEI ZDB-23-DEI21_PuC23 ZDB-23-DGG FKE_PDA_DGG ZDB-23-DGG FLA_PDA_DGG ZDB-23-DEI TUM_Paketkauf ZDB-23-DGG UPA_PDA_DGG_Kauf2020-21 |
| publishDate | 2021 |
| publishDateSearch | 2021 |
| publishDateSort | 2021 |
| publisher | De Gruyter |
| record_format | marc |
| series2 | De Gruyter Textbook |
| spellingShingle | Dimri, Sushil C. Malik, Preeti Ram, Mangey 1980- Algorithms design and analysis Algorithmen Datenstrukturen Künstliche Intelligenz Maschinelles Lernen COMPUTERS / Programming / Algorithms bisacsh Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4001183-5 |
| title | Algorithms design and analysis |
| title_auth | Algorithms design and analysis |
| title_exact_search | Algorithms design and analysis |
| title_exact_search_txtP | Algorithms design and analysis |
| title_full | Algorithms design and analysis Sushil C. Dimri, Preeti Malik, Mangey Ram |
| title_fullStr | Algorithms design and analysis Sushil C. Dimri, Preeti Malik, Mangey Ram |
| title_full_unstemmed | Algorithms design and analysis Sushil C. Dimri, Preeti Malik, Mangey Ram |
| title_short | Algorithms |
| title_sort | algorithms design and analysis |
| title_sub | design and analysis |
| topic | Algorithmen Datenstrukturen Künstliche Intelligenz Maschinelles Lernen COMPUTERS / Programming / Algorithms bisacsh Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Algorithmen Datenstrukturen Künstliche Intelligenz Maschinelles Lernen COMPUTERS / Programming / Algorithms Algorithmus |
| url | https://doi.org/10.1515/9783110693607 |
| work_keys_str_mv | AT dimrisushilc algorithmsdesignandanalysis AT malikpreeti algorithmsdesignandanalysis AT rammangey algorithmsdesignandanalysis |